[{"author":[{"orcid":"0000-0002-0346-9125","last_name":"Kumar","first_name":"Roshan","full_name":"Kumar, Roshan","id":"50e95140-3016-11ec-9e1a-881b648a1367"},{"full_name":"Reichelt, Michael","last_name":"Reichelt","first_name":"Michael"},{"full_name":"Bisht, Naveen C.","last_name":"Bisht","first_name":"Naveen C."}],"status":"public","publication":"Biochemical Pathways and Environmental Responses in Plants: Part A","alternative_title":["Methods in Enzymology"],"month":"10","volume":676,"editor":[{"first_name":"Joseph","last_name":"Jez","full_name":"Jez, Joseph"}],"page":"49-69","date_published":"2022-10-21T00:00:00Z","citation":{"ista":"Kumar R, Reichelt M, Bisht NC. 2022.An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In: Biochemical Pathways and Environmental Responses in Plants: Part A. Methods in Enzymology, vol. 676, 49–69.","mla":"Kumar, Roshan, et al. “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis.” <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, edited by Joseph Jez, vol. 676, Elsevier, 2022, pp. 49–69, doi:<a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">10.1016/bs.mie.2022.07.019</a>.","ieee":"R. Kumar, M. Reichelt, and N. C. Bisht, “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis,” in <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, vol. 676, J. Jez, Ed. Elsevier, 2022, pp. 49–69.","short":"R. Kumar, M. Reichelt, N.C. Bisht, in:, J. Jez (Ed.), Biochemical Pathways and Environmental Responses in Plants: Part A, Elsevier, 2022, pp. 49–69.","apa":"Kumar, R., Reichelt, M., &#38; Bisht, N. C. (2022). An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In J. Jez (Ed.), <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i> (Vol. 676, pp. 49–69). Elsevier. <a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">https://doi.org/10.1016/bs.mie.2022.07.019</a>","ama":"Kumar R, Reichelt M, Bisht NC. An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In: Jez J, ed. <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>. Vol 676. Elsevier; 2022:49-69. doi:<a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">10.1016/bs.mie.2022.07.019</a>","chicago":"Kumar, Roshan, Michael Reichelt, and Naveen C. Bisht. “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis.” In <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, edited by Joseph Jez, 676:49–69. Elsevier, 2022. <a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">https://doi.org/10.1016/bs.mie.2022.07.019</a>."},"abstract":[{"text":"Brassicaceae are blessed with specialized metabolites called glucosinolates (GSLs), which along with their degradation products, are beneficial in agriculture and human health. To date, more than 130 GSL structures have been identified, mostly derived from the amino acid methionine. The biosynthesis of methionine-derived aliphatic GSLs starts with a side-chain elongation step involving a recursive three-step cyclic process that incorporates a new methylene group into the 2-oxo acid to form a series of elongated 2-oxo acids. Methylthioalkylmalate synthase (MAMS) catalyzes the first committed step in the side-chain elongation of methionine-derived GSLs. The substrate specificity of MAMS with different 2-oxo acids determines whether reaction products of a given cycle enter for an additional round of chain elongation or enter into core GSLs structure formation. Multiple MAMS encoding genes are present in the Brassicaceae species and are known to play a central role in shaping the diverse profile of aliphatic GSLs. We recently established a highly sensitive LC-MS/MS-based methodology that quantifies the MAMS activity by estimating the amount of the next intermediate of the pathway, the 2-malate derivatives. Overall, this chapter describes the protocol for the expression, purification, and steady-state kinetic analysis of the recombinant MAMS protein.","lang":"eng"}],"intvolume":"       676","date_updated":"2025-07-03T14:02:58Z","publisher":"Elsevier","publication_status":"published","year":"2022","external_id":{"pmid":["36280361"]},"day":"21","pmid":1,"type":"book_chapter","title":"An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9780323955614"],"issn":["0076-6879"]},"language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"None","_id":"12294","doi":"10.1016/bs.mie.2022.07.019","quality_controlled":"1","date_created":"2023-01-16T10:05:13Z"},{"date_published":"2022-10-22T00:00:00Z","abstract":[{"lang":"eng","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."}],"citation":{"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.","ama":"Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In: <i>Financial Cryptography and Data Security</i>. Vol 13411. Springer Nature; 2022:296-315. doi:<a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">10.1007/978-3-031-18283-9_14</a>","chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” In <i>Financial Cryptography and Data Security</i>, 13411:296–315. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">https://doi.org/10.1007/978-3-031-18283-9_14</a>.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang, “Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,” in <i>Financial Cryptography and Data Security</i>, Radisson Grenada Beach Resort, Grenada, 2022, vol. 13411, pp. 296–315.","mla":"Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” <i>Financial Cryptography and Data Security</i>, vol. 13411, Springer Nature, 2022, pp. 296–315, doi:<a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">10.1007/978-3-031-18283-9_14</a>.","short":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, Z. Xiang, in:, Financial Cryptography and Data Security, Springer Nature, 2022, pp. 296–315.","apa":"Gelashvili, R., Kokoris Kogias, E., Sonnino, A., Spiegelman, A., &#38; Xiang, Z. (2022). Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In <i>Financial Cryptography and Data Security</i> (Vol. 13411, pp. 296–315). Radisson Grenada Beach Resort, Grenada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">https://doi.org/10.1007/978-3-031-18283-9_14</a>"},"conference":{"location":"Radisson Grenada Beach Resort, Grenada","name":"FC: Financial Cryptography","start_date":"2022-05-02","end_date":"2022-05-06"},"intvolume":"     13411","date_updated":"2025-09-10T09:52:23Z","status":"public","author":[{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"last_name":"Spiegelman","first_name":"Alexander","full_name":"Spiegelman, Alexander"},{"last_name":"Xiang","first_name":"Zhuolun","full_name":"Xiang, Zhuolun"}],"publication":"Financial Cryptography and Data Security","alternative_title":["LNCS"],"month":"10","volume":13411,"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.","page":"296-315","language":[{"iso":"eng"}],"_id":"12298","scopus_import":"1","oa_version":"Preprint","doi":"10.1007/978-3-031-18283-9_14","quality_controlled":"1","isi":1,"date_created":"2023-01-16T10:05:51Z","department":[{"_id":"ElKo"}],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2106.10362"}],"year":"2022","publication_status":"published","publisher":"Springer Nature","day":"22","external_id":{"arxiv":["2106.10362"],"isi":["001423640200014"]},"oa":1,"type":"conference","article_processing_charge":"No","title":"Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback","arxiv":1,"publication_identifier":{"isbn":["9783031182822"],"eissn":["1611-3349"],"eisbn":["9783031182839"],"issn":["0302-9743"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"doi":"10.1109/sp46214.2022.9833584","_id":"12300","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 t<n/3 malicious nodes and have an expected O(κn3) communication cost, where κ is the security parameter. Our ADKG protocol produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems. We implement our ADKG protocol and evaluate it using a network of up to 128 nodes in geographically distributed AWS instances. Our evaluation shows that our protocol takes as low as 3 and 9.5 seconds to terminate for 32 and 64 nodes, respectively. Also, each node sends only 0.7 Megabytes and 2.9 Megabytes of data during the two experiments, respectively."}],"citation":{"mla":"Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” <i>2022 IEEE Symposium on Security and Privacy</i>, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–34, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>.","ieee":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in <i>2022 IEEE Symposium on Security and Privacy</i>, San Francisco, CA, United States, 2022, pp. 2518–2534.","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.","apa":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., &#38; Ren, L. (2022). Practical asynchronous distributed key generation. In <i>2022 IEEE Symposium on Security and Privacy</i> (pp. 2518–2534). San Francisco, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>","ama":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. Practical asynchronous distributed key generation. In: <i>2022 IEEE Symposium on Security and Privacy</i>. Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>","chicago":"Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In <i>2022 IEEE Symposium on Security and Privacy</i>, 2518–34. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>.","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."},"oa_version":"Preprint","scopus_import":"1","conference":{"end_date":"2022-05-26","start_date":"2022-05-23","location":"San Francisco, CA, United States","name":"SP: Symposium on Security and Privacy"},"date_published":"2022-07-27T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2023-01-16T10:06:11Z","date_updated":"2023-02-16T07:43:53Z","quality_controlled":"1","type":"conference","day":"27","oa":1,"publication":"2022 IEEE Symposium on Security and Privacy","year":"2022","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","status":"public","department":[{"_id":"ElKo"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1591"}],"author":[{"first_name":"Sourav","last_name":"Das","full_name":"Das, Sourav"},{"full_name":"Yurek, Thomas","last_name":"Yurek","first_name":"Thomas"},{"first_name":"Zhuolun","last_name":"Xiang","full_name":"Xiang, Zhuolun"},{"full_name":"Miller, Andrew","last_name":"Miller","first_name":"Andrew"},{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"},{"full_name":"Ren, Ling","first_name":"Ling","last_name":"Ren"}],"page":"2518-2534","publication_identifier":{"eisbn":["9781665413169"],"eissn":["2375-1207"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","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.","title":"Practical asynchronous distributed key generation","month":"07"},{"publication":"Computer Aided Verification","alternative_title":["LNCS"],"author":[{"first_name":"Kyveli","last_name":"Doveri","full_name":"Doveri, Kyveli"},{"full_name":"Ganty, Pierre","first_name":"Pierre","last_name":"Ganty"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"}],"status":"public","file":[{"file_name":"2022_LNCS_Doveri.pdf","success":1,"file_id":"12465","file_size":497682,"content_type":"application/pdf","date_updated":"2023-01-30T12:51:02Z","creator":"dernst","date_created":"2023-01-30T12:51:02Z","access_level":"open_access","relation":"main_file","checksum":"edc363b1be5447a09063e115c247918a"}],"page":"109-129","month":"08","ddc":["000"],"ec_funded":1,"volume":13372,"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.","conference":{"name":"CAV: Computer Aided Verification","location":"Haifa, Israel","end_date":"2022-08-10","start_date":"2022-08-07"},"citation":{"chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In <i>Computer Aided Verification</i>, 13372:109–29. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>.","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: <i>Computer Aided Verification</i>. Vol 13372. Springer Nature; 2022:109-129. doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>","apa":"Doveri, K., Ganty, P., &#38; Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In <i>Computer Aided Verification</i> (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>","mla":"Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” <i>Computer Aided Verification</i>, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>.","short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129.","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in <i>Computer Aided Verification</i>, Haifa, Israel, 2022, vol. 13372, 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."},"abstract":[{"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","lang":"eng"}],"has_accepted_license":"1","date_published":"2022-08-06T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-04-14T07:55:56Z","intvolume":"     13372","oa":1,"external_id":{"isi":["000870310500006"],"arxiv":["2207.13549"]},"day":"06","type":"conference","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","year":"2022","publication_status":"published","arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"isbn":["9783031131875"],"eissn":["1611-3349"],"eisbn":["9783031131882"],"issn":["0302-9743"]},"title":"FORQ-based language inclusion formal testing","article_processing_charge":"No","oa_version":"Published Version","scopus_import":"1","_id":"12302","doi":"10.1007/978-3-031-13188-2_6","language":[{"iso":"eng"}],"file_date_updated":"2023-01-30T12:51:02Z","isi":1,"date_created":"2023-01-16T10:06:31Z","quality_controlled":"1","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}]},{"alternative_title":["Trends in Mathematics"],"publication":"Representation Theory and Algebraic Geometry","author":[{"full_name":"Mirković, Ivan","first_name":"Ivan","last_name":"Mirković"},{"first_name":"Yaping","last_name":"Yang","full_name":"Yang, Yaping"},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","first_name":"Gufang","last_name":"Zhao"}],"status":"public","editor":[{"last_name":"Baranovskky","first_name":"Vladimir","full_name":"Baranovskky, Vladimir"},{"full_name":"Guay, Nicolas","last_name":"Guay","first_name":"Nicolas"},{"last_name":"Schedler","first_name":"Travis","full_name":"Schedler, Travis"}],"page":"347-392","ec_funded":1,"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.","month":"06","citation":{"apa":"Mirković, I., Yang, Y., &#38; Zhao, G. (2022). Loop Grassmannians of Quivers and Affine Quantum Groups. In V. Baranovskky, N. Guay, &#38; T. Schedler (Eds.), <i>Representation Theory and Algebraic Geometry</i> (1st ed., pp. 347–392). Cham: Springer Nature; Birkhäuser. <a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">https://doi.org/10.1007/978-3-030-82007-7_8</a>","ieee":"I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine Quantum Groups,” in <i>Representation Theory and Algebraic Geometry</i>, 1st ed., V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser, 2022, pp. 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.","mla":"Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.” <i>Representation Theory and Algebraic Geometry</i>, edited by Vladimir Baranovskky et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:<a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">10.1007/978-3-030-82007-7_8</a>.","chicago":"Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers and Affine Quantum Groups.” In <i>Representation Theory and Algebraic Geometry</i>, edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92. TM. Cham: Springer Nature; Birkhäuser, 2022. <a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">https://doi.org/10.1007/978-3-030-82007-7_8</a>.","ama":"Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum Groups. In: Baranovskky V, Guay N, Schedler T, eds. <i>Representation Theory and Algebraic Geometry</i>. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392. doi:<a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">10.1007/978-3-030-82007-7_8</a>","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."},"abstract":[{"lang":"eng","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)."}],"date_published":"2022-06-16T00:00:00Z","date_updated":"2025-04-14T09:12:46Z","type":"book_chapter","oa":1,"external_id":{"arxiv":["1810.10095"]},"day":"16","publisher":"Springer Nature; Birkhäuser","year":"2022","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1810.10095","open_access":"1"}],"department":[{"_id":"TaHa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["9783030820077"],"issn":["2297-0215"],"eissn":["2297-024X"],"isbn":["9783030820060"]},"arxiv":1,"title":"Loop Grassmannians of Quivers and Affine Quantum Groups","article_processing_charge":"No","series_title":"TM","doi":"10.1007/978-3-030-82007-7_8","scopus_import":"1","oa_version":"Preprint","_id":"12303","language":[{"iso":"eng"}],"date_created":"2023-01-16T10:06:41Z","place":"Cham","edition":"1","project":[{"call_identifier":"FP7","_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces","grant_number":"320593"}],"quality_controlled":"1"},{"author":[{"full_name":"De Nitti, Nicola","last_name":"De Nitti","first_name":"Nicola"},{"full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L"}],"status":"public","publication":"Communications in Partial Differential Equations","issue":"7","acknowledgement":"N. De Nitti acknowledges the kind hospitality of IST Austria within the framework of the ISTernship Summer Program 2018, during which most of the present article was written. N. DeNitti has received funding by The Austrian Agency for International Cooperation in Education &Research (OeAD-GmbH) via its financial support of the ISTernship Summer Program 2018. N.De Nitti would also like to thank Giuseppe Coclite, Giuseppe Devillanova, Giuseppe Florio, Sebastian Hensel, and Francesco Maddalena for several helpful conversations on topics related to this work.","volume":47,"month":"07","page":"1394-1434","date_published":"2022-07-01T00:00:00Z","corr_author":"1","citation":{"ista":"De Nitti N, Fischer JL. 2022. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. Communications in Partial Differential Equations. 47(7), 1394–1434.","chicago":"De Nitti, Nicola, and Julian L Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/03605302.2022.2056702\">https://doi.org/10.1080/03605302.2022.2056702</a>.","ama":"De Nitti N, Fischer JL. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. <i>Communications in Partial Differential Equations</i>. 2022;47(7):1394-1434. doi:<a href=\"https://doi.org/10.1080/03605302.2022.2056702\">10.1080/03605302.2022.2056702</a>","apa":"De Nitti, N., &#38; Fischer, J. L. (2022). Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/03605302.2022.2056702\">https://doi.org/10.1080/03605302.2022.2056702</a>","mla":"De Nitti, Nicola, and Julian L. Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” <i>Communications in Partial Differential Equations</i>, vol. 47, no. 7, Taylor &#38; Francis, 2022, pp. 1394–434, doi:<a href=\"https://doi.org/10.1080/03605302.2022.2056702\">10.1080/03605302.2022.2056702</a>.","ieee":"N. De Nitti and J. L. Fischer, “Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation,” <i>Communications in Partial Differential Equations</i>, vol. 47, no. 7. Taylor &#38; Francis, pp. 1394–1434, 2022.","short":"N. De Nitti, J.L. Fischer, Communications in Partial Differential Equations 47 (2022) 1394–1434."},"abstract":[{"text":"We establish sharp criteria for the instantaneous propagation of free boundaries in solutions to the thin-film equation. The criteria are formulated in terms of the initial distribution of mass (as opposed to previous almost-optimal results), reflecting the fact that mass is a locally conserved quantity for the thin-film equation. In the regime of weak slippage, our criteria are at the same time necessary and sufficient. The proof of our upper bounds on free boundary propagation is based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial scales: We combine estimates on the local mass and estimates on energies to show that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially smaller space-time cylinder with the same time horizon. The derivation of our lower bounds on free boundary propagation is based on a combination of a monotone quantity and almost optimal estimates established previously by the second author with a new estimate connecting motion of mass to entropy production.","lang":"eng"}],"keyword":["Applied Mathematics","Analysis"],"intvolume":"        47","date_updated":"2024-10-09T21:03:57Z","publisher":"Taylor & Francis","publication_status":"published","year":"2022","department":[{"_id":"JuFi"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1907.05342","open_access":"1"}],"type":"journal_article","oa":1,"day":"01","external_id":{"arxiv":["1907.05342"],"isi":["000805689800001"]},"title":"Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["0360-5302"],"eissn":["1532-4133"]},"arxiv":1,"article_type":"original","language":[{"iso":"eng"}],"doi":"10.1080/03605302.2022.2056702","oa_version":"Preprint","scopus_import":"1","_id":"12304","quality_controlled":"1","date_created":"2023-01-16T10:06:50Z","isi":1},{"date_updated":"2024-10-09T21:03:58Z","keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"intvolume":"        54","corr_author":"1","abstract":[{"text":"This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument.","lang":"eng"}],"citation":{"ista":"Abels H, Moser M. 2022. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 54(1), 114–172.","ieee":"H. Abels and M. Moser, “Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 114–172, 2022.","short":"H. Abels, M. Moser, SIAM Journal on Mathematical Analysis 54 (2022) 114–172.","mla":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 1, Society for Industrial and Applied Mathematics, 2022, pp. 114–72, doi:<a href=\"https://doi.org/10.1137/21m1424925\">10.1137/21m1424925</a>.","apa":"Abels, H., &#38; Moser, M. (2022). Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21m1424925\">https://doi.org/10.1137/21m1424925</a>","ama":"Abels H, Moser M. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(1):114-172. doi:<a href=\"https://doi.org/10.1137/21m1424925\">10.1137/21m1424925</a>","chicago":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21m1424925\">https://doi.org/10.1137/21m1424925</a>."},"date_published":"2022-01-04T00:00:00Z","page":"114-172","volume":54,"month":"01","publication":"SIAM Journal on Mathematical Analysis","issue":"1","author":[{"full_name":"Abels, Helmut","first_name":"Helmut","last_name":"Abels"},{"id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c","full_name":"Moser, Maximilian","last_name":"Moser","first_name":"Maximilian"}],"status":"public","date_created":"2023-01-16T10:07:00Z","isi":1,"quality_controlled":"1","doi":"10.1137/21m1424925","oa_version":"Preprint","scopus_import":"1","_id":"12305","article_type":"original","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"arxiv":1,"title":"Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°","article_processing_charge":"No","type":"journal_article","oa":1,"day":"04","external_id":{"arxiv":["2105.08434"],"isi":["000762768000004"]},"publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","year":"2022","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2105.08434"}],"department":[{"_id":"JuFi"}]},{"status":"public","author":[{"last_name":"Shipman","first_name":"Barbara A.","full_name":"Shipman, Barbara A."},{"orcid":"0000-0002-6862-208X","last_name":"Stephenson","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"}],"issue":"5","publication":"PRIMUS","volume":32,"month":"05","page":"593-609","date_published":"2022-05-28T00:00:00Z","corr_author":"1","abstract":[{"lang":"eng","text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences."}],"citation":{"ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” <i>PRIMUS</i>, vol. 32, no. 5. Taylor &#38; Francis, pp. 593–609, 2022.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>, vol. 32, no. 5, Taylor &#38; Francis, 2022, pp. 593–609, doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>.","apa":"Shipman, B. A., &#38; Stephenson, E. R. (2022). Tangible topology through the lens of limits. <i>PRIMUS</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. <i>PRIMUS</i>. 2022;32(5):593-609. doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>","chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>."},"keyword":["Education","General Mathematics"],"intvolume":"        32","date_updated":"2024-10-09T21:03:58Z","year":"2022","publication_status":"published","publisher":"Taylor & Francis","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"type":"journal_article","day":"28","article_processing_charge":"No","title":"Tangible topology through the lens of limits","publication_identifier":{"issn":["1051-1970"],"eissn":["1935-4053"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","language":[{"iso":"eng"}],"doi":"10.1080/10511970.2021.1872750","_id":"12307","oa_version":"None","scopus_import":"1","quality_controlled":"1","date_created":"2023-01-16T10:07:21Z"},{"citation":{"chicago":"Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>.","ama":"Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. 2022;20(12):e3001889. doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>","apa":"Mlynarski, W. F., &#38; Tkačik, G. (2022). Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>","ieee":"W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional modulation,” <i>PLoS Biology</i>, vol. 20, no. 12. Public Library of Science, p. e3001889, 2022.","short":"W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889.","mla":"Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>, vol. 20, no. 12, Public Library of Science, 2022, p. e3001889, doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>.","ista":"Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 20(12), e3001889."},"abstract":[{"text":"Activity of sensory neurons is driven not only by external stimuli but also by feedback signals from higher brain areas. Attention is one particularly important internal signal whose presumed role is to modulate sensory representations such that they only encode information currently relevant to the organism at minimal cost. This hypothesis has, however, not yet been expressed in a normative computational framework. Here, by building on normative principles of probabilistic inference and efficient coding, we developed a model of dynamic population coding in the visual cortex. By continuously adapting the sensory code to changing demands of the perceptual observer, an attention-like modulation emerges. This modulation can dramatically reduce the amount of neural activity without deteriorating the accuracy of task-specific inferences. Our results suggest that a range of seemingly disparate cortical phenomena such as intrinsic gain modulation, attention-related tuning modulation, and response variability could be manifestations of the same underlying principles, which combine efficient sensory coding with optimal probabilistic inference in dynamic environments.","lang":"eng"}],"has_accepted_license":"1","corr_author":"1","date_published":"2022-12-21T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-06-11T13:57:01Z","intvolume":"        20","publication":"PLoS Biology","issue":"12","author":[{"full_name":"Mlynarski, Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87","last_name":"Mlynarski","first_name":"Wiktor F"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","last_name":"Tkačik","orcid":"1","first_name":"Gašper"}],"status":"public","file":[{"content_type":"application/pdf","file_size":4248838,"file_id":"12337","file_name":"2022_PloSBiology_Mlynarski.pdf","success":1,"checksum":"5d7f1111a87e5f2c1bf92f8886738894","relation":"main_file","date_created":"2023-01-23T08:46:40Z","access_level":"open_access","date_updated":"2023-01-23T08:46:40Z","creator":"dernst"}],"page":"e3001889","month":"12","ddc":["570"],"ec_funded":1,"acknowledgement":"We thank Robbe Goris for generously providing figures from his work and Ann M. Hermundstad for helpful discussions.\r\nGT & WM were supported by the Austrian Science Fund Standalone Grant P 34015 \"Efficient Coding with Biophysical Realism\" (https://pf.fwf.ac.at/) WM was additionally supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (https://ec.europa.eu/research/mariecurieactions/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","volume":20,"scopus_import":"1","oa_version":"Published Version","_id":"12332","doi":"10.1371/journal.pbio.3001889","language":[{"iso":"eng"}],"file_date_updated":"2023-01-23T08:46:40Z","article_type":"original","isi":1,"date_created":"2023-01-22T23:00:55Z","quality_controlled":"1","project":[{"grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","name":"Efficient coding with biophysical realism"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"oa":1,"external_id":{"pmid":["36542662"],"isi":["000925192000001"]},"day":"21","pmid":1,"type":"journal_article","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","year":"2022","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1545-7885"]},"title":"Efficient coding theory of dynamic attentional modulation","article_processing_charge":"No"},{"publisher":"eLife Sciences Publications","year":"2022","publication_status":"published","department":[{"_id":"CaGu"}],"type":"journal_article","oa":1,"day":"22","external_id":{"pmid":["36546673"],"isi":["000912674700001"]},"pmid":1,"title":"Adaptation dynamics between copynumber and point mutations","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2050-084X"]},"article_type":"original","file_date_updated":"2023-01-23T08:56:21Z","language":[{"iso":"eng"}],"doi":"10.7554/ELIFE.82240","oa_version":"Published Version","scopus_import":"1","_id":"12333","quality_controlled":"1","date_created":"2023-01-22T23:00:55Z","isi":1,"author":[{"last_name":"Tomanek","orcid":"0000-0001-6197-363X","first_name":"Isabella","id":"3981F020-F248-11E8-B48F-1D18A9856A87","full_name":"Tomanek, Isabella"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C"}],"status":"public","publication":"eLife","article_number":"e82240","ddc":["570"],"volume":11,"acknowledgement":"We are grateful to N Barton, F Kondrashov, M Lagator, M Pleska, R Roemhild, D Siekhaus, and G\r\nTkacik for input on the manuscript and to K Tomasek for help with flow cytometry.","month":"12","file":[{"success":1,"file_name":"2022_eLife_Tomanek.pdf","file_id":"12338","file_size":8835954,"content_type":"application/pdf","creator":"dernst","date_updated":"2023-01-23T08:56:21Z","access_level":"open_access","date_created":"2023-01-23T08:56:21Z","relation":"main_file","checksum":"9321fd5f06ff59d5e2d33daee84b3da1"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"status":"public","relation":"research_data","id":"12339"}],"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.6974122"}]},"date_published":"2022-12-22T00:00:00Z","has_accepted_license":"1","corr_author":"1","abstract":[{"text":"Together, copy-number and point mutations form the basis for most evolutionary novelty, through the process of gene duplication and divergence. While a plethora of genomic data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic reporter system that can distinguish between copy-number and point mutations, we study their early and transient adaptive dynamics in real time in Escherichia coli. We find two qualitatively different routes of adaptation, depending on the level of functional improvement needed. In conditions of high gene expression demand, the two mutation types occur as a combination. However, under low gene expression demand, copy-number and point mutations are mutually exclusive; here, owing to their higher frequency, adaptation is dominated by copy-number mutations, in a process we term amplification hindrance. Ultimately, due to high reversal rates and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation, but also constrain sequence divergence over evolutionary time scales.","lang":"eng"}],"citation":{"ista":"Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point mutations. eLife. 11, e82240.","apa":"Tomanek, I., &#38; Guet, C. C. (2022). Adaptation dynamics between copynumber and point mutations. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>","ieee":"I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point mutations,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","short":"I. Tomanek, C.C. Guet, ELife 11 (2022).","mla":"Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>, vol. 11, e82240, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>.","chicago":"Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>.","ama":"Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>"},"intvolume":"        11","date_updated":"2025-03-06T14:03:50Z"},{"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"12333"}]},"date_published":"2022-12-23T00:00:00Z","doi":"10.5061/dryad.rfj6q57ds","corr_author":"1","oa_version":"Published Version","_id":"12339","abstract":[{"lang":"eng","text":"Copy-number and point mutations form the basis for most evolutionary novelty through the process of gene duplication and divergence. While a plethora of genomic sequence data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic system that allows us to distinguish copy-number and point mutations, we study their early and transient adaptive dynamics in real-time in Escherichia coli. We find two qualitatively different routes of adaptation depending on the level of functional improvement selected for: In conditions of high gene expression demand, the two types of mutations occur as a combination. Under low gene expression demand, negative epistasis between the two types of mutations renders them mutually exclusive. Thus, owing to their higher frequency, adaptation is dominated by copy-number mutations. Ultimately, due to high rates of reversal and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation but also constrain sequence divergence over evolutionary time scales."}],"citation":{"apa":"Tomanek, I., &#38; Guet, C. C. (2022). Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. Dryad. <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">https://doi.org/10.5061/dryad.rfj6q57ds</a>","ieee":"I. Tomanek and C. C. Guet, “Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose.” Dryad, 2022.","mla":"Tomanek, Isabella, and Calin C. Guet. <i>Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose</i>. Dryad, 2022, doi:<a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>.","short":"I. Tomanek, C.C. Guet, (2022).","chicago":"Tomanek, Isabella, and Calin C Guet. “Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose.” Dryad, 2022. <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">https://doi.org/10.5061/dryad.rfj6q57ds</a>.","ama":"Tomanek I, Guet CC. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. 2022. doi:<a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>","ista":"Tomanek I, Guet CC. 2022. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose, Dryad, <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>."},"date_created":"2023-01-23T09:00:37Z","date_updated":"2025-03-06T14:03:50Z","publisher":"Dryad","year":"2022","author":[{"id":"3981F020-F248-11E8-B48F-1D18A9856A87","full_name":"Tomanek, Isabella","first_name":"Isabella","last_name":"Tomanek","orcid":"0000-0001-6197-363X"},{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052"}],"status":"public","department":[{"_id":"CaGu"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.rfj6q57ds"}],"type":"research_data_reference","oa":1,"day":"23","ddc":["570"],"title":"Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose","article_processing_charge":"No","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"isbn":["9781665455190"],"issn":["0272-5428"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"Solving the Hamilton cycle problem fast on average","external_id":{"isi":["000909382900084"]},"day":"01","type":"conference","department":[{"_id":"MaKw"}],"publication_status":"published","year":"2022","publisher":"Institute of Electrical and Electronics Engineers","isi":1,"date_created":"2023-01-29T23:00:59Z","quality_controlled":"1","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413"}],"_id":"12432","scopus_import":"1","oa_version":"None","doi":"10.1109/FOCS54457.2022.00091","language":[{"iso":"eng"}],"page":"919-930","month":"12","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","volume":"2022-October","ec_funded":1,"publication":"63rd Annual IEEE Symposium on Foundations of Computer Science","status":"public","author":[{"full_name":"Anastos, Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","last_name":"Anastos","first_name":"Michael"}],"date_updated":"2025-07-10T11:50:26Z","abstract":[{"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.","lang":"eng"}],"citation":{"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.","chicago":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">https://doi.org/10.1109/FOCS54457.2022.00091</a>.","ama":"Anastos M. Solving the Hamilton cycle problem fast on average. In: <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:<a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">10.1109/FOCS54457.2022.00091</a>","apa":"Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">https://doi.org/10.1109/FOCS54457.2022.00091</a>","ieee":"M. Anastos, “Solving the Hamilton cycle problem fast on average,” in <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, Denver, CO, United States, 2022, vol. 2022–October, pp. 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.","mla":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:<a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">10.1109/FOCS54457.2022.00091</a>."},"conference":{"start_date":"2022-10-31","end_date":"2022-11-03","name":"FOCS: Foundations of Computer Science","location":"Denver, CO, United States"},"corr_author":"1","date_published":"2022-12-01T00:00:00Z"},{"scopus_import":"1","oa_version":"Published Version","_id":"12452","file_date_updated":"2023-01-30T10:48:37Z","language":[{"iso":"eng"}],"date_created":"2023-01-30T10:47:06Z","quality_controlled":"1","type":"conference","oa":1,"day":"01","publisher":"British Machine Vision Association and Society for Pattern Recognition","publication_status":"published","year":"2022","department":[{"_id":"BeBi"}],"main_file_link":[{"url":"https://bmvc2022.mpi-inf.mpg.de/708/","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"VoRF: Volumetric Relightable Faces","article_processing_charge":"No","has_accepted_license":"1","conference":{"end_date":"2022-11-24","start_date":"2022-11-21","location":"London, United Kingdom","name":"BMVC: British Machine Vision Conference"},"citation":{"ista":"Rao P, B R M, Fox G, Weyrich T, Bickel B, Seidel H-P, Pfister H, Matusik W, Tewari A, Theobalt C, Elgharib M. 2022. VoRF: Volumetric Relightable Faces. 33rd British Machine Vision Conference. BMVC: British Machine Vision Conference, 708.","apa":"Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib, M. (2022). VoRF: Volumetric Relightable Faces. In <i>33rd British Machine Vision Conference</i>. London, United Kingdom: British Machine Vision Association and Society for Pattern Recognition.","ieee":"P. Rao <i>et al.</i>, “VoRF: Volumetric Relightable Faces,” in <i>33rd British Machine Vision Conference</i>, London, United Kingdom, 2022.","mla":"Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” <i>33rd British Machine Vision Conference</i>, 708, British Machine Vision Association and Society for Pattern Recognition, 2022.","short":"P. Rao, M. B R, G. Fox, T. Weyrich, B. Bickel, H.-P. Seidel, H. Pfister, W. Matusik, A. Tewari, C. Theobalt, M. Elgharib, in:, 33rd British Machine Vision Conference, British Machine Vision Association and Society for Pattern Recognition, 2022.","chicago":"Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In <i>33rd British Machine Vision Conference</i>. British Machine Vision Association and Society for Pattern Recognition, 2022.","ama":"Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: <i>33rd British Machine Vision Conference</i>. British Machine Vision Association and Society for Pattern Recognition; 2022."},"abstract":[{"text":"Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handing both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with separate latent spaces for identity and illumination. The prior model is learnt in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis even when applied to unseen subjects under uncontrolled illuminations.","lang":"eng"}],"date_published":"2022-12-01T00:00:00Z","date_updated":"2023-10-31T08:40:55Z","publication":"33rd British Machine Vision Conference","author":[{"last_name":"Rao","first_name":"Pramod","full_name":"Rao, Pramod"},{"full_name":"B R, Mallikarjun","first_name":"Mallikarjun","last_name":"B R"},{"last_name":"Fox","first_name":"Gereon","full_name":"Fox, Gereon"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"last_name":"Seidel","first_name":"Hans-Peter","full_name":"Seidel, Hans-Peter"},{"full_name":"Pfister, Hanspeter","last_name":"Pfister","first_name":"Hanspeter"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"first_name":"Ayush","last_name":"Tewari","full_name":"Tewari, Ayush"},{"first_name":"Christian","last_name":"Theobalt","full_name":"Theobalt, Christian"},{"last_name":"Elgharib","first_name":"Mohamed","full_name":"Elgharib, Mohamed"}],"status":"public","file":[{"file_name":"vorf_main.pdf","file_id":"12453","file_size":5202710,"content_type":"application/pdf","creator":"bbickel","date_updated":"2023-01-30T10:48:18Z","access_level":"open_access","date_created":"2023-01-30T10:48:18Z","relation":"main_file","checksum":"b60b70bb48700aee709c85a69231821d","title":"VoRF: Volumetric Relightable Faces"},{"file_size":37953188,"content_type":"application/pdf","file_name":"vorf_supp.pdf","file_id":"12454","relation":"supplementary_material","checksum":"ce5f4ce66eaaa1590ee5df989fca6f61","title":"VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –","creator":"bbickel","date_updated":"2023-01-30T10:48:29Z","access_level":"open_access","date_created":"2023-01-30T10:48:29Z"},{"file_size":57855492,"content_type":"video/mp4","file_name":"video.mp4","file_id":"12455","relation":"supplementary_material","checksum":"08aecca434b08fee75ee1efe87943718","creator":"bbickel","date_updated":"2023-01-30T10:48:37Z","access_level":"open_access","date_created":"2023-01-30T10:48:37Z"}],"article_number":"708","ddc":["000"],"acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784).","month":"12"},{"month":"11","acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions.\r\nM Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC Grant\r\nEP/N510129/1.","volume":2022,"article_number":"114003","ddc":["510","530"],"file":[{"creator":"dernst","date_updated":"2023-02-02T08:35:52Z","access_level":"open_access","date_created":"2023-02-02T08:35:52Z","relation":"main_file","checksum":"01411ffa76d3e380a0446baeb89b1ef7","success":1,"file_name":"2022_JourStatisticalMechanics_Mondelli.pdf","file_id":"12481","file_size":1729997,"content_type":"application/pdf"}],"status":"public","author":[{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"last_name":"Venkataramanan","first_name":"Ramji","full_name":"Venkataramanan, Ramji"}],"issue":"11","publication":"Journal of Statistical Mechanics: Theory and Experiment","intvolume":"      2022","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability","Statistical and Nonlinear Physics"],"date_updated":"2025-04-15T07:50:16Z","date_published":"2022-11-24T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10598"}]},"abstract":[{"text":"We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach.","lang":"eng"}],"citation":{"ista":"Mondelli M, Venkataramanan R. 2022. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022(11), 114003.","apa":"Mondelli, M., &#38; Venkataramanan, R. (2022). Approximate message passing with spectral initialization for generalized linear models. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/ac9828\">https://doi.org/10.1088/1742-5468/ac9828</a>","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2022, no. 11, 114003, IOP Publishing, 2022, doi:<a href=\"https://doi.org/10.1088/1742-5468/ac9828\">10.1088/1742-5468/ac9828</a>.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2022, no. 11. IOP Publishing, 2022.","short":"M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory and Experiment 2022 (2022).","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2022. <a href=\"https://doi.org/10.1088/1742-5468/ac9828\">https://doi.org/10.1088/1742-5468/ac9828</a>.","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2022;2022(11). doi:<a href=\"https://doi.org/10.1088/1742-5468/ac9828\">10.1088/1742-5468/ac9828</a>"},"has_accepted_license":"1","corr_author":"1","article_processing_charge":"Yes (via OA deal)","title":"Approximate message passing with spectral initialization for generalized linear models","publication_identifier":{"issn":["1742-5468"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaMo"}],"year":"2022","publication_status":"published","publisher":"IOP Publishing","external_id":{"isi":["000889589900001"]},"day":"24","oa":1,"type":"journal_article","quality_controlled":"1","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"isi":1,"date_created":"2023-02-02T08:31:57Z","file_date_updated":"2023-02-02T08:35:52Z","language":[{"iso":"eng"}],"article_type":"original","_id":"12480","oa_version":"Published Version","scopus_import":"1","doi":"10.1088/1742-5468/ac9828"},{"acknowledged_ssus":[{"_id":"ScienComp"}],"_id":"12495","oa_version":"Published Version","article_type":"original","language":[{"iso":"eng"}],"file_date_updated":"2023-02-23T10:30:04Z","date_created":"2023-02-02T20:29:57Z","project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"quality_controlled":"1","type":"journal_article","external_id":{"arxiv":["2106.11732"]},"day":"22","oa":1,"year":"2022","publication_status":"published","publisher":"ML Research Press","department":[{"_id":"ChLa"}],"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=XsPopigZXV"}],"publication_identifier":{"issn":["2835-8856"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"article_processing_charge":"No","title":"FLEA: Provably robust fair multisource learning from unreliable training data","has_accepted_license":"1","corr_author":"1","abstract":[{"lang":"eng","text":"Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of\r\nmachine learning with far-reaching societal impact. However, existing fair learning methods\r\nare vulnerable to accidental or malicious artifacts in the training data, which can cause\r\nthem to unknowingly produce unfair classifiers. In this work we address the problem of\r\nfair learning from unreliable training data in the robust multisource setting, where the\r\navailable training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat identifies and suppresses those data sources that would have a negative impact on\r\nfairness or accuracy if they were used for training. As such, FLEA is not a replacement of\r\nprior fairness-aware learning methods but rather an augmentation that makes any of them\r\nrobust against unreliable training data. We show the effectiveness of our approach by a\r\ndiverse range of experiments on multiple datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects the learner against corruptions as long as the fraction of\r\naffected data sources is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA."}],"citation":{"ista":"Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research.","short":"E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).","ieee":"E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2022.","mla":"Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2022.","apa":"Iofinova, E. B., Konstantinov, N. H., &#38; Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. <i>Transactions on Machine Learning Research</i>. ML Research Press.","ama":"Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. <i>Transactions on Machine Learning Research</i>. 2022.","chicago":"Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2022."},"related_material":{"link":[{"description":"source code","relation":"software","url":"https://github.com/ISTAustria-CVML/FLEA"}]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2022-12-22T00:00:00Z","date_updated":"2025-12-30T11:04:31Z","publication":"Transactions on Machine Learning Research","status":"public","author":[{"full_name":"Iofinova, Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","last_name":"Iofinova","orcid":"0000-0002-7778-3221","first_name":"Eugenia B"},{"first_name":"Nikola H","orcid":"0009-0009-5204-7621","last_name":"Konstantinov","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_id":"12673","success":1,"file_name":"2022_TMLR_Iofinova.pdf","content_type":"application/pdf","file_size":1948063,"access_level":"open_access","date_created":"2023-02-23T10:30:04Z","creator":"dernst","date_updated":"2023-02-23T10:30:04Z","checksum":"97c8a8470759cab597abb973ca137a3b","relation":"main_file"}],"acknowledgement":"The authors would like to thank Bernd Prach, Elias Frantar, Alexandra Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). This publication was made possible by an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. ","ddc":["000"],"month":"12"},{"_id":"12508","oa_version":"Published Version","scopus_import":"1","doi":"10.4230/LIPIcs.CONCUR.2022.14","file_date_updated":"2023-02-06T09:21:09Z","language":[{"iso":"eng"}],"date_created":"2023-02-05T17:24:23Z","quality_controlled":"1","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"day":"06","oa":1,"type":"conference","department":[{"_id":"ToHe"}],"year":"2022","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772464"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"History-deterministic timed automata","abstract":[{"lang":"eng","text":"We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states."}],"citation":{"ista":"Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21.","ama":"Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: <i>33rd International Conference on Concurrency Theory</i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>","chicago":"Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In <i>33rd International Conference on Concurrency Theory</i>, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>.","ieee":"T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in <i>33rd International Conference on Concurrency Theory</i>, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.","mla":"Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” <i>33rd International Conference on Concurrency Theory</i>, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>.","short":"T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21.","apa":"Henzinger, T. A., Lehtinen, K., &#38; Totzke, P. (2022). History-deterministic timed automata. In <i>33rd International Conference on Concurrency Theory</i> (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>"},"conference":{"end_date":"2022-09-16","start_date":"2022-09-13","location":"Warsaw, Poland","name":"CONCUR: Conference on Concurrency Theory"},"has_accepted_license":"1","corr_author":"1","date_published":"2022-09-06T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"id":"18530","relation":"later_version","status":"public"}]},"date_updated":"2025-09-08T14:35:16Z","intvolume":"       243","publication":"33rd International Conference on Concurrency Theory","alternative_title":["LIPIcs"],"status":"public","author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karoliina","last_name":"Lehtinen","full_name":"Lehtinen, Karoliina"},{"full_name":"Totzke, Patrick","last_name":"Totzke","first_name":"Patrick"}],"file":[{"success":1,"file_name":"2022_LIPICs_Henzinger2.pdf","file_id":"12520","file_size":717940,"content_type":"application/pdf","creator":"dernst","date_updated":"2023-02-06T09:21:09Z","date_created":"2023-02-06T09:21:09Z","access_level":"open_access","relation":"main_file","checksum":"9e97e15628f66b2ad77f535bb0327dee"}],"page":"14:1-14:21","month":"09","ec_funded":1,"acknowledgement":"Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n","volume":243,"ddc":["000"]},{"project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","date_created":"2023-02-05T17:26:01Z","place":"Dagstuhl, Germany","language":[{"iso":"eng"}],"file_date_updated":"2023-02-06T09:13:04Z","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.MFCS.2022.3","scopus_import":"1","oa_version":"Published Version","_id":"12509","title":"An updated survey of bidding games on graphs","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9783959772563"],"issn":["1868-8969"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2022","department":[{"_id":"ToHe"}],"type":"conference","oa":1,"day":"22","intvolume":"       241","date_updated":"2025-07-10T11:50:27Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2022-08-22T00:00:00Z","corr_author":"1","has_accepted_license":"1","conference":{"end_date":"2022-08-26","start_date":"2022-08-22","name":"MFCS: Mathematical Foundations of Computer Science","location":"Vienna, Austria"},"citation":{"mla":"Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>.","short":"G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.","ieee":"G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.","apa":"Avni, G., &#38; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In <i>47th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>","ama":"Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: <i>47th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>","chicago":"Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>.","ista":"Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6."},"abstract":[{"text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games.","lang":"eng"}],"ddc":["000"],"ec_funded":1,"acknowledgement":"Guy Avni: Work partially supported by the Israel Science Foundation, ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","volume":241,"month":"08","page":"3:1-3:6","file":[{"file_id":"12519","success":1,"file_name":"2022_LIPICs_Avni.pdf","content_type":"application/pdf","file_size":624586,"date_created":"2023-02-06T09:13:04Z","access_level":"open_access","creator":"dernst","date_updated":"2023-02-06T09:13:04Z","checksum":"1888ec9421622f9526fbec2de035f132","relation":"main_file"}],"author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"status":"public","publication":"47th International Symposium on Mathematical Foundations of Computer Science"},{"page":"6755-6764","volume":36,"acknowledgement":"SG is funded by the Austrian Science Fund (FWF) project number W1255-N23. ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).","ec_funded":1,"month":"06","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","issue":"6","status":"public","author":[{"first_name":"Sophie A.","last_name":"Gruenbacher","full_name":"Gruenbacher, Sophie A."},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Smolka, Scott A.","last_name":"Smolka","first_name":"Scott A."},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"date_updated":"2025-04-15T06:26:14Z","keyword":["General Medicine"],"intvolume":"        36","citation":{"ista":"Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu R. 2022. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764.","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., &#38; Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>","short":"S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764.","ieee":"S. A. Gruenbacher <i>et al.</i>, “GoTube: Scalable statistical verification of continuous-depth models,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>.","chicago":"Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>.","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(6):6755-6764. doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>"},"abstract":[{"lang":"eng","text":"We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.\r\n GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible."}],"date_published":"2022-06-28T00:00:00Z","publication_identifier":{"isbn":["978577358350"],"issn":["2159-5399"],"eissn":["2374-3468"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"article_processing_charge":"No","title":"GoTube: Scalable statistical verification of continuous-depth models","type":"journal_article","external_id":{"arxiv":["2107.08467"]},"day":"28","oa":1,"year":"2022","publication_status":"published","publisher":"Association for the Advancement of Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.08467"}],"department":[{"_id":"ToHe"}],"date_created":"2023-02-05T17:27:42Z","project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"quality_controlled":"1","doi":"10.1609/aaai.v36i6.20631","_id":"12510","oa_version":"Preprint","scopus_import":"1","article_type":"original","language":[{"iso":"eng"}]},{"_id":"12516","scopus_import":"1","oa_version":"Preprint","doi":"10.1007/978-3-031-22365-5_20","language":[{"iso":"eng"}],"isi":1,"date_created":"2023-02-05T23:01:00Z","quality_controlled":"1","day":"21","external_id":{"isi":["000921318200020"]},"oa":1,"type":"conference","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/093"}],"department":[{"_id":"KrPi"}],"publication_status":"published","year":"2022","publisher":"Springer Nature","publication_identifier":{"isbn":["9783031223648"],"issn":["0302-9743"],"eissn":["1611-3349"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","title":"Public-Key Encryption from Homogeneous CLWE","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."}],"citation":{"mla":"Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” <i>Theory of Cryptography</i>, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:<a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">10.1007/978-3-031-22365-5_20</a>.","short":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography, Springer Nature, 2022, pp. 565–592.","ieee":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption from Homogeneous CLWE,” in <i>Theory of Cryptography</i>, Chicago, IL, United States, 2022, vol. 13748, pp. 565–592.","apa":"Bogdanov, A., Cueto Noval, M., Hoffmann, C., &#38; Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In <i>Theory of Cryptography</i> (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">https://doi.org/10.1007/978-3-031-22365-5_20</a>","ama":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous CLWE. In: <i>Theory of Cryptography</i>. Vol 13748. Springer Nature; 2022:565-592. doi:<a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">10.1007/978-3-031-22365-5_20</a>","chicago":"Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.” In <i>Theory of Cryptography</i>, 13748:565–92. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">https://doi.org/10.1007/978-3-031-22365-5_20</a>.","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."},"conference":{"name":"TCC: Theory of Cryptography","location":"Chicago, IL, United States","start_date":"2022-11-07","end_date":"2022-11-10"},"corr_author":"1","date_published":"2022-12-21T00:00:00Z","date_updated":"2024-10-09T21:04:05Z","intvolume":"     13748","publication":"Theory of Cryptography","alternative_title":["LNCS"],"status":"public","author":[{"full_name":"Bogdanov, Andrej","first_name":"Andrej","last_name":"Bogdanov"},{"last_name":"Cueto Noval","orcid":"0000-0002-2505-4246","first_name":"Miguel","full_name":"Cueto Noval, Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"first_name":"Charlotte","last_name":"Hoffmann","orcid":"0000-0003-2027-5549","full_name":"Hoffmann, Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"full_name":"Rosen, Alon","last_name":"Rosen","first_name":"Alon"}],"page":"565-592","month":"12","volume":13748,"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."},{"date_published":"2022-03-29T00:00:00Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Munich, Germany","start_date":"2022-04-02","end_date":"2022-04-07"},"citation":{"mla":"Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">10.1007/978-3-030-99527-0_5</a>.","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Munich, Germany, 2022, vol. 13244, pp. 81–98.","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.","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &#38; Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">https://doi.org/10.1007/978-3-030-99527-0_5</a>","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 13244. Springer Nature; 2022:81-98. doi:<a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">10.1007/978-3-030-99527-0_5</a>","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 13244:81–98. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">https://doi.org/10.1007/978-3-030-99527-0_5</a>.","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."},"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."}],"corr_author":"1","intvolume":"     13244","extern":"1","date_updated":"2024-10-09T21:04:10Z","author":[{"full_name":"Banerjee, Tamajit","first_name":"Tamajit","last_name":"Banerjee"},{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Mallik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"status":"public","publication":"28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","alternative_title":["LNCS"],"month":"03","volume":13244,"page":"81-98","language":[{"iso":"eng"}],"oa_version":"Published Version","scopus_import":"1","_id":"12529","doi":"10.1007/978-3-030-99527-0_5","quality_controlled":"1","date_created":"2023-02-08T11:43:34Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-99527-0_5"}],"publisher":"Springer Nature","publication_status":"published","year":"2022","oa":1,"day":"29","type":"conference","title":"A direct symbolic algorithm for solving stochastic rabin games","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["9783030995270"]}}]