[{"doi":"10.1007/978-3-031-47754-6_1","oa":1,"type":"conference","conference":{"start_date":"2023-05-01","name":"FC: Financial Cryptography and Data Security","end_date":"2023-05-05","location":"Bol, Brac, Croatia"},"main_file_link":[{"url":"https://eprint.iacr.org/2022/1554","open_access":"1"}],"corr_author":"1","acknowledgement":"Eleftherios Kokoris-Kogias is partially supported by Austrian Science Fund (FWF) grant No: F8512-N.","article_processing_charge":"No","publication_identifier":{"issn":["1611-3349"],"eisbn":["9783031477546"],"isbn":["9783031477539"],"eissn":["0302-9743"]},"citation":{"mla":"Stefo, Christos, et al. “Executing and Proving over Dirty Ledgers.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">10.1007/978-3-031-47754-6_1</a>.","chicago":"Stefo, Christos, Zhuolun Xiang, and Eleftherios Kokoris Kogias. “Executing and Proving over Dirty Ledgers.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:3–20. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">https://doi.org/10.1007/978-3-031-47754-6_1</a>.","ieee":"C. Stefo, Z. Xiang, and E. Kokoris Kogias, “Executing and proving over dirty ledgers,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 3–20.","apa":"Stefo, C., Xiang, Z., &#38; Kokoris Kogias, E. (2023). Executing and proving over dirty ledgers. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 3–20). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">https://doi.org/10.1007/978-3-031-47754-6_1</a>","ista":"Stefo C, Xiang Z, Kokoris Kogias E. 2023. Executing and proving over dirty ledgers. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 3–20.","ama":"Stefo C, Xiang Z, Kokoris Kogias E. Executing and proving over dirty ledgers. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">10.1007/978-3-031-47754-6_1</a>","short":"C. Stefo, Z. Xiang, E. Kokoris Kogias, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 3–20."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ElKo"},{"_id":"GradSch"}],"alternative_title":["LNCS"],"publisher":"Springer Nature","intvolume":"     13950","date_published":"2023-12-01T00:00:00Z","quality_controlled":"1","day":"01","project":[{"grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f"}],"volume":13950,"isi":1,"year":"2023","page":"3-20","abstract":[{"lang":"eng","text":"Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition.\r\nIf we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input.\r\nThis “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs."}],"oa_version":"Preprint","external_id":{"isi":["001150222600001"]},"date_created":"2024-01-08T09:17:38Z","title":"Executing and proving over dirty ledgers","scopus_import":"1","status":"public","language":[{"iso":"eng"}],"publication":"27th International Conference on Financial Cryptography and Data Security","_id":"14735","author":[{"id":"a20e8902-32b0-11ee-9fa8-b23fa638b793","last_name":"Stefo","full_name":"Stefo, Christos","first_name":"Christos"},{"full_name":"Xiang, Zhuolun","first_name":"Zhuolun","last_name":"Xiang"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios"}],"month":"12","date_updated":"2025-09-09T14:07:16Z","publication_status":"published"},{"acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","conference":{"start_date":"2023-05-01","name":"FC: Financial Cryptography and Data Security","end_date":"2023-05-05","location":"Bol, Brac, Croatia"},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Dg0qdd9uha"}],"type":"conference","oa":1,"doi":"10.1007/978-3-031-47754-6_18","day":"01","quality_controlled":"1","date_published":"2023-12-01T00:00:00Z","intvolume":"     13950","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"alternative_title":["LNCS"],"citation":{"ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:309-325. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>","short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>.","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.","apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:309–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>.","ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325."},"publisher":"Springer Nature","publication_identifier":{"eisbn":["9783031477546"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031477539"]},"article_processing_charge":"No","external_id":{"isi":["001150222600018"]},"date_created":"2024-01-08T09:30:22Z","oa_version":"Submitted Version","abstract":[{"text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks.","lang":"eng"}],"ec_funded":1,"page":"309-325","volume":13950,"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"isi":1,"year":"2023","OA_type":"green","date_updated":"2025-11-05T07:37:31Z","publication_status":"published","author":[{"last_name":"Bastankhah","first_name":"Mahsa","full_name":"Bastankhah, Mahsa"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Maddah-Ali, Mohammad Ali","first_name":"Mohammad Ali","last_name":"Maddah-Ali"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"orcid":"0000-0002-1419-3267","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809","first_name":"Michelle X","full_name":"Yeo, Michelle X"}],"month":"12","_id":"14736","language":[{"iso":"eng"}],"publication":"27th International Conference on Financial Cryptography and Data Security","title":"R2: Boosting liquidity in payment channel networks with online admission control","status":"public","scopus_import":"1"},{"publication_status":"published","date_updated":"2025-09-09T14:08:25Z","ddc":["510"],"month":"12","author":[{"first_name":"Grigory","full_name":"Ivanov, Grigory","last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"},{"full_name":"Naszódi, Márton","first_name":"Márton","last_name":"Naszódi"}],"publication":"International Mathematics Research Notices","language":[{"iso":"eng"}],"_id":"14737","scopus_import":"1","file":[{"file_size":815777,"checksum":"353666cea80633beb0f1ffd342dff6d4","date_updated":"2024-01-08T09:53:09Z","success":1,"date_created":"2024-01-08T09:53:09Z","creator":"dernst","file_id":"14738","file_name":"2023_IMRN_Ivanov.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"status":"public","title":"Functional John and Löwner conditions for pairs of log-concave functions","article_type":"original","date_created":"2024-01-08T09:48:56Z","external_id":{"isi":["001184146800001"],"arxiv":["2212.11781"]},"oa_version":"Published Version","page":"20613-20669","abstract":[{"lang":"eng","text":"John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies."}],"year":"2023","volume":2023,"isi":1,"quality_controlled":"1","day":"01","arxiv":1,"intvolume":"      2023","date_published":"2023-12-01T00:00:00Z","issue":"23","publisher":"Oxford University Press","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 20613–20669.","ama":"Ivanov G, Naszódi M. Functional John and Löwner conditions for pairs of log-concave functions. <i>International Mathematics Research Notices</i>. 2023;2023(23):20613-20669. doi:<a href=\"https://doi.org/10.1093/imrn/rnad210\">10.1093/imrn/rnad210</a>","ista":"Ivanov G, Naszódi M. 2023. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023(23), 20613–20669.","apa":"Ivanov, G., &#38; Naszódi, M. (2023). Functional John and Löwner conditions for pairs of log-concave functions. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnad210\">https://doi.org/10.1093/imrn/rnad210</a>","chicago":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/imrn/rnad210\">https://doi.org/10.1093/imrn/rnad210</a>.","ieee":"G. Ivanov and M. Naszódi, “Functional John and Löwner conditions for pairs of log-concave functions,” <i>International Mathematics Research Notices</i>, vol. 2023, no. 23. Oxford University Press, pp. 20613–20669, 2023.","mla":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” <i>International Mathematics Research Notices</i>, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:<a href=\"https://doi.org/10.1093/imrn/rnad210\">10.1093/imrn/rnad210</a>."},"department":[{"_id":"UlWa"}],"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"keyword":["General Mathematics"],"acknowledgement":"We thank Alexander Litvak for the many discussions on Theorem 1.1. Igor Tsiutsiurupa participated in the early stage of this project. To our deep regret, Igor chose another road for his life and stopped working with us.\r\nThis work was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences [to M.N.]; the National Research, Development, and Innovation Fund (NRDI) [K119670 and K131529 to M.N.]; and the ÚNKP-22-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the NRDI [to M.N.].","has_accepted_license":"1","corr_author":"1","type":"journal_article","file_date_updated":"2024-01-08T09:53:09Z","doi":"10.1093/imrn/rnad210","oa":1},{"intvolume":"        45","date_published":"2023-12-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"issue":"12","publisher":"IEEE","citation":{"short":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, M. Soriano Trigueros, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (2023) 14069–14080.","ama":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. A survey of vectorization methods in topological data analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2023;45(12):14069-14080. doi:<a href=\"https://doi.org/10.1109/tpami.2023.3308391\">10.1109/tpami.2023.3308391</a>","ista":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. 2023. A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 45(12), 14069–14080.","apa":"Ali, D., Asaad, A., Jimenez, M.-J., Nanda, V., Paluzo-Hidalgo, E., &#38; Soriano Trigueros, M. (2023). A survey of vectorization methods in topological data analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2023.3308391\">https://doi.org/10.1109/tpami.2023.3308391</a>","chicago":"Ali, Dashti, Aras Asaad, Maria-Jose Jimenez, Vidit Nanda, Eduardo Paluzo-Hidalgo, and Manuel Soriano Trigueros. “A Survey of Vectorization Methods in Topological Data Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/tpami.2023.3308391\">https://doi.org/10.1109/tpami.2023.3308391</a>.","ieee":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, and M. Soriano Trigueros, “A survey of vectorization methods in topological data analysis,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 45, no. 12. IEEE, pp. 14069–14080, 2023.","mla":"Ali, Dashti, et al. “A Survey of Vectorization Methods in Topological Data Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 45, no. 12, IEEE, 2023, pp. 14069–80, doi:<a href=\"https://doi.org/10.1109/tpami.2023.3308391\">10.1109/tpami.2023.3308391</a>."},"department":[{"_id":"HeEd"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Applied Mathematics","Artificial Intelligence","Computational Theory and Mathematics","Computer Vision and Pattern Recognition","Software"],"acknowledgement":"The work of Maria-Jose Jimenez, Eduardo Paluzo-Hidalgo and Manuel Soriano-Trigueros was supported in part by the Spanish grant Ministerio de Ciencia e Innovacion under Grants TED2021-129438B-I00 and PID2019-107339GB-I00, and in part by REXASI-PRO H-EU project, call HORIZON-CL4-2021-HUMAN-01-01 under Grant 101070028. The work of\r\nMaria-Jose Jimenez was supported by a grant of Convocatoria de la Universidad de Sevilla para la recualificacion del sistema universitario español, 2021-23, funded by the European Union, NextGenerationEU. The work of Vidit Nanda was supported in part by EPSRC under Grant EP/R018472/1 and in part by US AFOSR under Grant FA9550-22-1-0462. \r\nWe are grateful to the team of GUDHI and TEASPOON developers, for their work and their support. We are also grateful to Streamlit for providing extra resources to deploy the web app\r\nonline on Streamlit community cloud. We thank the anonymous referees for their helpful suggestions.","has_accepted_license":"1","doi":"10.1109/tpami.2023.3308391","oa":1,"type":"journal_article","file_date_updated":"2024-01-08T10:09:14Z","author":[{"full_name":"Ali, Dashti","first_name":"Dashti","last_name":"Ali"},{"last_name":"Asaad","first_name":"Aras","full_name":"Asaad, Aras"},{"first_name":"Maria-Jose","full_name":"Jimenez, Maria-Jose","last_name":"Jimenez"},{"first_name":"Vidit","full_name":"Nanda, Vidit","last_name":"Nanda"},{"full_name":"Paluzo-Hidalgo, Eduardo","first_name":"Eduardo","last_name":"Paluzo-Hidalgo"},{"last_name":"Soriano Trigueros","id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8","orcid":"0000-0003-2449-1433","first_name":"Manuel","full_name":"Soriano Trigueros, Manuel"}],"month":"12","publication_status":"published","date_updated":"2025-09-09T14:08:56Z","ddc":["000"],"file":[{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2023_IEEEToP_Ali.pdf","creator":"dernst","file_id":"14740","success":1,"date_created":"2024-01-08T10:09:14Z","date_updated":"2024-01-08T10:09:14Z","file_size":2370988,"checksum":"465c28ef0b151b4b1fb47977ed5581ab"}],"status":"public","scopus_import":"1","title":"A survey of vectorization methods in topological data analysis","article_type":"original","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","language":[{"iso":"eng"}],"_id":"14739","oa_version":"Published Version","date_created":"2024-01-08T09:59:46Z","external_id":{"isi":["001104973300002"]},"year":"2023","volume":45,"isi":1,"page":"14069-14080","abstract":[{"text":"Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods.","lang":"eng"}]},{"_id":"14742","language":[{"iso":"eng"}],"publication":"Cold Spring Harbor Perspectives in Biology","article_type":"original","scopus_import":"1","status":"public","title":"The impact of chromosomal rearrangements in speciation: From micro- to macroevolution","publication_status":"published","date_updated":"2025-09-09T14:09:32Z","month":"11","author":[{"last_name":"Lucek","full_name":"Lucek, Kay","first_name":"Kay"},{"last_name":"Giménez","first_name":"Mabel D.","full_name":"Giménez, Mabel D."},{"full_name":"Joron, Mathieu","first_name":"Mathieu","last_name":"Joron"},{"last_name":"Rafajlović","full_name":"Rafajlović, Marina","first_name":"Marina"},{"first_name":"Jeremy B.","full_name":"Searle, Jeremy B.","last_name":"Searle"},{"last_name":"Walden","full_name":"Walden, Nora","first_name":"Nora"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M","first_name":"Anja M","orcid":"0000-0003-1050-4969"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"}],"abstract":[{"text":"Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics.\r\nWhile an important role for CRs in speciation has been suggested, evidence primarily stems\r\nfrom theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon\r\npairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at\r\na macroevolutionary level has been supported by associations between species diversity and\r\nrates of evolution of CRs across phylogenies, these findings are limited to a restricted range of\r\nCRs and taxa. Now that more broadly applicable and precise CR detection approaches have\r\nbecome available, we address the challenges in filling some of the conceptual and empirical\r\ngaps between micro- and macroevolutionary studies on the role of CRs in speciation. We\r\nsynthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life.","lang":"eng"}],"year":"2023","volume":15,"isi":1,"external_id":{"isi":["001096272600001"],"pmid":["37604585"]},"date_created":"2024-01-08T12:43:48Z","oa_version":"Published Version","issue":"11","publisher":"Cold Spring Harbor Laboratory Press","citation":{"ama":"Lucek K, Giménez MD, Joron M, et al. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. 2023;15(11). doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>","short":"K. Lucek, M.D. Giménez, M. Joron, M. Rafajlović, J.B. Searle, N. Walden, A.M. Westram, R. Faria, Cold Spring Harbor Perspectives in Biology 15 (2023).","mla":"Lucek, Kay, et al. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11, a041447, Cold Spring Harbor Laboratory Press, 2023, doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>.","ista":"Lucek K, Giménez MD, Joron M, Rafajlović M, Searle JB, Walden N, Westram AM, Faria R. 2023. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. 15(11), a041447.","apa":"Lucek, K., Giménez, M. D., Joron, M., Rafajlović, M., Searle, J. B., Walden, N., … Faria, R. (2023). The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>","chicago":"Lucek, Kay, Mabel D. Giménez, Mathieu Joron, Marina Rafajlović, Jeremy B. Searle, Nora Walden, Anja M Westram, and Rui Faria. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press, 2023. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>.","ieee":"K. Lucek <i>et al.</i>, “The impact of chromosomal rearrangements in speciation: From micro- to macroevolution,” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11. Cold Spring Harbor Laboratory Press, 2023."},"department":[{"_id":"NiBa"},{"_id":"BeVi"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["1943-0264"]},"article_processing_charge":"No","day":"01","quality_controlled":"1","date_published":"2023-11-01T00:00:00Z","intvolume":"        15","main_file_link":[{"url":"https://doi.org/10.1101/cshperspect.a041447","open_access":"1"}],"pmid":1,"type":"journal_article","oa":1,"doi":"10.1101/cshperspect.a041447","acknowledgement":"K.L. was funded by a Swiss National Science Foundation Eccellenza project: The evolution of strong reproductive barriers towards the completion of speciation (PCEFP3_202869). R.F.\r\nwas funded by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao\r\nEmprego Científico) contract (2020.00275. CEECIND) and by an FCT research project\r\n(PTDC/BIA-EVL/1614/2021). M.R. was funded by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243). A.M.W. was partly funded by the Norwegian Research Council RCN. We thank Luis Silva for his help preparing Figure 1. We are grateful to Maren Wellenreuther, Daniel Bolnick, and two anonymous reviewers for their constructive feedback on an earlier version of this paper.","keyword":["General Biochemistry","Genetics and Molecular Biology"],"article_number":"a041447"},{"oa_version":"Published Version","date_created":"2024-01-08T12:54:35Z","external_id":{"isi":["001135072900018"]},"isi":1,"year":"2023","abstract":[{"lang":"eng","text":"Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments."}],"page":"281-297","month":"10","author":[{"full_name":"Tennage, Pasindu","first_name":"Pasindu","last_name":"Tennage"},{"first_name":"Cristina","full_name":"Basescu, Cristina","last_name":"Basescu"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios"},{"full_name":"Syta, Ewa","first_name":"Ewa","last_name":"Syta"},{"full_name":"Jovanovic, Philipp","first_name":"Philipp","last_name":"Jovanovic"},{"last_name":"Estrada-Galinanes","first_name":"Vero","full_name":"Estrada-Galinanes, Vero"},{"last_name":"Ford","first_name":"Bryan","full_name":"Ford, Bryan"}],"date_updated":"2025-09-09T14:10:09Z","publication_status":"published","title":"QuePaxa: Escaping the tyranny of timeouts in consensus","scopus_import":"1","status":"public","_id":"14743","language":[{"iso":"eng"}],"publication":"Proceedings of the 29th Symposium on Operating Systems Principles","acknowledgement":"The authors would like to thank Marcos K. Aguilera, Pierluca Borsò, Aleksey Charapko, Rachid Guerraoui, Jovan Komatovic, Derek Leung, Louis-Henri Merino, Shailesh Mishra, Haochen Pan, Rodrigo Rodrigues, Lewis Tseng, and Haoqian Zhang for their helpful feedback on early drafts of this paper.","oa":1,"doi":"10.1145/3600006.3613150","conference":{"name":"SOSP: Symposium on Operating Systems Principles","start_date":"2023-10-23","location":"Koblenz, Germany","end_date":"2023-10-26"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3600006.3613150"}],"type":"conference","date_published":"2023-10-01T00:00:00Z","day":"01","quality_controlled":"1","publication_identifier":{"isbn":["9798400702297"]},"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"P. Tennage, C. Basescu, E. Kokoris Kogias, E. Syta, P. Jovanovic, V. Estrada-Galinanes, B. Ford, in:, Proceedings of the 29th Symposium on Operating Systems Principles, Association for Computing Machinery, 2023, pp. 281–297.","ama":"Tennage P, Basescu C, Kokoris Kogias E, et al. QuePaxa: Escaping the tyranny of timeouts in consensus. In: <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>. Association for Computing Machinery; 2023:281-297. doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>","ieee":"P. Tennage <i>et al.</i>, “QuePaxa: Escaping the tyranny of timeouts in consensus,” in <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Koblenz, Germany, 2023, pp. 281–297.","chicago":"Tennage, Pasindu, Cristina Basescu, Eleftherios Kokoris Kogias, Ewa Syta, Philipp Jovanovic, Vero Estrada-Galinanes, and Bryan Ford. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, 281–97. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>.","apa":"Tennage, P., Basescu, C., Kokoris Kogias, E., Syta, E., Jovanovic, P., Estrada-Galinanes, V., &#38; Ford, B. (2023). QuePaxa: Escaping the tyranny of timeouts in consensus. In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i> (pp. 281–297). Koblenz, Germany: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>","ista":"Tennage P, Basescu C, Kokoris Kogias E, Syta E, Jovanovic P, Estrada-Galinanes V, Ford B. 2023. QuePaxa: Escaping the tyranny of timeouts in consensus. Proceedings of the 29th Symposium on Operating Systems Principles. SOSP: Symposium on Operating Systems Principles, 281–297.","mla":"Tennage, Pasindu, et al. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Association for Computing Machinery, 2023, pp. 281–97, doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>."},"department":[{"_id":"ElKo"}],"publisher":"Association for Computing Machinery"},{"publisher":"Presses Universitaires de Franche-Comté","citation":{"short":"A. Guilloux, T. Horesh, Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres 2023 (2023) 85–107.","ama":"Guilloux A, Horesh T. p-adic directions of primitive vectors. <i>Publications mathématiques de Besançon - Algèbre et Théorie des nombres</i>. 2023;2023:85-107. doi:<a href=\"https://doi.org/10.5802/pmb.50\">10.5802/pmb.50</a>","apa":"Guilloux, A., &#38; Horesh, T. (2023). p-adic directions of primitive vectors. <i>Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres</i>. Presses Universitaires de Franche-Comté. <a href=\"https://doi.org/10.5802/pmb.50\">https://doi.org/10.5802/pmb.50</a>","ieee":"A. Guilloux and T. Horesh, “p-adic directions of primitive vectors,” <i>Publications mathématiques de Besançon - Algèbre et Théorie des nombres</i>, vol. 2023. Presses Universitaires de Franche-Comté, pp. 85–107, 2023.","chicago":"Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.” <i>Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres</i>. Presses Universitaires de Franche-Comté, 2023. <a href=\"https://doi.org/10.5802/pmb.50\">https://doi.org/10.5802/pmb.50</a>.","ista":"Guilloux A, Horesh T. 2023. p-adic directions of primitive vectors. Publications mathématiques de Besançon - Algèbre et Théorie des nombres. 2023, 85–107.","mla":"Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.” <i>Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres</i>, vol. 2023, Presses Universitaires de Franche-Comté, 2023, pp. 85–107, doi:<a href=\"https://doi.org/10.5802/pmb.50\">10.5802/pmb.50</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TiBr"}],"publication_identifier":{"issn":["2804-8504"],"eissn":["2592-6616"]},"article_processing_charge":"Yes (in subscription journal)","arxiv":1,"day":"15","quality_controlled":"1","date_published":"2023-06-15T00:00:00Z","intvolume":"      2023","type":"journal_article","file_date_updated":"2024-10-07T11:32:32Z","oa":1,"doi":"10.5802/pmb.50","acknowledgement":"The second author is supported by EPRSC grant EP/P026710/1.","has_accepted_license":"1","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"corr_author":"1","_id":"18179","language":[{"iso":"eng"}],"publication":"Publications mathématiques de Besançon - Algèbre et Théorie des nombres","article_type":"original","status":"public","scopus_import":"1","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2023_MathBesancon_Guilloux.pdf","file_id":"18186","creator":"dernst","success":1,"date_created":"2024-10-07T11:32:32Z","date_updated":"2024-10-07T11:32:32Z","checksum":"cefc47a2cf55a87f8e4960197f73353b","file_size":1399390}],"title":"p-adic directions of primitive vectors","ddc":["510"],"publication_status":"published","date_updated":"2025-04-14T09:25:44Z","month":"06","author":[{"last_name":"Guilloux","first_name":"Antonin","full_name":"Guilloux, Antonin"},{"full_name":"Horesh, Tal","first_name":"Tal","id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","last_name":"Horesh"}],"abstract":[{"text":"Linnik type problems concern the distribution of projections of integral points on the unit sphere as their norm increases, and different generalizations of this phenomenon. Our work addresses a question of this type: we prove the uniform distribution of the projections of primitive Z2 points in the p-adic unit sphere, as their (real) norm tends to infinity. The proof is via counting lattice points in semi-simple S-arithmetic groups.","lang":"eng"},{"text":"Les problèmes de type Linnik concernent la distribution des projections des points entiers sur la sphère unitaire lorsque leur norme augmente et différentes généralisations de ce phénomène. Notre travail s’intéresse à une question de ce type : nous prouvons la distribution uniforme des projections des points primitifs de Z2 sur la sphère unitaire p-adique lorsque leur norme (réelle) tend vers l’infini. La preuve se fait en comptant les points d’un réseau dans des S-groupes arithmétiques semi-simples.","lang":"fre"}],"page":"85-107","year":"2023","project":[{"_id":"26A8D266-B435-11E9-9278-68D0E5697425","name":"Between rational and integral points","grant_number":"EP-P026710-2"}],"volume":2023,"external_id":{"arxiv":["2103.10889"]},"date_created":"2024-10-06T22:01:13Z","oa_version":"Published Version"},{"author":[{"full_name":"Muñoz Hermosilla, José M","first_name":"José M","last_name":"Muñoz Hermosilla","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e"}],"month":"06","OA_place":"repository","date_published":"2023-06-05T00:00:00Z","date_updated":"2024-12-09T09:43:47Z","day":"05","ddc":["550"],"status":"public","article_processing_charge":"No","title":"A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen","publisher":"Zenodo","_id":"18634","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"J.M. Muñoz Hermosilla, (2023).","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>","ieee":"J. M. Muñoz Hermosilla, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen.” Zenodo, 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>.","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>","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>.","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>."},"department":[{"_id":"FrPe"}],"oa_version":"Published Version","corr_author":"1","date_created":"2024-12-09T09:33:07Z","related_material":{"record":[{"status":"public","id":"18628","relation":"research_data"}]},"doi":"10.5281/ZENODO.8005257","oa":1,"year":"2023","type":"research_data_reference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8005258"}],"abstract":[{"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. ","lang":"eng"}]},{"type":"journal_article","file_date_updated":"2023-02-02T11:01:10Z","doi":"10.1007/s00454-022-00431-7","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","has_accepted_license":"1","corr_author":"1","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. 2023;69:156-191. doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete &#38; Computational Geometry 69 (2023) 156–191.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 69, Springer Nature, 2023, pp. 156–91, doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., &#38; Wintraecken, M. (2023). Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 69. Springer Nature, pp. 156–191, 2023.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete &#38; Computational Geometry. 69, 156–191."},"department":[{"_id":"HeEd"}],"article_processing_charge":"No","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"quality_controlled":"1","day":"01","intvolume":"        69","date_published":"2023-01-01T00:00:00Z","page":"156-191","ec_funded":1,"abstract":[{"lang":"eng","text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use."}],"year":"2023","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"volume":69,"isi":1,"external_id":{"isi":["000862193600001"]},"date_created":"2023-01-16T10:04:06Z","oa_version":"Published Version","language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","_id":"12287","status":"public","file":[{"file_id":"12488","creator":"dernst","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","file_size":582850,"checksum":"46352e0ee71e460848f88685ca852681","success":1,"date_created":"2023-02-02T11:01:10Z","date_updated":"2023-02-02T11:01:10Z"}],"scopus_import":"1","title":"Local criteria for triangulating general manifolds","article_type":"original","publication_status":"published","date_updated":"2025-04-14T07:44:00Z","ddc":["510"],"author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"full_name":"Dyer, Ramsay","first_name":"Ramsay","last_name":"Dyer"},{"last_name":"Ghosh","first_name":"Arijit","full_name":"Ghosh, Arijit"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"month":"01"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"This paper is part of the author’s PhD thesis at Università of Pisa. Moreover, this\r\nproject has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement\r\nNo. 101034413. I thank the referee for many helpful comments.","has_accepted_license":"1","corr_author":"1","type":"journal_article","file_date_updated":"2023-11-13T09:50:41Z","doi":"10.2140/pjm.2023.325.331","oa":1,"quality_controlled":"1","arxiv":1,"day":"03","intvolume":"       325","date_published":"2023-11-03T00:00:00Z","issue":"2","publisher":"Mathematical Sciences Publishers","department":[{"_id":"TiBr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"M. Verzobio, Pacific Journal of Mathematics 325 (2023) 331–351.","ama":"Verzobio M. Some effectivity results for primitive divisors of elliptic divisibility  sequences. <i>Pacific Journal of Mathematics</i>. 2023;325(2):331-351. doi:<a href=\"https://doi.org/10.2140/pjm.2023.325.331\">10.2140/pjm.2023.325.331</a>","ista":"Verzobio M. 2023. Some effectivity results for primitive divisors of elliptic divisibility  sequences. Pacific Journal of Mathematics. 325(2), 331–351.","chicago":"Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility  Sequences.” <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers, 2023. <a href=\"https://doi.org/10.2140/pjm.2023.325.331\">https://doi.org/10.2140/pjm.2023.325.331</a>.","apa":"Verzobio, M. (2023). Some effectivity results for primitive divisors of elliptic divisibility  sequences. <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pjm.2023.325.331\">https://doi.org/10.2140/pjm.2023.325.331</a>","ieee":"M. Verzobio, “Some effectivity results for primitive divisors of elliptic divisibility  sequences,” <i>Pacific Journal of Mathematics</i>, vol. 325, no. 2. Mathematical Sciences Publishers, pp. 331–351, 2023.","mla":"Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility  Sequences.” <i>Pacific Journal of Mathematics</i>, vol. 325, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–51, doi:<a href=\"https://doi.org/10.2140/pjm.2023.325.331\">10.2140/pjm.2023.325.331</a>."},"article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["0030-8730"]},"external_id":{"isi":["001104766900001"],"arxiv":["2001.02987"]},"date_created":"2023-01-16T11:46:19Z","oa_version":"Published Version","page":"331-351","abstract":[{"text":"Let P be a nontorsion point on an elliptic curve defined over a number field K and consider the sequence {Bn}n∈N of the denominators of x(nP). We prove that every term of the sequence of the Bn has a primitive divisor for n greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve.","lang":"eng"}],"ec_funded":1,"year":"2023","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"volume":325,"isi":1,"publication_status":"published","date_updated":"2025-04-14T07:54:54Z","ddc":["510"],"month":"11","author":[{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","last_name":"Verzobio","full_name":"Verzobio, Matteo","first_name":"Matteo","orcid":"0000-0002-0854-0306"}],"publication":"Pacific Journal of Mathematics","language":[{"iso":"eng"}],"_id":"12313","scopus_import":"1","file":[{"checksum":"b6218d16a72742d8bb38d6fc3c9bb8c6","file_size":389897,"success":1,"date_created":"2023-11-13T09:50:41Z","date_updated":"2023-11-13T09:50:41Z","file_id":"14525","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_PacificJourMaths_Verzobio.pdf"}],"status":"public","title":"Some effectivity results for primitive divisors of elliptic divisibility  sequences","article_type":"original"},{"acknowledgement":"Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira 1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through the grant Jovem Cientista do Nosso Estado E-26/202.793/2019.","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"468","corr_author":"1","type":"journal_article","file_date_updated":"2023-01-23T07:53:23Z","oa":1,"doi":"10.1038/s41598-022-19827-9","day":"10","quality_controlled":"1","date_published":"2023-01-10T00:00:00Z","intvolume":"        13","publisher":"Springer Nature","department":[{"_id":"TaHa"}],"citation":{"short":"A. Gómez, G. Oliveira, Scientific Reports 13 (2023).","ama":"Gómez A, Oliveira G. New approaches to epidemic modeling on networks. <i>Scientific Reports</i>. 2023;13. doi:<a href=\"https://doi.org/10.1038/s41598-022-19827-9\">10.1038/s41598-022-19827-9</a>","ieee":"A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,” <i>Scientific Reports</i>, vol. 13. Springer Nature, 2023.","apa":"Gómez, A., &#38; Oliveira, G. (2023). New approaches to epidemic modeling on networks. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-022-19827-9\">https://doi.org/10.1038/s41598-022-19827-9</a>","chicago":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” <i>Scientific Reports</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41598-022-19827-9\">https://doi.org/10.1038/s41598-022-19827-9</a>.","ista":"Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468.","mla":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” <i>Scientific Reports</i>, vol. 13, 468, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1038/s41598-022-19827-9\">10.1038/s41598-022-19827-9</a>."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"eissn":["2045-2322"]},"article_processing_charge":"No","date_created":"2023-01-22T23:00:55Z","external_id":{"isi":["001003345000051"]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection."}],"year":"2023","volume":13,"isi":1,"ddc":["510"],"publication_status":"published","date_updated":"2024-10-09T21:03:29Z","month":"01","author":[{"first_name":"Arturo","full_name":"Gómez, Arturo","last_name":"Gómez"},{"full_name":"Oliveira, Goncalo","first_name":"Goncalo","id":"58abbde8-f455-11eb-a497-98c8fd71b905","last_name":"Oliveira"}],"_id":"12329","publication":"Scientific Reports","language":[{"iso":"eng"}],"article_type":"original","status":"public","file":[{"file_size":2167792,"checksum":"a8b83739f4a951e83e0b2a778f03b327","date_updated":"2023-01-23T07:53:23Z","success":1,"date_created":"2023-01-23T07:53:23Z","file_id":"12336","creator":"dernst","file_name":"2023_ScientificReports_Gomez.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"scopus_import":"1","title":"New approaches to epidemic modeling on networks"},{"title":"The splay-list: A distribution-adaptive concurrent skip-list","scopus_import":"1","status":"public","article_type":"original","publication":"Distributed Computing","language":[{"iso":"eng"}],"_id":"12330","author":[{"last_name":"Aksenov","id":"2980135A-F248-11E8-B48F-1D18A9856A87","full_name":"Aksenov, Vitalii","first_name":"Vitalii"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Drozdova, Alexandra","first_name":"Alexandra","last_name":"Drozdova"},{"first_name":"Amirkeivan","full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami"}],"month":"09","date_updated":"2023-08-14T12:54:32Z","publication_status":"published","volume":36,"isi":1,"year":"2023","page":"395-418","abstract":[{"lang":"eng","text":"The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads."}],"oa_version":"Preprint","date_created":"2023-01-22T23:00:55Z","external_id":{"arxiv":["2008.01009"],"isi":["000913424000001"]},"article_processing_charge":"No","publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"citation":{"mla":"Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>Distributed Computing</i>, vol. 36, Springer Nature, 2023, pp. 395–418, doi:<a href=\"https://doi.org/10.1007/s00446-022-00441-x\">10.1007/s00446-022-00441-x</a>.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” <i>Distributed Computing</i>, vol. 36. Springer Nature, pp. 395–418, 2023.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., &#38; Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-022-00441-x\">https://doi.org/10.1007/s00446-022-00441-x</a>","chicago":"Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>Distributed Computing</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00446-022-00441-x\">https://doi.org/10.1007/s00446-022-00441-x</a>.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. <i>Distributed Computing</i>. 2023;36:395-418. doi:<a href=\"https://doi.org/10.1007/s00446-022-00441-x\">10.1007/s00446-022-00441-x</a>","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418."},"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","intvolume":"        36","date_published":"2023-09-01T00:00:00Z","quality_controlled":"1","day":"01","arxiv":1,"doi":"10.1007/s00446-022-00441-x","oa":1,"type":"journal_article","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2008.01009","open_access":"1"}]},{"has_accepted_license":"1","acknowledgement":"The National Key Research and Development Program of China (2018YFA0702100), the Basic Science Center Project of the National Natural Science Foundation of China (51788104), the National Natural Science Foundation of China (51571007 and 51772012), the Beijing Natural Science Foundation (JQ18004), the 111 Project (B17002), the National Science Fund for Distinguished Young Scholars (51925101), and the FWF “Lise Meitner Fellowship” (grant agreement M2889-N). Open Access is funded by the Austrian Science Fund (FWF).","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","file_date_updated":"2023-08-14T12:57:25Z","pmid":1,"type":"journal_article","oa":1,"doi":"10.1021/acs.chemmater.2c03542","day":"24","quality_controlled":"1","date_published":"2023-01-24T00:00:00Z","intvolume":"        35","citation":{"short":"S. Wang, C. Chang, S. Bai, B. Qin, Y. Zhu, S. Zhan, J. Zheng, S. Tang, L.D. Zhao, Chemistry of Materials 35 (2023) 755–763.","ama":"Wang S, Chang C, Bai S, et al. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. <i>Chemistry of Materials</i>. 2023;35(2):755-763. doi:<a href=\"https://doi.org/10.1021/acs.chemmater.2c03542\">10.1021/acs.chemmater.2c03542</a>","chicago":"Wang, Siqi, Cheng Chang, Shulin Bai, Bingchao Qin, Yingcai Zhu, Shaoping Zhan, Junqing Zheng, Shuwei Tang, and Li Dong Zhao. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” <i>Chemistry of Materials</i>. American Chemical Society, 2023. <a href=\"https://doi.org/10.1021/acs.chemmater.2c03542\">https://doi.org/10.1021/acs.chemmater.2c03542</a>.","apa":"Wang, S., Chang, C., Bai, S., Qin, B., Zhu, Y., Zhan, S., … Zhao, L. D. (2023). Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. <i>Chemistry of Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.chemmater.2c03542\">https://doi.org/10.1021/acs.chemmater.2c03542</a>","ieee":"S. Wang <i>et al.</i>, “Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe,” <i>Chemistry of Materials</i>, vol. 35, no. 2. American Chemical Society, pp. 755–763, 2023.","ista":"Wang S, Chang C, Bai S, Qin B, Zhu Y, Zhan S, Zheng J, Tang S, Zhao LD. 2023. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 35(2), 755–763.","mla":"Wang, Siqi, et al. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” <i>Chemistry of Materials</i>, vol. 35, no. 2, American Chemical Society, 2023, pp. 755–63, doi:<a href=\"https://doi.org/10.1021/acs.chemmater.2c03542\">10.1021/acs.chemmater.2c03542</a>."},"department":[{"_id":"MaIb"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Chemical Society","issue":"2","publication_identifier":{"issn":["0897-4756"],"eissn":["1520-5002"]},"article_processing_charge":"No","external_id":{"pmid":["36711054"],"isi":["000914749700001"]},"date_created":"2023-01-22T23:00:55Z","oa_version":"Published Version","abstract":[{"text":"High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance.","lang":"eng"}],"page":"755-763","project":[{"grant_number":"M02889","name":"Bottom-up Engineering for Thermoelectric Applications","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A"}],"isi":1,"volume":35,"year":"2023","ddc":["540"],"date_updated":"2025-04-23T08:47:37Z","publication_status":"published","month":"01","author":[{"first_name":"Siqi","full_name":"Wang, Siqi","last_name":"Wang"},{"first_name":"Cheng","orcid":"0000-0002-9515-4277","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","last_name":"Chang"},{"full_name":"Bai, Shulin","first_name":"Shulin","last_name":"Bai"},{"full_name":"Qin, Bingchao","first_name":"Bingchao","last_name":"Qin"},{"last_name":"Zhu","full_name":"Zhu, Yingcai","first_name":"Yingcai"},{"first_name":"Shaoping","full_name":"Zhan, Shaoping","last_name":"Zhan"},{"last_name":"Zheng","first_name":"Junqing","full_name":"Zheng, Junqing"},{"last_name":"Tang","first_name":"Shuwei","full_name":"Tang, Shuwei"},{"first_name":"Li Dong","full_name":"Zhao, Li Dong","last_name":"Zhao"}],"_id":"12331","publication":"Chemistry of Materials","language":[{"iso":"eng"}],"article_type":"original","title":"Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe","status":"public","scopus_import":"1","file":[{"file_id":"14055","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_ChemistryMaterials_Wang.pdf","file_size":2961043,"checksum":"b21dca2aa7a80c068bc256bdd1fea9df","success":1,"date_created":"2023-08-14T12:57:25Z","date_updated":"2023-08-14T12:57:25Z"}]},{"date_published":"2023-01-27T00:00:00Z","day":"27","article_processing_charge":"No","publication_identifier":{"eissn":["2664-1690"]},"publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"}],"citation":{"short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria; 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","mla":"Chalupa, Marek, et al. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["runtime monitoring","best effort","third party"],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","has_accepted_license":"1","doi":"10.15479/AT:ISTA:12407","oa":1,"type":"technical_report","file_date_updated":"2023-01-27T03:18:34Z","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek"},{"last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","first_name":"Fabian"},{"first_name":"Stefanie","full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"month":"01","publication_status":"published","date_updated":"2025-09-09T12:25:29Z","ddc":["005"],"status":"public","file":[{"date_created":"2023-01-27T03:18:34Z","success":1,"date_updated":"2023-01-27T03:18:34Z","file_size":662409,"checksum":"55426e463fdeafe9777fc3ff635154c7","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"main.pdf","file_id":"12408","creator":"fmuehlbo"}],"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","language":[{"iso":"eng"}],"_id":"12407","oa_version":"Published Version","related_material":{"record":[{"id":"12856","relation":"later_version","status":"public"}]},"date_created":"2023-01-27T03:18:08Z","year":"2023","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"page":"38","abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch."}],"ec_funded":1},{"oa":1,"doi":"10.1042/bst20220221","file_date_updated":"2023-03-16T07:58:16Z","type":"journal_article","pmid":1,"corr_author":"1","has_accepted_license":"1","acknowledgement":"We apologize for not being able to mention and cite additional excellent work that would have fit the scope of this review, due to space restraints. We thank Jesse Hansen for comments on the manuscript. We acknowledge support from the Austrian Science Fund (FWF): P33367 and the Institute of Science and Technology Austria.","keyword":["Biochemistry"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["0300-5127"],"eissn":["1470-8752"]},"article_processing_charge":"No","department":[{"_id":"FlSc"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fäßler, Florian, et al. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” <i>Biochemical Society Transactions</i>, vol. 51, no. 1, Portland Press, 2023, pp. 87–99, doi:<a href=\"https://doi.org/10.1042/bst20220221\">10.1042/bst20220221</a>.","ieee":"F. Fäßler, M. Javoor, and F. K. Schur, “Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM,” <i>Biochemical Society Transactions</i>, vol. 51, no. 1. Portland Press, pp. 87–99, 2023.","apa":"Fäßler, F., Javoor, M., &#38; Schur, F. K. (2023). Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. <i>Biochemical Society Transactions</i>. Portland Press. <a href=\"https://doi.org/10.1042/bst20220221\">https://doi.org/10.1042/bst20220221</a>","chicago":"Fäßler, Florian, Manjunath Javoor, and Florian KM Schur. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” <i>Biochemical Society Transactions</i>. Portland Press, 2023. <a href=\"https://doi.org/10.1042/bst20220221\">https://doi.org/10.1042/bst20220221</a>.","ista":"Fäßler F, Javoor M, Schur FK. 2023. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. 51(1), 87–99.","ama":"Fäßler F, Javoor M, Schur FK. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. <i>Biochemical Society Transactions</i>. 2023;51(1):87-99. doi:<a href=\"https://doi.org/10.1042/bst20220221\">10.1042/bst20220221</a>","short":"F. Fäßler, M. Javoor, F.K. Schur, Biochemical Society Transactions 51 (2023) 87–99."},"issue":"1","publisher":"Portland Press","date_published":"2023-02-01T00:00:00Z","intvolume":"        51","day":"01","quality_controlled":"1","project":[{"grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","name":"Structure and isoform diversity of the Arp2/3 complex"}],"isi":1,"volume":51,"year":"2023","abstract":[{"lang":"eng","text":"The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions."}],"page":"87-99","oa_version":"Published Version","date_created":"2023-01-27T10:08:19Z","external_id":{"pmid":["36695514"],"isi":["000926043100001"]},"article_type":"original","title":"Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM","file":[{"file_size":10045006,"checksum":"4e7069845e3dad22bb44fb71ec624c60","date_created":"2023-03-16T07:58:16Z","success":1,"date_updated":"2023-03-16T07:58:16Z","file_id":"12728","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_BioChemicalSocietyTransactions_Faessler.pdf"}],"status":"public","scopus_import":"1","_id":"12421","language":[{"iso":"eng"}],"publication":"Biochemical Society Transactions","author":[{"last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","full_name":"Fäßler, Florian","orcid":"0000-0001-7149-769X","first_name":"Florian"},{"id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","last_name":"Javoor","full_name":"Javoor, Manjunath","first_name":"Manjunath"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM"}],"month":"02","ddc":["570"],"date_updated":"2025-04-23T08:47:15Z","publication_status":"published"},{"publication_status":"published","date_updated":"2024-10-09T21:04:07Z","author":[{"id":"3ACCD756-F248-11E8-B48F-1D18A9856A87","last_name":"Balestrieri","full_name":"Balestrieri, Francesca","first_name":"Francesca"}],"month":"01","_id":"12427","publication":"Proceedings of the American Mathematical Society","language":[{"iso":"eng"}],"article_type":"original","scopus_import":"1","status":"public","title":"Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups","date_created":"2023-01-29T23:00:58Z","external_id":{"isi":["000898440000001"]},"oa_version":"Preprint","abstract":[{"text":"Let k be a number field and X a smooth, geometrically integral quasi-projective variety over k. For any linear algebraic group G over k and any G-torsor g : Z → X, we observe that if the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for all twists of Z by elements in H^1(k, G), then the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for X. As an application, we show that any homogeneous space of the form G/H with G a connected linear algebraic group over k satisfies strong approximation off the infinite places with étale-Brauer obstruction, under some compactness assumptions when k is totally real. We also prove more refined strong approximation results for homogeneous spaces of the form G/H with G semisimple simply connected and H finite, using the theory of torsors and descent.","lang":"eng"}],"page":"907-914","year":"2023","isi":1,"volume":151,"day":"01","quality_controlled":"1","date_published":"2023-01-01T00:00:00Z","intvolume":"       151","publisher":"American Mathematical Society","issue":"3","department":[{"_id":"TiBr"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"short":"F. Balestrieri, Proceedings of the American Mathematical Society 151 (2023) 907–914.","ama":"Balestrieri F. Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. <i>Proceedings of the American Mathematical Society</i>. 2023;151(3):907-914. doi:<a href=\"https://doi.org/10.1090/proc/15239\">10.1090/proc/15239</a>","ista":"Balestrieri F. 2023. Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. Proceedings of the American Mathematical Society. 151(3), 907–914.","apa":"Balestrieri, F. (2023). Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/15239\">https://doi.org/10.1090/proc/15239</a>","ieee":"F. Balestrieri, “Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups,” <i>Proceedings of the American Mathematical Society</i>, vol. 151, no. 3. American Mathematical Society, pp. 907–914, 2023.","chicago":"Balestrieri, Francesca. “Some Remarks on Strong Approximation and Applications to Homogeneous Spaces of Linear Algebraic Groups.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2023. <a href=\"https://doi.org/10.1090/proc/15239\">https://doi.org/10.1090/proc/15239</a>.","mla":"Balestrieri, Francesca. “Some Remarks on Strong Approximation and Applications to Homogeneous Spaces of Linear Algebraic Groups.” <i>Proceedings of the American Mathematical Society</i>, vol. 151, no. 3, American Mathematical Society, 2023, pp. 907–14, doi:<a href=\"https://doi.org/10.1090/proc/15239\">10.1090/proc/15239</a>."},"publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"article_processing_charge":"No","corr_author":"1","main_file_link":[{"url":"https://hal.science/hal-03013498/","open_access":"1"}],"type":"journal_article","oa":1,"doi":"10.1090/proc/15239"},{"month":"01","author":[{"first_name":"Edouard B","orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo"},{"last_name":"Scheele","full_name":"Scheele, Colinda L.G.J.","first_name":"Colinda L.G.J."}],"date_updated":"2024-10-09T21:04:04Z","series_title":"MIMB","editor":[{"first_name":"Coert","full_name":"Margadant, Coert","last_name":"Margadant"}],"publication_status":"published","ddc":["570"],"title":"A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland","file":[{"file_id":"12500","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_MIMB_Hannezo.pdf","checksum":"aec1b8d3ba938ddf9d8fcb777f3c38ee","file_size":826598,"date_created":"2023-02-03T10:56:39Z","success":1,"date_updated":"2023-02-03T10:56:39Z"}],"scopus_import":"1","status":"public","language":[{"iso":"eng"}],"publication":"Cell Migration in Three Dimensions","_id":"12428","oa_version":"Published Version","date_created":"2023-01-29T23:00:58Z","external_id":{"pmid":["36653709"]},"volume":2608,"year":"2023","page":"183-205","abstract":[{"text":"The mammary gland consists of a bilayered epithelial structure with an extensively branched morphology. The majority of this epithelial tree is laid down during puberty, during which actively proliferating terminal end buds repeatedly elongate and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist of a basal and luminal cell layer with a multitude of identified sub-lineages within both layers. The understanding of how these different cell lineages are cooperatively driving branching morphogenesis is a problem of crossing multiple scales, as this requires information on the macroscopic branched structure of the gland, as well as data on single-cell dynamics driving the morphogenic program. Here we describe a method to combine genetic lineage tracing with whole-gland branching analysis. Quantitative data on the global organ structure can be used to derive a model for mammary gland branching morphogenesis and provide a backbone on which the dynamics of individual cell lineages can be simulated and compared to lineage-tracing approaches. Eventually, these quantitative models and experiments allow to understand the couplings between the macroscopic shape of the mammary gland and the underlying single-cell dynamics driving branching morphogenesis.","lang":"eng"}],"intvolume":"      2608","date_published":"2023-01-19T00:00:00Z","quality_controlled":"1","day":"19","article_processing_charge":"No","publication_identifier":{"isbn":["9781071628867"],"eissn":["1940-6029"],"eisbn":["9781071628874"]},"department":[{"_id":"EdHa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Hannezo EB, Scheele CLGJ. A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In: Margadant C, ed. <i>Cell Migration in Three Dimensions</i>. Vol 2608. MIMB. Springer Nature; 2023:183-205. doi:<a href=\"https://doi.org/10.1007/978-1-0716-2887-4_12\">10.1007/978-1-0716-2887-4_12</a>","short":"E.B. Hannezo, C.L.G.J. Scheele, in:, C. Margadant (Ed.), Cell Migration in Three Dimensions, Springer Nature, 2023, pp. 183–205.","mla":"Hannezo, Edouard B., and Colinda L. G. J. Scheele. “A Guide Toward Multi-Scale and Quantitative Branching Analysis in the Mammary Gland.” <i>Cell Migration in Three Dimensions</i>, edited by Coert Margadant, vol. 2608, Springer Nature, 2023, pp. 183–205, doi:<a href=\"https://doi.org/10.1007/978-1-0716-2887-4_12\">10.1007/978-1-0716-2887-4_12</a>.","ista":"Hannezo EB, Scheele CLGJ. 2023.A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In: Cell Migration in Three Dimensions. Methods in Molecular Biology, vol. 2608, 183–205.","chicago":"Hannezo, Edouard B, and Colinda L.G.J. Scheele. “A Guide Toward Multi-Scale and Quantitative Branching Analysis in the Mammary Gland.” In <i>Cell Migration in Three Dimensions</i>, edited by Coert Margadant, 2608:183–205. MIMB. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-1-0716-2887-4_12\">https://doi.org/10.1007/978-1-0716-2887-4_12</a>.","ieee":"E. B. Hannezo and C. L. G. J. Scheele, “A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland,” in <i>Cell Migration in Three Dimensions</i>, vol. 2608, C. Margadant, Ed. Springer Nature, 2023, pp. 183–205.","apa":"Hannezo, E. B., &#38; Scheele, C. L. G. J. (2023). A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In C. Margadant (Ed.), <i>Cell Migration in Three Dimensions</i> (Vol. 2608, pp. 183–205). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-0716-2887-4_12\">https://doi.org/10.1007/978-1-0716-2887-4_12</a>"},"alternative_title":["Methods in Molecular Biology"],"publisher":"Springer Nature","corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","doi":"10.1007/978-1-0716-2887-4_12","oa":1,"file_date_updated":"2023-02-03T10:56:39Z","type":"book_chapter","pmid":1},{"article_processing_charge":"No","publication_identifier":{"eissn":["1522-2616"],"issn":["0025-584X"]},"citation":{"short":"A. Agresti, N. Lindemulder, M. Veraar, Mathematische Nachrichten 296 (2023) 1319–1350.","ama":"Agresti A, Lindemulder N, Veraar M. On the trace embedding and its applications to evolution equations. <i>Mathematische Nachrichten</i>. 2023;296(4):1319-1350. doi:<a href=\"https://doi.org/10.1002/mana.202100192\">10.1002/mana.202100192</a>","chicago":"Agresti, Antonio, Nick Lindemulder, and Mark Veraar. “On the Trace Embedding and Its Applications to Evolution Equations.” <i>Mathematische Nachrichten</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/mana.202100192\">https://doi.org/10.1002/mana.202100192</a>.","apa":"Agresti, A., Lindemulder, N., &#38; Veraar, M. (2023). On the trace embedding and its applications to evolution equations. <i>Mathematische Nachrichten</i>. Wiley. <a href=\"https://doi.org/10.1002/mana.202100192\">https://doi.org/10.1002/mana.202100192</a>","ieee":"A. Agresti, N. Lindemulder, and M. Veraar, “On the trace embedding and its applications to evolution equations,” <i>Mathematische Nachrichten</i>, vol. 296, no. 4. Wiley, pp. 1319–1350, 2023.","ista":"Agresti A, Lindemulder N, Veraar M. 2023. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 296(4), 1319–1350.","mla":"Agresti, Antonio, et al. “On the Trace Embedding and Its Applications to Evolution Equations.” <i>Mathematische Nachrichten</i>, vol. 296, no. 4, Wiley, 2023, pp. 1319–50, doi:<a href=\"https://doi.org/10.1002/mana.202100192\">10.1002/mana.202100192</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JuFi"}],"issue":"4","publisher":"Wiley","intvolume":"       296","date_published":"2023-04-01T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"01","doi":"10.1002/mana.202100192","oa":1,"file_date_updated":"2023-08-16T11:40:02Z","type":"journal_article","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"has_accepted_license":"1","acknowledgement":"The first author has been partially supported by the Nachwuchsring—Network for the promotion of young scientists—at TU Kaiserslautern. The second and third authors were supported by the Vidi subsidy 639.032.427 of the Netherlands Organisation for Scientific Research (NWO).","title":"On the trace embedding and its applications to evolution equations","file":[{"date_created":"2023-08-16T11:40:02Z","success":1,"date_updated":"2023-08-16T11:40:02Z","file_size":449280,"checksum":"6f099f1d064173784d1a27716a2cc795","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2023_MathNachrichten_Agresti.pdf","creator":"dernst","file_id":"14067"}],"status":"public","scopus_import":"1","article_type":"original","publication":"Mathematische Nachrichten","language":[{"iso":"eng"}],"_id":"12429","author":[{"last_name":"Agresti","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","orcid":"0000-0002-9573-2962","first_name":"Antonio","full_name":"Agresti, Antonio"},{"last_name":"Lindemulder","first_name":"Nick","full_name":"Lindemulder, Nick"},{"first_name":"Mark","full_name":"Veraar, Mark","last_name":"Veraar"}],"month":"04","date_updated":"2023-08-16T11:41:42Z","publication_status":"published","ddc":["510"],"isi":1,"volume":296,"year":"2023","page":"1319-1350","abstract":[{"text":"In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown.","lang":"eng"}],"oa_version":"Published Version","external_id":{"isi":["000914134900001"],"arxiv":["2104.05063"]},"date_created":"2023-01-29T23:00:59Z"},{"article_type":"original","title":"Bogoliubov dynamics and higher-order corrections for the regularized Nelson model","scopus_import":"1","status":"public","_id":"12430","language":[{"iso":"eng"}],"publication":"Reviews in Mathematical Physics","month":"01","author":[{"last_name":"Falconi","first_name":"Marco","full_name":"Falconi, Marco"},{"first_name":"Nikolai K","orcid":"0000-0002-0495-6822","full_name":"Leopold, Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold"},{"first_name":"David Johannes","full_name":"Mitrouskas, David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas"},{"id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrat","first_name":"Sören P","orcid":"0000-0002-9166-5889","full_name":"Petrat, Sören P"}],"date_updated":"2023-08-16T11:47:27Z","publication_status":"published","volume":35,"isi":1,"year":"2023","abstract":[{"lang":"eng","text":"We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively."}],"oa_version":"Preprint","external_id":{"isi":["000909760300001"],"arxiv":["2110.00458"]},"date_created":"2023-01-29T23:00:59Z","publication_identifier":{"issn":["0129-055X"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"citation":{"chicago":"Falconi, Marco, Nikolai K Leopold, David Johannes Mitrouskas, and Sören P Petrat. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2023. <a href=\"https://doi.org/10.1142/S0129055X2350006X\">https://doi.org/10.1142/S0129055X2350006X</a>.","ieee":"M. Falconi, N. K. Leopold, D. J. Mitrouskas, and S. P. Petrat, “Bogoliubov dynamics and higher-order corrections for the regularized Nelson model,” <i>Reviews in Mathematical Physics</i>, vol. 35, no. 4. World Scientific Publishing, 2023.","apa":"Falconi, M., Leopold, N. K., Mitrouskas, D. J., &#38; Petrat, S. P. (2023). Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129055X2350006X\">https://doi.org/10.1142/S0129055X2350006X</a>","ista":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. 2023. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 35(4), 2350006.","mla":"Falconi, Marco, et al. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” <i>Reviews in Mathematical Physics</i>, vol. 35, no. 4, 2350006, World Scientific Publishing, 2023, doi:<a href=\"https://doi.org/10.1142/S0129055X2350006X\">10.1142/S0129055X2350006X</a>.","short":"M. Falconi, N.K. Leopold, D.J. Mitrouskas, S.P. Petrat, Reviews in Mathematical Physics 35 (2023).","ama":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. <i>Reviews in Mathematical Physics</i>. 2023;35(4). doi:<a href=\"https://doi.org/10.1142/S0129055X2350006X\">10.1142/S0129055X2350006X</a>"},"issue":"4","publisher":"World Scientific Publishing","date_published":"2023-01-09T00:00:00Z","intvolume":"        35","arxiv":1,"day":"09","quality_controlled":"1","oa":1,"doi":"10.1142/S0129055X2350006X","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2110.00458"}],"type":"journal_article","article_number":"2350006"},{"date_created":"2023-01-31T07:23:56Z","external_id":{"arxiv":["2301.11175"],"isi":["001288609300017"]},"oa_version":"Published Version","ec_funded":1,"abstract":[{"text":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states.","lang":"eng"}],"page":"349-370","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"isi":1,"volume":13992,"year":"2023","ddc":["000"],"date_updated":"2025-09-09T12:21:08Z","publication_status":"published","month":"04","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E"}],"_id":"12467","publication":"26th International Conference Foundations of Software Science and Computation Structures","language":[{"iso":"eng"}],"title":"Quantitative safety and liveness","scopus_import":"1","status":"public","file":[{"creator":"esarac","file_id":"12468","file_name":"qsl.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":449027,"checksum":"981025aed580b6b27c426cb8856cf63e","date_updated":"2023-01-31T07:22:21Z","success":1,"date_created":"2023-01-31T07:22:21Z"},{"file_id":"13153","creator":"dernst","file_name":"2023_LNCS_HenzingerT.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":1048171,"checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","date_updated":"2023-06-19T10:28:09Z","success":1,"date_created":"2023-06-19T10:28:09Z"}],"has_accepted_license":"1","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","conference":{"start_date":"2023-04-22","name":"FOSSACS: Foundations of Software Science and Computation Structures","end_date":"2023-04-27","location":"Paris, France"},"file_date_updated":"2023-06-19T10:28:09Z","type":"conference","oa":1,"doi":"10.1007/978-3-031-30829-1_17","day":"21","arxiv":1,"quality_controlled":"1","date_published":"2023-04-21T00:00:00Z","intvolume":"     13992","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"citation":{"ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in <i>26th International Conference Foundations of Software Science and Computation Structures</i>, Paris, France, 2023, vol. 13992, pp. 349–370.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In <i>26th International Conference Foundations of Software Science and Computation Structures</i>, 13992:349–70. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>.","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Quantitative safety and liveness. In <i>26th International Conference Foundations of Software Science and Computation Structures</i> (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>","mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” <i>26th International Conference Foundations of Software Science and Computation Structures</i>, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: <i>26th International Conference Foundations of Software Science and Computation Structures</i>. Vol 13992. Springer Nature; 2023:349-370. doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>"},"alternative_title":["LNCS"],"publisher":"Springer Nature","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308284"],"eissn":["1611-3349"]},"article_processing_charge":"No"}]