[{"volume":109,"status":"public","citation":{"mla":"Ojavee, Sven E., et al. “Liability-Scale Heritability Estimation for Biobank Studies of Low-Prevalence Disease.” The American Journal of Human Genetics, vol. 109, no. 11, Elsevier, 2022, pp. 2009–17, doi:10.1016/j.ajhg.2022.09.011.","ama":"Ojavee SE, Kutalik Z, Robinson MR. Liability-scale heritability estimation for biobank studies of low-prevalence disease. The American Journal of Human Genetics. 2022;109(11):2009-2017. doi:10.1016/j.ajhg.2022.09.011","ista":"Ojavee SE, Kutalik Z, Robinson MR. 2022. Liability-scale heritability estimation for biobank studies of low-prevalence disease. The American Journal of Human Genetics. 109(11), 2009–2017.","short":"S.E. Ojavee, Z. Kutalik, M.R. Robinson, The American Journal of Human Genetics 109 (2022) 2009–2017.","chicago":"Ojavee, Sven E., Zoltan Kutalik, and Matthew Richard Robinson. “Liability-Scale Heritability Estimation for Biobank Studies of Low-Prevalence Disease.” The American Journal of Human Genetics. Elsevier, 2022. https://doi.org/10.1016/j.ajhg.2022.09.011.","apa":"Ojavee, S. E., Kutalik, Z., & Robinson, M. R. (2022). Liability-scale heritability estimation for biobank studies of low-prevalence disease. The American Journal of Human Genetics. Elsevier. https://doi.org/10.1016/j.ajhg.2022.09.011","ieee":"S. E. Ojavee, Z. Kutalik, and M. R. Robinson, “Liability-scale heritability estimation for biobank studies of low-prevalence disease,” The American Journal of Human Genetics, vol. 109, no. 11. Elsevier, pp. 2009–2017, 2022."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":"1","date_created":"2023-01-12T12:05:28Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"title":"Liability-scale heritability estimation for biobank studies of low-prevalence disease","publication":"The American Journal of Human Genetics","corr_author":"1","language":[{"iso":"eng"}],"file":[{"file_name":"2022_AJHG_Ojavee.pdf","checksum":"4cd7f12bfe21a8237bb095eedfa26361","relation":"main_file","file_size":705195,"content_type":"application/pdf","date_created":"2023-01-24T09:23:01Z","date_updated":"2023-01-24T09:23:01Z","success":1,"file_id":"12353","access_level":"open_access","creator":"dernst"}],"pmid":1,"issue":"11","type":"journal_article","year":"2022","date_published":"2022-11-03T00:00:00Z","page":"2009-2017","intvolume":" 109","department":[{"_id":"MaRo"}],"publication_identifier":{"issn":["0002-9297"]},"isi":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"Theory for liability-scale models of the underlying genetic basis of complex disease provides an important way to interpret, compare, and understand results generated from biological studies. In particular, through estimation of the liability-scale heritability (LSH), liability models facilitate an understanding and comparison of the relative importance of genetic and environmental risk factors that shape different clinically important disease outcomes. Increasingly, large-scale biobank studies that link genetic information to electronic health records, containing hundreds of disease diagnosis indicators that mostly occur infrequently within the sample, are becoming available. Here, we propose an extension of the existing liability-scale model theory suitable for estimating LSH in biobank studies of low-prevalence disease. In a simulation study, we find that our derived expression yields lower mean square error (MSE) and is less sensitive to prevalence misspecification as compared to previous transformations for diseases with =< 2% population prevalence and LSH of =< 0.45, especially if the biobank sample prevalence is less than that of the wider population. Applying our expression to 13 diagnostic outcomes of =< 3% prevalence in the UK Biobank study revealed important differences in LSH obtained from the different theoretical expressions that impact the conclusions made when comparing LSH across disease outcomes. This demonstrates the importance of careful consideration for estimation and prediction of low-prevalence disease outcomes and facilitates improved inference of the underlying genetic basis of =< 2% population prevalence diseases, especially where biobank sample ascertainment results in a healthier sample population.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","doi":"10.1016/j.ajhg.2022.09.011","day":"03","project":[{"_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk","grant_number":"PCEGP3_181181"}],"author":[{"first_name":"Sven E.","full_name":"Ojavee, Sven E.","last_name":"Ojavee"},{"first_name":"Zoltan","full_name":"Kutalik, Zoltan","last_name":"Kutalik"},{"first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"}],"_id":"12142","publication_status":"published","publisher":"Elsevier","external_id":{"isi":["000898683500006"],"pmid":["36265482"]},"ddc":["570"],"acknowledgement":"This project was funded by an SNSF Eccellenza grant to M.R.R. (PCEGP3-181181), core funding from the Institute of Science and Technology Austria, and core funding from the Department of Computational Biology of the University of Lausanne. Z.K. was funded by the Swiss National Science Foundation (310030-189147). This research was supported by the Scientific Service Units (SSUs) of IST Austria through resources provided by Scientific Computing (SciComp). We would like to thank the participants of the UK Biobank.","month":"11","date_updated":"2025-06-11T13:55:19Z","has_accepted_license":"1","keyword":["Genetics (clinical)","Genetics"],"file_date_updated":"2023-01-24T09:23:01Z","oa_version":"Published Version","oa":1,"article_type":"original"},{"date_published":"2022-11-23T00:00:00Z","arxiv":1,"page":"1-26","intvolume":" 168","isi":1,"publication_identifier":{"eissn":["1588-2632"],"issn":["0236-5294"]},"department":[{"_id":"MaKw"}],"status":"public","volume":168,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Cooley, Oliver, M. Kang, and O. Pikhurko. “On a Question of Vera T. Sós about Size Forcing of Graphons.” Acta Mathematica Hungarica. Springer Nature, 2022. https://doi.org/10.1007/s10474-022-01265-8.","apa":"Cooley, O., Kang, M., & Pikhurko, O. (2022). On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. Springer Nature. https://doi.org/10.1007/s10474-022-01265-8","ieee":"O. Cooley, M. Kang, and O. Pikhurko, “On a question of Vera T. Sós about size forcing of graphons,” Acta Mathematica Hungarica, vol. 168. Springer Nature, pp. 1–26, 2022.","mla":"Cooley, Oliver, et al. “On a Question of Vera T. Sós about Size Forcing of Graphons.” Acta Mathematica Hungarica, vol. 168, Springer Nature, 2022, pp. 1–26, doi:10.1007/s10474-022-01265-8.","ama":"Cooley O, Kang M, Pikhurko O. On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. 2022;168:1-26. doi:10.1007/s10474-022-01265-8","ista":"Cooley O, Kang M, Pikhurko O. 2022. On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. 168, 1–26.","short":"O. Cooley, M. Kang, O. Pikhurko, Acta Mathematica Hungarica 168 (2022) 1–26."},"scopus_import":"1","quality_controlled":"1","date_created":"2023-01-12T12:07:59Z","publication":"Acta Mathematica Hungarica","corr_author":"1","title":"On a question of Vera T. Sós about size forcing of graphons","language":[{"iso":"eng"}],"type":"journal_article","year":"2022","acknowledgement":"Supported by Austrian Science Fund (FWF) Grant I3747. Supported by ERC Advanced Grant 101020255 and Leverhulme Research Project Grant RPG-2018-424.\r\nAn extended abstract of this paper appeared in the Proceedings of the European Conference\r\non Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2103.09114","open_access":"1"}],"month":"11","date_updated":"2024-10-09T21:03:37Z","oa_version":"Preprint","keyword":["graphon","k-sample","graphon forcing","graph container"],"article_type":"original","oa":1,"doi":"10.1007/s10474-022-01265-8","abstract":[{"lang":"eng","text":"The k-sample G(k,W) from a graphon W:[0,1]2→[0,1] is the random graph on {1,…,k}, where we sample x1,…,xk∈[0,1] uniformly at random and make each pair {i,j}⊆{1,…,k} an edge with probability W(xi,xj), with all these choices being mutually independent. Let the random variable Xk(W) be the number of edges in G(k,W). Vera T. Sós asked in 2012 whether two graphons U, W are necessarily weakly isomorphic if the random variables Xk(U) and Xk(W) have the same distribution for every integer k≥2. This question when one of the graphons W is a constant function was answered positively by Endre Csóka and independently by Jacob Fox, Tomasz Łuczak and Vera T. Sós. Here we investigate the question when W is a 2-step graphon and prove that the answer is positive for a 3-dimensional family of such graphons. We also present some related results."}],"article_processing_charge":"No","day":"23","author":[{"full_name":"Cooley, Oliver","first_name":"Oliver","last_name":"Cooley","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d"},{"first_name":"M.","full_name":"Kang, M.","last_name":"Kang"},{"last_name":"Pikhurko","full_name":"Pikhurko, O.","first_name":"O."}],"_id":"12151","external_id":{"isi":["000886839900006"],"arxiv":["2103.09114"]},"publication_status":"published","publisher":"Springer Nature"},{"publication":"Financial Cryptography and Data Security","title":"Hide & Seek: Privacy-preserving rebalancing on payment channel networks","language":[{"iso":"eng"}],"year":"2022","type":"conference","status":"public","volume":13411,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Avarikioti, G., Pietrzak, K. Z., Salem, I., Schmid, S., Tiwari, S., & Yeo, M. X. (2022). Hide & Seek: Privacy-preserving rebalancing on payment channel networks. In Financial Cryptography and Data Security (Vol. 13411, pp. 358–373). Grenada: Springer Nature. https://doi.org/10.1007/978-3-031-18283-9_17","ieee":"G. Avarikioti, K. Z. Pietrzak, I. Salem, S. Schmid, S. Tiwari, and M. X. Yeo, “Hide & Seek: Privacy-preserving rebalancing on payment channel networks,” in Financial Cryptography and Data Security, Grenada, 2022, vol. 13411, pp. 358–373.","chicago":"Avarikioti, Georgia, Krzysztof Z Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, and Michelle X Yeo. “Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.” In Financial Cryptography and Data Security, 13411:358–73. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-18283-9_17.","short":"G. Avarikioti, K.Z. Pietrzak, I. Salem, S. Schmid, S. Tiwari, M.X. Yeo, in:, Financial Cryptography and Data Security, Springer Nature, 2022, pp. 358–373.","ista":"Avarikioti G, Pietrzak KZ, Salem I, Schmid S, Tiwari S, Yeo MX. 2022. Hide & Seek: Privacy-preserving rebalancing on payment channel networks. Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13411, 358–373.","mla":"Avarikioti, Georgia, et al. “Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.” Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 358–73, doi:10.1007/978-3-031-18283-9_17.","ama":"Avarikioti G, Pietrzak KZ, Salem I, Schmid S, Tiwari S, Yeo MX. Hide & Seek: Privacy-preserving rebalancing on payment channel networks. In: Financial Cryptography and Data Security. Vol 13411. Springer Nature; 2022:358-373. doi:10.1007/978-3-031-18283-9_17"},"scopus_import":"1","quality_controlled":"1","date_created":"2023-01-12T12:10:38Z","isi":1,"department":[{"_id":"KrPi"}],"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031182839"],"isbn":["9783031182822"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"date_published":"2022-10-22T00:00:00Z","page":"358-373","arxiv":1,"intvolume":" 13411","doi":"10.1007/978-3-031-18283-9_17","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Payment channels effectively move the transaction load off-chain thereby successfully addressing the inherent scalability problem most cryptocurrencies face. A major drawback of payment channels is the need to “top up” funds on-chain when a channel is depleted. Rebalancing was proposed to alleviate this issue, where parties with depleting channels move their funds along a cycle to replenish their channels off-chain. Protocols for rebalancing so far either introduce local solutions or compromise privacy.\r\nIn this work, we present an opt-in rebalancing protocol that is both private and globally optimal, meaning our protocol maximizes the total amount of rebalanced funds. We study rebalancing from the framework of linear programming. To obtain full privacy guarantees, we leverage multi-party computation in solving the linear program, which is executed by selected participants to maintain efficiency. Finally, we efficiently decompose the rebalancing solution into incentive-compatible cycles which conserve user balances when executed atomically."}],"conference":{"name":"FC: Financial Cryptography and Data Security","start_date":"2022-05-02","location":"Grenada","end_date":"2022-05-06"},"day":"22","publication_status":"published","_id":"12167","external_id":{"arxiv":["2110.08848"],"isi":["001423640200017"]},"publisher":"Springer Nature","author":[{"last_name":"Avarikioti","id":"c20482a0-3b89-11eb-9862-88cf6404b88c","full_name":"Avarikioti, Georgia","first_name":"Georgia"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"last_name":"Salem","first_name":"Iosif","full_name":"Salem, Iosif"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Tiwari","full_name":"Tiwari, Samarth","first_name":"Samarth"},{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","first_name":"Michelle X"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.08848","open_access":"1"}],"month":"10","date_updated":"2025-09-10T09:48:15Z"},{"oa":1,"oa_version":"Preprint","date_updated":"2025-09-10T09:48:54Z","month":"10","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.00960","open_access":"1"}],"OA_type":"green","_id":"12168","author":[{"first_name":"Shir","full_name":"Cohen, Shir","last_name":"Cohen"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Li","full_name":"Li, Zekun","first_name":"Zekun"},{"full_name":"Malkhi, Dahlia","first_name":"Dahlia","last_name":"Malkhi"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"first_name":"Alexander","full_name":"Spiegelman, Alexander","last_name":"Spiegelman"}],"publication_status":"published","external_id":{"isi":["001423640200013"],"arxiv":["2110.00960"]},"publisher":"Springer Nature","conference":{"end_date":"2022-05-06","name":"FC: Financial Cryptography and Data Security","location":"Grenada","start_date":"2022-05-02"},"day":"22","doi":"10.1007/978-3-031-18283-9_13","article_processing_charge":"No","abstract":[{"text":"Advances in blockchains have influenced the State-Machine-Replication (SMR) world and many state-of-the-art blockchain-SMR solutions are based on two pillars: Chaining and Leader-rotation. A predetermined round-robin mechanism used for Leader-rotation, however, has an undesirable behavior: crashed parties become designated leaders infinitely often, slowing down overall system performance. In this paper, we provide a new Leader-Aware SMR framework that, among other desirable properties, formalizes a Leader-utilization requirement that bounds the number of rounds whose leaders are faulty in crash-only executions.\r\nWe introduce Carousel, a novel, reputation-based Leader-rotation solution to achieve Leader-Aware SMR. The challenge in adaptive Leader-rotation is that it cannot rely on consensus to determine a leader, since consensus itself needs a leader. Carousel uses the available on-chain information to determine a leader locally and achieves Liveness despite this difficulty. A HotStuff implementation fitted with Carousel demonstrates drastic performance improvements: it increases throughput over 2x in faultless settings and provided a 20x throughput increase and 5x latency reduction in the presence of faults.","lang":"eng"}],"isi":1,"department":[{"_id":"ElKo"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031182822"],"eisbn":["9783031182839"],"eissn":["1611-3349"]},"OA_place":"repository","intvolume":" 13411","page":"279-295","arxiv":1,"alternative_title":["LNCS"],"date_published":"2022-10-22T00:00:00Z","year":"2022","type":"conference","language":[{"iso":"eng"}],"publication":"International Conference on Financial Cryptography and Data Security","title":"Be aware of your leaders","date_created":"2023-01-12T12:10:49Z","scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Cohen, Shir, Rati Gelashvili, Eleftherios Kokoris Kogias, Zekun Li, Dahlia Malkhi, Alberto Sonnino, and Alexander Spiegelman. “Be Aware of Your Leaders.” In International Conference on Financial Cryptography and Data Security, 13411:279–95. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-18283-9_13.","ieee":"S. Cohen et al., “Be aware of your leaders,” in International Conference on Financial Cryptography and Data Security, Grenada, 2022, vol. 13411, pp. 279–295.","apa":"Cohen, S., Gelashvili, R., Kokoris Kogias, E., Li, Z., Malkhi, D., Sonnino, A., & Spiegelman, A. (2022). Be aware of your leaders. In International Conference on Financial Cryptography and Data Security (Vol. 13411, pp. 279–295). Grenada: Springer Nature. https://doi.org/10.1007/978-3-031-18283-9_13","ama":"Cohen S, Gelashvili R, Kokoris Kogias E, et al. Be aware of your leaders. In: International Conference on Financial Cryptography and Data Security. Vol 13411. Springer Nature; 2022:279-295. doi:10.1007/978-3-031-18283-9_13","mla":"Cohen, Shir, et al. “Be Aware of Your Leaders.” International Conference on Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 279–95, doi:10.1007/978-3-031-18283-9_13.","ista":"Cohen S, Gelashvili R, Kokoris Kogias E, Li Z, Malkhi D, Sonnino A, Spiegelman A. 2022. Be aware of your leaders. International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13411, 279–295.","short":"S. Cohen, R. Gelashvili, E. Kokoris Kogias, Z. Li, D. Malkhi, A. Sonnino, A. Spiegelman, in:, International Conference on Financial Cryptography and Data Security, Springer Nature, 2022, pp. 279–295."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","volume":13411},{"department":[{"_id":"KrCh"}],"publication_identifier":{"eisbn":["9783031199929"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031199912"]},"isi":1,"date_published":"2022-10-21T00:00:00Z","alternative_title":["LNCS"],"page":"320-326","intvolume":" 13505","title":"PET – A partial exploration tool for probabilistic verification","publication":"20th International Symposium on Automated Technology for Verification and Analysis","corr_author":"1","language":[{"iso":"eng"}],"year":"2022","type":"conference","volume":13505,"status":"public","citation":{"ieee":"T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.","apa":"Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_20","chicago":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:320–26. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19992-9_20.","ista":"Meggendorfer T. 2022. PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 320–326.","short":"T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.","ama":"Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:320-326. doi:10.1007/978-3-031-19992-9_20","mla":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” 20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","scopus_import":"1","date_created":"2023-01-12T12:11:07Z","oa_version":"None","acknowledgement":"We thank Pranav Ashok and Maximilian Weininger for their contributions to spiritual predecessors of PET as well as motivating the initial development of this tool.","month":"10","date_updated":"2025-09-10T09:49:29Z","abstract":[{"lang":"eng","text":"We present PET, a specialized and highly optimized framework for partial exploration on probabilistic systems. Over the last decade, several significant advances in the analysis of Markov decision processes employed partial exploration. In a nutshell, this idea allows to focus computation on specific parts of the system, guided by heuristics, while maintaining correctness. In particular, only relevant parts of the system are constructed on demand, which in turn potentially allows to omit constructing large parts of the system. Depending on the model, this leads to dramatic speed-ups, in extreme cases even up to an arbitrary factor. PET unifies several previous implementations and provides a flexible framework to easily implement partial exploration for many further problems. Our experimental evaluation shows significant improvements compared to the previous implementations while vastly reducing the overhead required to add support for additional properties."}],"article_processing_charge":"No","doi":"10.1007/978-3-031-19992-9_20","day":"21","conference":{"location":"Virtual","start_date":"2022-10-25","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2022-10-28"},"_id":"12170","publisher":"Springer Nature","external_id":{"isi":["001456146500020"]},"publication_status":"published","author":[{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","first_name":"Tobias"}]},{"department":[{"_id":"ToHe"}],"publication_identifier":{"eisbn":["9783031199929"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031199912"]},"isi":1,"date_published":"2022-10-21T00:00:00Z","alternative_title":["LNCS"],"page":"337-353","arxiv":1,"intvolume":" 13505","title":"Synthesis of parametric hybrid automata from time series","publication":"20th International Symposium on Automated Technology for Verification and Analysis","corr_author":"1","language":[{"iso":"eng"}],"type":"conference","year":"2022","volume":13505,"status":"public","citation":{"ista":"Garcia Soto M, Henzinger TA, Schilling C. 2022. Synthesis of parametric hybrid automata from time series. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 337–353.","short":"M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 337–353.","ama":"Garcia Soto M, Henzinger TA, Schilling C. Synthesis of parametric hybrid automata from time series. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:337-353. doi:10.1007/978-3-031-19992-9_22","mla":"Garcia Soto, Miriam, et al. “Synthesis of Parametric Hybrid Automata from Time Series.” 20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 337–53, doi:10.1007/978-3-031-19992-9_22.","ieee":"M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of parametric hybrid automata from time series,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 337–353.","apa":"Garcia Soto, M., Henzinger, T. A., & Schilling, C. (2022). Synthesis of parametric hybrid automata from time series. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 337–353). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_22","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Parametric Hybrid Automata from Time Series.” In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:337–53. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19992-9_22."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","scopus_import":"1","date_created":"2023-01-12T12:11:16Z","oa_version":"Preprint","oa":1,"acknowledgement":"This work was supported in part by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 847635, by the ERC-2020-AdG 101020093, by DIREC - Digital Research Centre Denmark, and by the Villum Investigator Grant S4OS.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2208.06383"}],"month":"10","date_updated":"2025-09-10T09:50:08Z","ec_funded":1,"article_processing_charge":"No","abstract":[{"text":"We propose an algorithmic approach for synthesizing linear hybrid automata from time-series data. Unlike existing approaches, our approach provides a whole family of models with the same discrete structure but different dynamics. Each model in the family is guaranteed to capture the input data up to a precision error ε, in the following sense: For each time series, the model contains an execution that is ε-close to the data points. Our construction allows to effectively choose a model from this family with minimal precision error ε. We demonstrate the algorithm’s efficiency and its ability to find precise models in two case studies.","lang":"eng"}],"doi":"10.1007/978-3-031-19992-9_22","day":"21","conference":{"start_date":"2022-10-25","location":"Virtual","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2022-10-28"},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"external_id":{"isi":["001456146500022"],"arxiv":["2208.06383"]},"_id":"12171","author":[{"first_name":"Miriam","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam","last_name":"Garcia Soto","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer Nature","publication_status":"published"},{"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://hal.science/hal-03849398/"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, the EPSRC project EP/V025848/1, and the EPSRC project EP/X017796/1.","date_updated":"2025-09-10T09:50:45Z","month":"10","ec_funded":1,"abstract":[{"lang":"eng","text":"An automaton is history-deterministic (HD) if one can safely resolve its non-deterministic choices on the fly. In a recent paper, Henzinger, Lehtinen and Totzke studied this in the context of Timed Automata [9], where it was conjectured that the class of timed ω-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact."}],"article_processing_charge":"No","doi":"10.1007/978-3-031-19135-0_5","publisher":"Springer Nature","_id":"12175","publication_status":"published","external_id":{"isi":["001333698300005"]},"author":[{"first_name":"Sougata","full_name":"Bose, Sougata","last_name":"Bose"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Lehtinen, Karoliina","first_name":"Karoliina","last_name":"Lehtinen"},{"last_name":"Schewe","full_name":"Schewe, Sven","first_name":"Sven"},{"full_name":"Totzke, Patrick","first_name":"Patrick","last_name":"Totzke"}],"day":"12","conference":{"end_date":"2022-10-21","start_date":"2022-10-17","location":"Kaiserslautern, Germany","name":"RC: Reachability Problems"},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"publication_identifier":{"isbn":["9783031191343"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783031191350"]},"department":[{"_id":"ToHe"}],"isi":1,"page":"67-76","date_published":"2022-10-12T00:00:00Z","alternative_title":["LNCS"],"intvolume":" 13608","language":[{"iso":"eng"}],"title":"History-deterministic timed automata are not determinizable","publication":"16th International Conference on Reachability Problems","year":"2022","type":"conference","citation":{"mla":"Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.” 16th International Conference on Reachability Problems, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:10.1007/978-3-031-19135-0_5.","ama":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic timed automata are not determinizable. In: 16th International Conference on Reachability Problems. Vol 13608. Springer Nature; 2022:67-76. doi:10.1007/978-3-031-19135-0_5","ista":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2022. History-deterministic timed automata are not determinizable. 16th International Conference on Reachability Problems. RC: Reachability Problems, LNCS, vol. 13608, 67–76.","short":"S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, in:, 16th International Conference on Reachability Problems, Springer Nature, 2022, pp. 67–76.","chicago":"Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.” In 16th International Conference on Reachability Problems, 13608:67–76. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19135-0_5.","apa":"Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., & Totzke, P. (2022). History-deterministic timed automata are not determinizable. In 16th International Conference on Reachability Problems (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-19135-0_5","ieee":"S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":13608,"status":"public","date_created":"2023-01-12T12:11:57Z","scopus_import":"1","quality_controlled":"1"},{"volume":13508,"status":"public","citation":{"ama":"Hoffmann C, Hubáček P, Kamath C, Klein K, Pietrzak KZ. Practical statistically-sound proofs of exponentiation in any group. In: Advances in Cryptology – CRYPTO 2022. Vol 13508. Springer Nature; 2022:370-399. doi:10.1007/978-3-031-15979-4_13","mla":"Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.” Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K. Klein, K.Z. Pietrzak, in:, Advances in Cryptology – CRYPTO 2022, Springer Nature, 2022, pp. 370–399.","ista":"Hoffmann C, Hubáček P, Kamath C, Klein K, Pietrzak KZ. 2022. Practical statistically-sound proofs of exponentiation in any group. Advances in Cryptology – CRYPTO 2022. CRYPTO: International Cryptology Conference, LNCS, vol. 13508, 370–399.","chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, Karen Klein, and Krzysztof Z Pietrzak. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.” In Advances in Cryptology – CRYPTO 2022, 13508:370–99. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-15979-4_13.","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, K. Klein, and K. Z. Pietrzak, “Practical statistically-sound proofs of exponentiation in any group,” in Advances in Cryptology – CRYPTO 2022, Santa Barbara, CA, United States, 2022, vol. 13508, pp. 370–399.","apa":"Hoffmann, C., Hubáček, P., Kamath, C., Klein, K., & Pietrzak, K. Z. (2022). Practical statistically-sound proofs of exponentiation in any group. In Advances in Cryptology – CRYPTO 2022 (Vol. 13508, pp. 370–399). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-15979-4_13"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"20920","status":"public"},{"relation":"dissertation_contains","id":"20556","status":"public"}]},"scopus_import":"1","quality_controlled":"1","date_created":"2023-01-12T12:12:07Z","title":"Practical statistically-sound proofs of exponentiation in any group","corr_author":"1","publication":"Advances in Cryptology – CRYPTO 2022","language":[{"iso":"eng"}],"year":"2022","type":"conference","date_published":"2022-10-13T00:00:00Z","alternative_title":["LNCS"],"page":"370-399","intvolume":" 13508","department":[{"_id":"KrPi"}],"publication_identifier":{"eisbn":["9783031159794"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031159787"]},"isi":1,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"A proof of exponentiation (PoE) in a group G of unknown order allows a prover to convince a verifier that a tuple (x,q,T,y)∈G×N×N×G satisfies xqT=y. This primitive has recently found exciting applications in the constructions of verifiable delay functions and succinct arguments of knowledge. The most practical PoEs only achieve soundness either under computational assumptions, i.e., they are arguments (Wesolowski, Journal of Cryptology 2020), or in groups that come with the promise of not having any small subgroups (Pietrzak, ITCS 2019). The only statistically-sound PoE in general groups of unknown order is due to Block et al. (CRYPTO 2021), and can be seen as an elaborate parallel repetition of Pietrzak’s PoE: to achieve λ bits of security, say λ=80, the number of repetitions required (and thus the blow-up in communication) is as large as λ.\r\n\r\nIn this work, we propose a statistically-sound PoE for the case where the exponent q is the product of all primes up to some bound B. We show that, in this case, it suffices to run only λ/log(B) parallel instances of Pietrzak’s PoE, which reduces the concrete proof-size compared to Block et al. by an order of magnitude. Furthermore, we show that in the known applications where PoEs are used as a building block such structured exponents are viable. Finally, we also discuss batching of our PoE, showing that many proofs (for the same G and q but different x and T) can be batched by adding only a single element to the proof per additional statement."}],"doi":"10.1007/978-3-031-15979-4_13","day":"13","conference":{"start_date":"2022-08-15","location":"Santa Barbara, CA, United States","name":"CRYPTO: International Cryptology Conference","end_date":"2022-08-18"},"_id":"12176","external_id":{"isi":["000886792700013"]},"publication_status":"published","publisher":"Springer Nature","author":[{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549","first_name":"Charlotte"},{"full_name":"Hubáček, Pavel","first_name":"Pavel","last_name":"Hubáček"},{"full_name":"Kamath, Chethan","first_name":"Chethan","last_name":"Kamath"},{"full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"acknowledgement":"We would like to thank the authors of [BHR+21] for clarifying several questions we had\r\nregarding their results. Pavel Hubá£ek was supported by the Grant Agency of the Czech\r\nRepublic under the grant agreement no. 19-27871X and by the Charles University project\r\nUNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship\r\nand ISF grants 484/18 and 1789/19. Karen Klein was supported in part by ERC CoG grant\r\n724307 and conducted part of this work at Institute of Science and Technology Austria.","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1021"}],"month":"10","date_updated":"2026-04-07T12:34:30Z","oa_version":"Preprint","oa":1},{"ec_funded":1,"ddc":["570"],"doi":"10.1186/s13059-022-02665-3","article_processing_charge":"No","abstract":[{"text":"Background: Biases of DNA repair can shape the nucleotide landscape of genomes at evolutionary timescales. The molecular mechanisms of those biases are still poorly understood because it is difficult to isolate the contributions of DNA repair from those of DNA damage.\r\n\r\nResults: Here, we develop a genome-wide assay whereby the same DNA lesion is repaired in different genomic contexts. We insert thousands of barcoded transposons carrying a reporter of DNA mismatch repair in the genome of mouse embryonic stem cells. Upon inducing a double-strand break between tandem repeats, a mismatch is generated if the break is repaired through single-strand annealing. The resolution of the mismatch showed a 60–80% bias in favor of the strand with the longest 3′ flap. The location of the lesion in the genome and the type of mismatch had little influence on the bias. Instead, we observe a complete reversal of the bias when the longest 3′ flap is moved to the opposite strand by changing the position of the double-strand break in the reporter.\r\n\r\nConclusions: These results suggest that the processing of the double-strand break has a major influence on the repair of mismatches during single-strand annealing.","lang":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"day":"12","_id":"12226","external_id":{"pmid":["35414014"],"isi":["000781953800001"]},"publication_status":"published","publisher":"Springer Nature","author":[{"id":"3184041C-F248-11E8-B48F-1D18A9856A87","last_name":"Pokusaeva","first_name":"Victoria","full_name":"Pokusaeva, Victoria","orcid":"0000-0001-7660-444X"},{"last_name":"Diez","first_name":"Aránzazu Rosado","full_name":"Diez, Aránzazu Rosado"},{"last_name":"Espinar","full_name":"Espinar, Lorena","first_name":"Lorena"},{"first_name":"Albert Torelló","full_name":"Pérez, Albert Torelló","last_name":"Pérez"},{"full_name":"Filion, Guillaume J.","first_name":"Guillaume J.","last_name":"Filion"}],"file_date_updated":"2023-01-27T09:01:40Z","oa_version":"Published Version","article_type":"original","oa":1,"acknowledgement":"We acknowledge the financial support of the Natural Sciences and Engineering Research Council of Canada (NSERC RGPIN-2020-06377), the Spanish Ministry of Economy, Industry and Competitiveness (“Centro de Excelencia Severo Ochoa 2013-2017”, Plan Estatal PGC2018-099807-B-I00), of the CERCA Programme/Generalitat de Catalunya, and of the European Research Council (Synergy Grant 609989). VOP was supported by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie programme (665385). We also acknowledge the support of the Spanish Ministry of Economy and Competitiveness (MEIC) to the EMBL partnership.","month":"04","has_accepted_license":"1","date_updated":"2025-03-31T16:01:11Z","publication":"Genome Biology","title":"Strand asymmetry influences mismatch resolution during single-strand annealing","file":[{"file_name":"2022_GenomeBiology_Pokusaeva.pdf","checksum":"17bb091fec04d82ba20a3458c4cfd2bd","file_size":4939342,"relation":"main_file","content_type":"application/pdf","date_created":"2023-01-27T09:01:40Z","date_updated":"2023-01-27T09:01:40Z","success":1,"file_id":"12419","access_level":"open_access","creator":"dernst"}],"language":[{"iso":"eng"}],"pmid":1,"year":"2022","type":"journal_article","status":"public","volume":23,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Pokusaeva, Victoria, et al. “Strand Asymmetry Influences Mismatch Resolution during Single-Strand Annealing.” Genome Biology, vol. 23, 93, Springer Nature, 2022, doi:10.1186/s13059-022-02665-3.","ama":"Pokusaeva V, Diez AR, Espinar L, Pérez AT, Filion GJ. Strand asymmetry influences mismatch resolution during single-strand annealing. Genome Biology. 2022;23. doi:10.1186/s13059-022-02665-3","short":"V. Pokusaeva, A.R. Diez, L. Espinar, A.T. Pérez, G.J. Filion, Genome Biology 23 (2022).","ista":"Pokusaeva V, Diez AR, Espinar L, Pérez AT, Filion GJ. 2022. Strand asymmetry influences mismatch resolution during single-strand annealing. Genome Biology. 23, 93.","chicago":"Pokusaeva, Victoria, Aránzazu Rosado Diez, Lorena Espinar, Albert Torelló Pérez, and Guillaume J. Filion. “Strand Asymmetry Influences Mismatch Resolution during Single-Strand Annealing.” Genome Biology. Springer Nature, 2022. https://doi.org/10.1186/s13059-022-02665-3.","apa":"Pokusaeva, V., Diez, A. R., Espinar, L., Pérez, A. T., & Filion, G. J. (2022). Strand asymmetry influences mismatch resolution during single-strand annealing. Genome Biology. Springer Nature. https://doi.org/10.1186/s13059-022-02665-3","ieee":"V. Pokusaeva, A. R. Diez, L. Espinar, A. T. Pérez, and G. J. Filion, “Strand asymmetry influences mismatch resolution during single-strand annealing,” Genome Biology, vol. 23. Springer Nature, 2022."},"quality_controlled":"1","scopus_import":"1","related_material":{"link":[{"url":"https://github.com/cellcomplexitylab/strand_asymmetry ","relation":"software"},{"url":"https://hub.docker.com/r/gui11aume/strand_asymmetry","relation":"software"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2023-01-16T09:48:44Z","isi":1,"department":[{"_id":"MaJö"}],"publication_identifier":{"issn":["1474-760X"]},"date_published":"2022-04-12T00:00:00Z","article_number":"93","intvolume":" 23"},{"status":"public","volume":5,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Kovačič S, Schafzahl B, Matsko NB, Gruber K, Schmuck M, Koller S, Freunberger SA, Slugovc C. 2022. Carbon foams via ring-opening metathesis polymerization of emulsion templates: A facile method to make carbon current collectors for battery applications. ACS Applied Energy Materials. 5(11), 14381–14390.","short":"S. Kovačič, B. Schafzahl, N.B. Matsko, K. Gruber, M. Schmuck, S. Koller, S.A. Freunberger, C. Slugovc, ACS Applied Energy Materials 5 (2022) 14381–14390.","ama":"Kovačič S, Schafzahl B, Matsko NB, et al. Carbon foams via ring-opening metathesis polymerization of emulsion templates: A facile method to make carbon current collectors for battery applications. ACS Applied Energy Materials. 2022;5(11):14381-14390. doi:10.1021/acsaem.2c02787","mla":"Kovačič, Sebastijan, et al. “Carbon Foams via Ring-Opening Metathesis Polymerization of Emulsion Templates: A Facile Method to Make Carbon Current Collectors for Battery Applications.” ACS Applied Energy Materials, vol. 5, no. 11, American Chemical Society, 2022, pp. 14381–90, doi:10.1021/acsaem.2c02787.","ieee":"S. Kovačič et al., “Carbon foams via ring-opening metathesis polymerization of emulsion templates: A facile method to make carbon current collectors for battery applications,” ACS Applied Energy Materials, vol. 5, no. 11. American Chemical Society, pp. 14381–14390, 2022.","apa":"Kovačič, S., Schafzahl, B., Matsko, N. B., Gruber, K., Schmuck, M., Koller, S., … Slugovc, C. (2022). Carbon foams via ring-opening metathesis polymerization of emulsion templates: A facile method to make carbon current collectors for battery applications. ACS Applied Energy Materials. American Chemical Society. https://doi.org/10.1021/acsaem.2c02787","chicago":"Kovačič, Sebastijan, Bettina Schafzahl, Nadejda B. Matsko, Katharina Gruber, Martin Schmuck, Stefan Koller, Stefan Alexander Freunberger, and Christian Slugovc. “Carbon Foams via Ring-Opening Metathesis Polymerization of Emulsion Templates: A Facile Method to Make Carbon Current Collectors for Battery Applications.” ACS Applied Energy Materials. American Chemical Society, 2022. https://doi.org/10.1021/acsaem.2c02787."},"quality_controlled":"1","scopus_import":"1","date_created":"2023-01-16T09:48:53Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","publication":"ACS Applied Energy Materials","title":"Carbon foams via ring-opening metathesis polymerization of emulsion templates: A facile method to make carbon current collectors for battery applications","file":[{"file_size":13105589,"relation":"main_file","file_name":"2022_AppliedEnergyMaterials_Kovacic.pdf","checksum":"572d15c250ab83d44f4e2c3aeb5f7388","date_created":"2023-01-27T09:09:15Z","date_updated":"2023-01-27T09:09:15Z","content_type":"application/pdf","file_id":"12420","access_level":"open_access","success":1,"creator":"dernst"}],"language":[{"iso":"eng"}],"type":"journal_article","year":"2022","issue":"11","date_published":"2022-10-16T00:00:00Z","page":"14381-14390","intvolume":" 5","isi":1,"department":[{"_id":"StFr"}],"publication_identifier":{"issn":["2574-0962"]},"doi":"10.1021/acsaem.2c02787","abstract":[{"lang":"eng","text":"Polydicyclopentadiene (pDCPD), a thermoset with excellent mechanical properties, has enormous potential as a lightweight, tough, and stable matrix material owing to its highly cross-linked macromolecular network. This work describes generating pDCPD-based foams and hierarchically porous carbons derived therefrom by combining ring-opening metathesis polymerization (ROMP) of DCPD, high internal phase emulsions (HIPEs) as structural templates, and subsequent carbonization. The structure and function of the carbon foams were characterized and discussed in detail using scanning electron, transmission electron, or atomic force microscopy (SEM, TEM, AFM), electron energy-loss spectroscopy (TEM-EELS), N2 sorption, and analyses of electrical conductivity as well as mechanical properties. The resulting materials exhibited uniform, shape-retaining shrinkage of only ∼1/3 after carbonization. No structural failure was observed even when the pDCPD precursor foams were heated to 1400 °C. Instead, the high porosity, void size, and 3D interconnectivity were fully preserved, and the void diameters could be adjusted between 87 and 2.5 μm. Moreover, foams have a carbon content >97%, an electronic conductivity of up to 2800 S·m–1, a Young’s modulus of up to 2.1 GPa, and a specific surface area of up to 1200 m2·g–1. Surprisingly, the pDCPD foams were carbonized into shapes other than monoliths, such as 10’s of micron thick membranes or foamy coatings adhered to a metal foil or grid substrate. The latter coatings even adhere upon bending. Finally, as a use case, carbonized foams were applied as porous cathodes for Li–O2 batteries where the foams show a favorable combination of porosity, active surface area, and pore size for outstanding capacity."}],"article_processing_charge":"No","day":"16","_id":"12227","external_id":{"isi":["000875635900001"]},"publisher":"American Chemical Society","publication_status":"published","author":[{"first_name":"Sebastijan","full_name":"Kovačič, Sebastijan","last_name":"Kovačič"},{"last_name":"Schafzahl","full_name":"Schafzahl, Bettina","first_name":"Bettina"},{"full_name":"Matsko, Nadejda B.","first_name":"Nadejda B.","last_name":"Matsko"},{"last_name":"Gruber","first_name":"Katharina","full_name":"Gruber, Katharina"},{"last_name":"Schmuck","first_name":"Martin","full_name":"Schmuck, Martin"},{"first_name":"Stefan","full_name":"Koller, Stefan","last_name":"Koller"},{"first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger"},{"first_name":"Christian","full_name":"Slugovc, Christian","last_name":"Slugovc"}],"ddc":["540"],"acknowledgement":"S.K. acknowledges the financial support from the Slovenian Research Agency (grants P1-0021, P2-0150). Support by Graz University of Technology (LP-03 – Porous Materials@Work) and from VARTA Innovation GmbH is kindly acknowledged. We thank Umicore for providing the initiator and Matjaž Mazaj (National Institute of Chemistry, Ljubljana) and Karel Jerabek (Czech Academy of Sciences) for measurements and fruitful discussions. S.A.F. is indebted to the Austrian Federal Ministry of Science, Research and Economy; the Austrian Research Promotion Agency (Grant No. 845364); and ISTA for support.","month":"10","has_accepted_license":"1","date_updated":"2024-10-09T21:03:48Z","oa_version":"Published Version","file_date_updated":"2023-01-27T09:09:15Z","keyword":["Electrical and Electronic Engineering","Materials Chemistry","Electrochemistry","Energy Engineering and Power Technology","Chemical Engineering (miscellaneous)"],"oa":1,"article_type":"original"},{"oa":1,"article_type":"original","oa_version":"Preprint","month":"11","date_updated":"2023-08-04T09:34:43Z","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2109.02122"}],"day":"01","publication_status":"published","_id":"12233","external_id":{"arxiv":["2109.02122"],"isi":["000937284600006"]},"publisher":"Institute of Electrical and Electronics Engineers","author":[{"full_name":"Doan, Nghia","first_name":"Nghia","last_name":"Doan"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"first_name":"Warren J.","full_name":"Gross, Warren J.","last_name":"Gross"}],"doi":"10.1109/tcomm.2022.3211101","abstract":[{"text":"A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permutations (SP) of the codeword is presented. A low-complexity SP scheme applied to a subset of the symmetry group of RM codes is first proposed to carefully select a good codeword permutation on the fly. Then, the proposed SP technique is integrated into an improved RLD algorithm that initializes different decoding paths with random codeword permutations, which are sampled from the full symmetry group of RM codes. Finally, efficient latency and complexity reduction schemes are introduced that virtually preserve the error-correction performance of the proposed decoder. Simulation results demonstrate that at the target frame error rate of 10−3 for the RM code of length 256 with 163 information bits, the proposed decoder reduces 6% of the computational complexity and 22% of the decoding latency of the state-of-the-art semi-parallel simplified successive-cancellation decoder with fast Hadamard transform (SSC-FHT) that uses 96 permutations from the full symmetry group of RM codes, while relatively maintaining the error-correction performance and memory consumption of the semi-parallel permuted SSC-FHT decoder.","lang":"eng"}],"article_processing_charge":"No","isi":1,"department":[{"_id":"MaMo"}],"publication_identifier":{"eissn":["1558-0857"],"issn":["0090-6778"]},"intvolume":" 70","date_published":"2022-11-01T00:00:00Z","arxiv":1,"page":"7134-7145","year":"2022","issue":"11","type":"journal_article","publication":"IEEE Transactions on Communications","title":"Decoding Reed-Muller codes with successive codeword permutations","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","date_created":"2023-01-16T09:50:38Z","status":"public","volume":70,"citation":{"ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. Decoding Reed-Muller codes with successive codeword permutations. IEEE Transactions on Communications. 2022;70(11):7134-7145. doi:10.1109/tcomm.2022.3211101","mla":"Doan, Nghia, et al. “Decoding Reed-Muller Codes with Successive Codeword Permutations.” IEEE Transactions on Communications, vol. 70, no. 11, Institute of Electrical and Electronics Engineers, 2022, pp. 7134–45, doi:10.1109/tcomm.2022.3211101.","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, IEEE Transactions on Communications 70 (2022) 7134–7145.","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2022. Decoding Reed-Muller codes with successive codeword permutations. IEEE Transactions on Communications. 70(11), 7134–7145.","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “Decoding Reed-Muller Codes with Successive Codeword Permutations.” IEEE Transactions on Communications. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/tcomm.2022.3211101.","ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “Decoding Reed-Muller codes with successive codeword permutations,” IEEE Transactions on Communications, vol. 70, no. 11. Institute of Electrical and Electronics Engineers, pp. 7134–7145, 2022.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2022). Decoding Reed-Muller codes with successive codeword permutations. IEEE Transactions on Communications. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/tcomm.2022.3211101"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"date_created":"2023-01-16T10:05:51Z","scopus_import":"1","quality_controlled":"1","citation":{"ama":"Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In: Financial Cryptography and Data Security. Vol 13411. Springer Nature; 2022:296-315. doi:10.1007/978-3-031-18283-9_14","mla":"Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 296–315, doi:10.1007/978-3-031-18283-9_14.","short":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, Z. Xiang, in:, Financial Cryptography and Data Security, Springer Nature, 2022, pp. 296–315.","ista":"Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. 2022. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 13411, 296–315.","chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” In Financial Cryptography and Data Security, 13411:296–315. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-18283-9_14.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang, “Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,” in Financial Cryptography and Data Security, Radisson Grenada Beach Resort, Grenada, 2022, vol. 13411, pp. 296–315.","apa":"Gelashvili, R., Kokoris Kogias, E., Sonnino, A., Spiegelman, A., & Xiang, Z. (2022). Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In Financial Cryptography and Data Security (Vol. 13411, pp. 296–315). Radisson Grenada Beach Resort, Grenada: Springer Nature. https://doi.org/10.1007/978-3-031-18283-9_14"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":13411,"status":"public","year":"2022","type":"conference","language":[{"iso":"eng"}],"title":"Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback","publication":"Financial Cryptography and Data Security","intvolume":" 13411","arxiv":1,"page":"296-315","date_published":"2022-10-22T00:00:00Z","alternative_title":["LNCS"],"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031182839"],"isbn":["9783031182822"],"issn":["0302-9743"]},"department":[{"_id":"ElKo"}],"isi":1,"_id":"12298","publication_status":"published","external_id":{"arxiv":["2106.10362"],"isi":["001423640200014"]},"author":[{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"full_name":"Spiegelman, Alexander","first_name":"Alexander","last_name":"Spiegelman"},{"last_name":"Xiang","first_name":"Zhuolun","full_name":"Xiang, Zhuolun"}],"publisher":"Springer Nature","day":"22","conference":{"end_date":"2022-05-06","name":"FC: Financial Cryptography","location":"Radisson Grenada Beach Resort, Grenada","start_date":"2022-05-02"},"abstract":[{"text":"Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the steady state, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the steady state (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing the view-synchronization of partially synchronous protocols with an asynchronous fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff. We implement and experimentally evaluate all our systems to prove that breaking the robustness-efficiency trade-off is in the realm of practicality.","lang":"eng"}],"article_processing_charge":"No","doi":"10.1007/978-3-031-18283-9_14","date_updated":"2025-09-10T09:52:23Z","month":"10","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2106.10362","open_access":"1"}],"acknowledgement":"We thank our shepherd Aniket Kate and the anonymous reviewers at FC 2022 for their helpful feedback. This work is supported by the Novi team at Facebook. We also thank the Novi Research and Engineering teams for valuable feedback, and in particular Mathieu Baudet, Andrey Chursin, George Danezis, Zekun Li, and Dahlia Malkhi for discussions that shaped this work.","oa":1,"oa_version":"Preprint"},{"oa_version":"Preprint","oa":1,"department":[{"_id":"ElKo"}],"publication_identifier":{"eissn":["2375-1207"],"eisbn":["9781665413169"]},"date_published":"2022-07-27T00:00:00Z","acknowledgement":"The authors would like to thank Amit Agarwal, Adithya Bhat, Kobi Gurkan, Dakshita Khurana, Nibesh Shrestha, and Gilad Stern for the helpful discussions related to the paper.\r\nAlso, the authors would like to thank Sylvain Bellemare for helping with the hbACSS codebase and Nicolas Gailly for helping with running the Drand experiments.","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1591"}],"page":"2518-2534","month":"07","date_updated":"2023-02-16T07:43:53Z","title":"Practical asynchronous distributed key generation","publication":"2022 IEEE Symposium on Security and Privacy","language":[{"iso":"eng"}],"year":"2022","type":"conference","abstract":[{"lang":"eng","text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t2022 IEEE Symposium on Security and Privacy. Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:10.1109/sp46214.2022.9833584","mla":"Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–34, doi:10.1109/sp46214.2022.9833584.","short":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–2534.","ista":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 2518–2534.","chicago":"Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In 2022 IEEE Symposium on Security and Privacy, 2518–34. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/sp46214.2022.9833584.","ieee":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in 2022 IEEE Symposium on Security and Privacy, San Francisco, CA, United States, 2022, pp. 2518–2534.","apa":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., & Ren, L. (2022). Practical asynchronous distributed key generation. In 2022 IEEE Symposium on Security and Privacy (pp. 2518–2534). San Francisco, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sp46214.2022.9833584"},"conference":{"name":"SP: Symposium on Security and Privacy","location":"San Francisco, CA, United States","start_date":"2022-05-23","end_date":"2022-05-26"},"day":"27","quality_controlled":"1","scopus_import":"1","publisher":"Institute of Electrical and Electronics Engineers","_id":"12300","publication_status":"published","author":[{"last_name":"Das","full_name":"Das, Sourav","first_name":"Sourav"},{"full_name":"Yurek, Thomas","first_name":"Thomas","last_name":"Yurek"},{"last_name":"Xiang","full_name":"Xiang, Zhuolun","first_name":"Zhuolun"},{"last_name":"Miller","full_name":"Miller, Andrew","first_name":"Andrew"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Ren","full_name":"Ren, Ling","first_name":"Ling"}],"date_created":"2023-01-16T10:06:11Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2023-01-16T10:06:31Z","quality_controlled":"1","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129.","ista":"Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13372, 109–129.","mla":"Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” Computer Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6.","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: Computer Aided Verification. Vol 13372. Springer Nature; 2022:109-129. doi:10.1007/978-3-031-13188-2_6","apa":"Doveri, K., Ganty, P., & Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-13188-2_6","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in Computer Aided Verification, Haifa, Israel, 2022, vol. 13372, pp. 109–129.","chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In Computer Aided Verification, 13372:109–29. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-13188-2_6."},"status":"public","volume":13372,"type":"conference","year":"2022","file":[{"date_created":"2023-01-30T12:51:02Z","date_updated":"2023-01-30T12:51:02Z","content_type":"application/pdf","relation":"main_file","file_size":497682,"file_name":"2022_LNCS_Doveri.pdf","checksum":"edc363b1be5447a09063e115c247918a","creator":"dernst","access_level":"open_access","file_id":"12465","success":1}],"language":[{"iso":"eng"}],"publication":"Computer Aided Verification","title":"FORQ-based language inclusion formal testing","intvolume":" 13372","arxiv":1,"page":"109-129","alternative_title":["LNCS"],"date_published":"2022-08-06T00:00:00Z","isi":1,"department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031131875"],"eisbn":["9783031131882"],"eissn":["1611-3349"]},"_id":"12302","publisher":"Springer Nature","publication_status":"published","external_id":{"arxiv":["2207.13549"],"isi":["000870310500006"]},"author":[{"full_name":"Doveri, Kyveli","first_name":"Kyveli","last_name":"Doveri"},{"last_name":"Ganty","first_name":"Pierre","full_name":"Ganty, Pierre"},{"first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"conference":{"name":"CAV: Computer Aided Verification","start_date":"2022-08-07","location":"Haifa, Israel","end_date":"2022-08-10"},"day":"06","doi":"10.1007/978-3-031-13188-2_6","abstract":[{"lang":"eng","text":"We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870"}],"article_processing_charge":"No","ddc":["000"],"ec_funded":1,"has_accepted_license":"1","date_updated":"2025-04-14T07:55:56Z","month":"08","acknowledgement":"This work was partially funded by the ESF Investing in your future, the Madrid regional project S2018/TCS-4339 BLOQUES, the Spanish project PGC2018-102210-B-I00 BOSCO, the Ramón y Cajal fellowship RYC-2016-20281, and the ERC grant PR1001ERC02.","oa":1,"file_date_updated":"2023-01-30T12:51:02Z","oa_version":"Published Version"},{"type":"book_chapter","year":"2022","language":[{"iso":"eng"}],"title":"Loop Grassmannians of Quivers and Affine Quantum Groups","publication":"Representation Theory and Algebraic Geometry","date_created":"2023-01-16T10:06:41Z","series_title":"TM","scopus_import":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine Quantum Groups,” in Representation Theory and Algebraic Geometry, 1st ed., V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser, 2022, pp. 347–392.","apa":"Mirković, I., Yang, Y., & Zhao, G. (2022). Loop Grassmannians of Quivers and Affine Quantum Groups. In V. Baranovskky, N. Guay, & T. Schedler (Eds.), Representation Theory and Algebraic Geometry (1st ed., pp. 347–392). Cham: Springer Nature; Birkhäuser. https://doi.org/10.1007/978-3-030-82007-7_8","chicago":"Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers and Affine Quantum Groups.” In Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92. TM. Cham: Springer Nature; Birkhäuser, 2022. https://doi.org/10.1007/978-3-030-82007-7_8.","ista":"Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics, , 347–392.","short":"I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler (Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature; Birkhäuser, Cham, 2022, pp. 347–392.","ama":"Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum Groups. In: Baranovskky V, Guay N, Schedler T, eds. Representation Theory and Algebraic Geometry. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392. doi:10.1007/978-3-030-82007-7_8","mla":"Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.” Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:10.1007/978-3-030-82007-7_8."},"status":"public","department":[{"_id":"TaHa"}],"publication_identifier":{"issn":["2297-0215"],"isbn":["9783030820060"],"eisbn":["9783030820077"],"eissn":["2297-024X"]},"arxiv":1,"page":"347-392","date_published":"2022-06-16T00:00:00Z","alternative_title":["Trends in Mathematics"],"ec_funded":1,"edition":"1","_id":"12303","external_id":{"arxiv":["1810.10095"]},"publication_status":"published","author":[{"last_name":"Mirković","first_name":"Ivan","full_name":"Mirković, Ivan"},{"first_name":"Yaping","full_name":"Yang, Yaping","last_name":"Yang"},{"first_name":"Gufang","full_name":"Zhao, Gufang","last_name":"Zhao","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer Nature; Birkhäuser","day":"16","project":[{"grant_number":"320593","call_identifier":"FP7","_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces"}],"place":"Cham","article_processing_charge":"No","abstract":[{"text":"We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418).","lang":"eng"}],"doi":"10.1007/978-3-030-82007-7_8","oa":1,"oa_version":"Preprint","editor":[{"last_name":"Baranovskky","full_name":"Baranovskky, Vladimir","first_name":"Vladimir"},{"last_name":"Guay","full_name":"Guay, Nicolas","first_name":"Nicolas"},{"last_name":"Schedler","full_name":"Schedler, Travis","first_name":"Travis"}],"date_updated":"2025-04-14T09:12:46Z","month":"06","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1810.10095"}],"acknowledgement":"I.M. thanks Zhijie Dong for long-term discussions on the material that entered this work. We thank Misha Finkelberg for pointing out errors in earlier versions. His advice and his insistence have led to a much better paper. A part of the writing was done at the conference at IST (Vienna) attended by all coauthors. We therefore thank the organizers of the conference and the support of ERC Advanced Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M. was partially supported by NSF grants. The work of Y.Y. was partially supported by the Australian Research Council (ARC) via the award DE190101231. The work of G.Z. was partially supported by ARC via the award DE190101222."},{"publisher":"Institute of Science and Technology Austria","_id":"12358","publication_status":"published","author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","last_name":"Sperl","full_name":"Sperl, Georg","first_name":"Georg"}],"day":"22","project":[{"call_identifier":"H2020","grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"The complex yarn structure of knitted and woven fabrics gives rise to both a mechanical and\r\nvisual complexity. The small-scale interactions of yarns colliding with and pulling on each\r\nother result in drastically different large-scale stretching and bending behavior, introducing\r\nanisotropy, curling, and more. While simulating cloth as individual yarns can reproduce this\r\ncomplexity and match the quality of real fabric, it may be too computationally expensive for\r\nlarge fabrics. On the other hand, continuum-based approaches do not need to discretize the\r\ncloth at a stitch-level, but it is non-trivial to find a material model that would replicate the\r\nlarge-scale behavior of yarn fabrics, and they discard the intricate visual detail. In this thesis,\r\nwe discuss three methods to try and bridge the gap between small-scale and large-scale yarn\r\nmechanics using numerical homogenization: fitting a continuum model to periodic yarn simulations, adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively\r\nfitting yarn parameters to physical measurements of real fabric.\r\nTo start, we present a method for animating yarn-level cloth effects using a thin-shell solver.\r\nWe first use a large number of periodic yarn-level simulations to build a model of the potential\r\nenergy density of the cloth, and then use it to compute forces in a thin-shell simulator. The\r\nresulting simulations faithfully reproduce expected effects like the stiffening of woven fabrics\r\nand the highly deformable nature and anisotropy of knitted fabrics at a fraction of the cost of\r\nfull yarn-level simulation.\r\nWhile our thin-shell simulations are able to capture large-scale yarn mechanics, they lack\r\nthe rich visual detail of yarn-level simulations. Therefore, we propose a method to animate\r\nyarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware\r\nfashion in real time. Using triangle strains to interpolate precomputed yarn geometry, we are\r\nable to reproduce effects such as knit loops tightening under stretching at negligible cost.\r\nFinally, we introduce a methodology for inverse-modeling of yarn-level mechanics of cloth,\r\nbased on the mechanical response of fabrics in the real world. We compile a database from\r\nphysical tests of several knitted fabrics used in the textile industry spanning diverse physical\r\nproperties like stiffness, nonlinearity, and anisotropy. We then develop a system for approximating these mechanical responses with yarn-level cloth simulation, using homogenized\r\nshell models to speed up computation and adding some small-but-necessary extensions to\r\nyarn-level models used in computer graphics.\r\n","lang":"eng"}],"article_processing_charge":"No","doi":"10.15479/at:ista:12103","ddc":["000","620"],"ec_funded":1,"date_updated":"2026-06-18T19:57:47Z","has_accepted_license":"1","month":"09","oa":1,"file_date_updated":"2023-02-02T09:39:25Z","oa_version":"Published Version","date_created":"2023-01-24T10:49:46Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"8385"},{"relation":"part_of_dissertation","id":"11736","status":"public"},{"id":"9818","status":"public","relation":"part_of_dissertation"}]},"degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"apa":"Sperl, G. (2022). Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12103","ieee":"G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting,” Institute of Science and Technology Austria, 2022.","chicago":"Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12103.","short":"G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.","ista":"Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria.","mla":"Sperl, Georg. Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12103.","ama":"Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:10.15479/at:ista:12103"},"status":"public","year":"2022","type":"dissertation","language":[{"iso":"eng"}],"file":[{"date_updated":"2023-02-02T09:29:57Z","date_created":"2023-01-25T12:04:41Z","content_type":"application/pdf","relation":"main_file","file_size":104497530,"checksum":"083722acbb8115e52e3b0fdec6226769","file_name":"thesis_gsperl.pdf","creator":"cchlebak","description":"This is the main PDF file of the thesis. File size: 105 MB","file_id":"12371","access_level":"open_access","title":"Thesis"},{"date_updated":"2023-02-02T09:33:37Z","date_created":"2023-02-02T09:33:37Z","content_type":"application/pdf","file_size":23183710,"relation":"main_file","checksum":"511f82025e5fcb70bff4731d6896ca07","file_name":"thesis_gsperl_compressed.pdf","description":"This version of the thesis uses stronger image compression for a smaller file size of 23MB.","creator":"cchlebak","file_id":"12483","access_level":"open_access","title":"Thesis (compressed 23MB)"},{"relation":"source_file","file_size":98382247,"file_name":"thesis-source.zip","checksum":"ed4cb85225eedff761c25bddfc37a2ed","date_created":"2023-02-02T09:39:25Z","date_updated":"2023-02-02T09:39:25Z","content_type":"application/x-zip-compressed","access_level":"open_access","file_id":"12484","creator":"cchlebak"}],"title":"Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting","corr_author":"1","page":"138","date_published":"2022-09-22T00:00:00Z","alternative_title":["ISTA Thesis"],"acknowledged_ssus":[{"_id":"SSU"}],"supervisor":[{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-020-6"]},"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"OA_place":"publisher"},{"date_published":"2022-09-29T00:00:00Z","alternative_title":["ISTA Thesis"],"page":"113","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-025-1 "]},"supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"department":[{"_id":"GradSch"},{"_id":"CaHe"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"NanoFab"}],"OA_place":"publisher","degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9350"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2023-01-25T10:43:24Z","status":"public","citation":{"chicago":"Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12153.","apa":"Arslan, F. N. (2022). Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12153","ieee":"F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical flows,” Institute of Science and Technology Austria, 2022.","mla":"Arslan, Feyza N. Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12153.","ama":"Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical flows. 2022. doi:10.15479/at:ista:12153","short":"F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows, Institute of Science and Technology Austria, 2022.","ista":"Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","type":"dissertation","year":"2022","title":"Remodeling of E-cadherin-mediated contacts via cortical flows","corr_author":"1","language":[{"iso":"eng"}],"file":[{"file_name":"THESIS_FINAL_FArslan_pdfa.pdf","checksum":"e54a3e69b83ebf166544164afd25608e","relation":"main_file","file_size":14581024,"content_type":"application/pdf","date_created":"2023-01-25T10:52:46Z","date_updated":"2023-01-25T10:52:46Z","success":1,"file_id":"12369","access_level":"open_access","creator":"cchlebak"}],"month":"09","date_updated":"2026-06-18T19:47:50Z","has_accepted_license":"1","oa":1,"oa_version":"Published Version","file_date_updated":"2023-01-25T10:52:46Z","day":"29","project":[{"call_identifier":"H2020","grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425"}],"_id":"12368","publication_status":"published","publisher":"Institute of Science and Technology Austria","author":[{"id":"49DA7910-F248-11E8-B48F-1D18A9856A87","last_name":"Arslan","first_name":"Feyza N","full_name":"Arslan, Feyza N","orcid":"0000-0001-5809-9566"}],"article_processing_charge":"No","abstract":[{"text":"Metazoan development relies on the formation and remodeling of cell-cell contacts. The \r\nbinding of adhesion receptors and remodeling of the actomyosin cell cortex at cell-cell \r\ninteraction sites have been implicated in cell-cell contact formation. Yet, how these two \r\nprocesses functionally interact to drive cell-cell contact expansion and strengthening \r\nremains unclear. Here, we study how primary germ layer progenitor cells from zebrafish \r\nbind to supported lipid bilayers (SLB) functionalized with E-cadherin ectodomains as an \r\nassay system for monitoring cell-cell contact formation at high spatiotemporal resolution. \r\nWe show that cell-cell contact formation represents a two-tiered process: E-cadherin\u0002mediated downregulation of the small GTPase RhoA at the forming contact leads to both \r\ndepletion of Myosin-2 and decrease of F-actin. This is followed by centrifugal actin \r\nnetwork flows at the contact triggered by a sharp gradient of Myosin-2 at the rim of the \r\ncontact zone, with Myosin-2 displaying higher cortical localization outside than inside of \r\nthe contact. These centrifugal cortical actin flows, in turn, not only further dilute the actin \r\nnetwork at the contact disc, but also lead to an accumulation of both F-actin and E\u0002cadherin at the contact rim. Eventually, this combination of actomyosin downregulation \r\nand flows at the contact contribute to the characteristic molecular organization implicated \r\nin contact formation and maintenance: depletion of cortical actomyosin at the contact disc, \r\ndriving contact expansion by lowering interfacial tension at the contact, and accumulation \r\nof both E-cadherin and F-actin at the contact rim, mechanically linking the contractile \r\ncortices of the adhering cells. Thus, using a biomimetic assay, we exemplify how \r\nadhesion signaling and cell mechanics function together to modulate the spatial \r\norganization of cell-cell contacts.","lang":"eng"}],"doi":"10.15479/at:ista:12153","ddc":["570"],"ec_funded":1},{"acknowledgement":"This project has received funding from the European Union’s Horizon 2020\r\nresearch and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement No 101034413","month":"12","date_updated":"2025-07-10T11:50:26Z","oa_version":"None","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present CertifyHAM, a deterministic algorithm that takes a graph G as input and either finds a Hamilton cycle of G or outputs that such a cycle does not exist. If G ∼ G(n, p) and p ≥\r\n100 log n/n then the expected running time of CertifyHAM is O(n/p) which is best possible. This improves upon previous results due to Gurevich and Shelah, Thomason and Alon, and\r\nKrivelevich, who proved analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n\r\n−1/2 respectively."}],"doi":"10.1109/FOCS54457.2022.00091","conference":{"end_date":"2022-11-03","name":"FOCS: Foundations of Computer Science","location":"Denver, CO, United States","start_date":"2022-10-31"},"day":"01","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"_id":"12432","publication_status":"published","external_id":{"isi":["000909382900084"]},"author":[{"last_name":"Anastos","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael","full_name":"Anastos, Michael"}],"publisher":"Institute of Electrical and Electronics Engineers","ec_funded":1,"date_published":"2022-12-01T00:00:00Z","page":"919-930","publication_identifier":{"issn":["0272-5428"],"isbn":["9781665455190"]},"department":[{"_id":"MaKw"}],"isi":1,"volume":"2022-October","status":"public","citation":{"chicago":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.","apa":"Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091","ieee":"M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.","mla":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 63rd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.","ama":"Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091","ista":"Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2022–October, 919–930.","short":"M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","quality_controlled":"1","date_created":"2023-01-29T23:00:59Z","title":"Solving the Hamilton cycle problem fast on average","corr_author":"1","publication":"63rd Annual IEEE Symposium on Foundations of Computer Science","language":[{"iso":"eng"}],"type":"conference","year":"2022"},{"doi":"10.1007/978-3-031-22365-5_20","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The homogeneous continuous LWE (hCLWE) problem is to distinguish samples of a specific high-dimensional Gaussian mixture from standard normal samples. It was shown to be at least as hard as Learning with Errors, but no reduction in the other direction is currently known.\r\nWe present four new public-key encryption schemes based on the hardness of hCLWE, with varying tradeoffs between decryption and security errors, and different discretization techniques. Our schemes yield a polynomial-time algorithm for solving hCLWE using a Statistical Zero-Knowledge oracle."}],"day":"21","conference":{"end_date":"2022-11-10","name":"TCC: Theory of Cryptography","location":"Chicago, IL, United States","start_date":"2022-11-07"},"_id":"12516","external_id":{"isi":["000921318200020"]},"author":[{"first_name":"Andrej","full_name":"Bogdanov, Andrej","last_name":"Bogdanov"},{"orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","first_name":"Miguel","last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549","first_name":"Charlotte"},{"full_name":"Rosen, Alon","first_name":"Alon","last_name":"Rosen"}],"publisher":"Springer Nature","publication_status":"published","oa_version":"Preprint","oa":1,"acknowledgement":"We are grateful to Devika Sharma and Luca Trevisan for their insight and advice and to an anonymous reviewer for helpful comments.\r\n\r\nThis work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019547). The first author was additionally supported by RGC GRF CUHK14209920 and the fourth author was additionally supported by ISF grant No. 1399/17, project PROMETHEUS (Grant 780701), and Cariplo CRYPTONOMEX grant.","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/093"}],"month":"12","date_updated":"2024-10-09T21:04:05Z","corr_author":"1","publication":"Theory of Cryptography","title":"Public-Key Encryption from Homogeneous CLWE","language":[{"iso":"eng"}],"type":"conference","year":"2022","status":"public","volume":13748,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” Theory of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.","ama":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous CLWE. In: Theory of Cryptography. Vol 13748. Springer Nature; 2022:565-592. doi:10.1007/978-3-031-22365-5_20","ista":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. 2022. Public-Key Encryption from Homogeneous CLWE. Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 13748, 565–592.","short":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography, Springer Nature, 2022, pp. 565–592.","chicago":"Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.” In Theory of Cryptography, 13748:565–92. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-22365-5_20.","apa":"Bogdanov, A., Cueto Noval, M., Hoffmann, C., & Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature. https://doi.org/10.1007/978-3-031-22365-5_20","ieee":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption from Homogeneous CLWE,” in Theory of Cryptography, Chicago, IL, United States, 2022, vol. 13748, pp. 565–592."},"scopus_import":"1","quality_controlled":"1","date_created":"2023-02-05T23:01:00Z","isi":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031223648"],"issn":["0302-9743"]},"department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"date_published":"2022-12-21T00:00:00Z","page":"565-592","intvolume":" 13748"},{"publication_identifier":{"eisbn":["9783030995270"]},"page":"81-98","alternative_title":["LNCS"],"date_published":"2022-03-29T00:00:00Z","intvolume":" 13244","language":[{"iso":"eng"}],"corr_author":"1","publication":"28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","title":"A direct symbolic algorithm for solving stochastic rabin games","year":"2022","type":"conference","citation":{"short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, in:, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2022, pp. 81–98.","ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2022. A direct symbolic algorithm for solving stochastic rabin games. 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13244, 81–98.","mla":"Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:10.1007/978-3-030-99527-0_5.","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 13244. Springer Nature; 2022:81-98. doi:10.1007/978-3-030-99527-0_5","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-99527-0_5","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Munich, Germany, 2022, vol. 13244, pp. 81–98.","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 13244:81–98. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-99527-0_5."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","volume":13244,"date_created":"2023-02-08T11:43:34Z","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-99527-0_5"}],"date_updated":"2024-10-09T21:04:10Z","month":"03","doi":"10.1007/978-3-030-99527-0_5","abstract":[{"lang":"eng","text":"We consider turn-based stochastic 2-player games on graphs with ω-regular winning conditions. We provide a direct symbolic algorithm for solving such games when the winning condition is formulated as a Rabin condition. For a stochastic Rabin game with k pairs over a game graph with n vertices, our algorithm runs in O(nk+2k!) symbolic steps, which improves the state of the art.\r\nWe have implemented our symbolic algorithm, along with performance optimizations including parallellization and acceleration, in a BDD-based synthesis tool called Fairsyn. We demonstrate the superiority of Fairsyn compared to the state of the art on a set of synthetic benchmarks derived from the VLTS benchmark suite and on a control system benchmark from the literature. In our experiments, Fairsyn performed significantly faster with up to two orders of magnitude improvement in computation time."}],"article_processing_charge":"No","author":[{"last_name":"Banerjee","full_name":"Banerjee, Tamajit","first_name":"Tamajit"},{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"},{"last_name":"Schmuck","first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin"},{"first_name":"Sadegh","full_name":"Soudjani, Sadegh","last_name":"Soudjani"}],"_id":"12529","publisher":"Springer Nature","publication_status":"published","extern":"1","day":"29","conference":{"start_date":"2022-04-02","location":"Munich, Germany","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2022-04-07"}}]