[{"department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2021-08-11T00:00:00Z","date_created":"2021-09-23T14:06:15Z","main_file_link":[{"url":"https://eprint.iacr.org/2021/945","open_access":"1"}],"intvolume":"     12826","publisher":"Springer Nature","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","oa":1,"alternative_title":["LCNS"],"year":"2021","publication":"41st Annual International Cryptology Conference, Part II ","date_updated":"2023-09-07T13:32:11Z","related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"page":"486-515","day":"11","citation":{"mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” <i>41st Annual International Cryptology Conference, Part II </i>, vol. 12826, Springer Nature, 2021, pp. 486–515, doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual International Cryptology Conference, Part II </i>, 12826:486–515. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference, Part II </i>. Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology Conference, Part II </i>, Virtual, 2021, vol. 12826, pp. 486–515.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology Conference, Part II </i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>"},"month":"08","conference":{"start_date":"2021-08-16","location":"Virtual","end_date":"2021-08-20","name":"CRYPTO: Annual International Cryptology Conference"},"oa_version":"Preprint","article_processing_charge":"No","volume":12826,"author":[{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Klein","full_name":"Klein, Karen","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"last_name":"Wichs","full_name":"Wichs, Daniel","first_name":"Daniel"}],"title":"Limits on the Adaptive Security of Yao’s Garbling","_id":"10041","abstract":[{"lang":"eng","text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth   δ , the loss in security is at most exponential in   δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth  δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in   δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security."}],"doi":"10.1007/978-3-030-84245-1_17","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-84245-1"],"isbn":["978-3-030-84244-4"]},"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","status":"public","publication_status":"published","ec_funded":1,"place":"Cham"},{"_id":"10044","oa":1,"title":"On treewidth, separators and Yao's garbling","author":[{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen","last_name":"Klein"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"}],"abstract":[{"text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.","lang":"eng"}],"year":"2021","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-09-07T13:32:11Z","publication":"19th Theory of Cryptography Conference 2021","article_number":"2021/926","ec_funded":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"10409"},{"id":"10035","status":"public","relation":"dissertation_contains"}]},"status":"public","acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling.  ","publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"07","citation":{"chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research, 2021.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” <i>19th Theory of Cryptography Conference 2021</i>, 2021/926, International Association for Cryptologic Research, 2021.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in <i>19th Theory of Cryptography Conference 2021</i>, Raleigh, NC, United States, 2021.","apa":"Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In <i>19th Theory of Cryptography Conference 2021</i>. Raleigh, NC, United States: International Association for Cryptologic Research.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research; 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021."},"department":[{"_id":"KrPi"}],"day":"08","date_created":"2021-09-24T12:01:34Z","oa_version":"Preprint","conference":{"start_date":"2021-11-08","location":"Raleigh, NC, United States","end_date":"2021-11-11","name":"TCC: Theory of Cryptography Conference"},"date_published":"2021-07-08T00:00:00Z","publisher":"International Association for Cryptologic Research","main_file_link":[{"url":"https://eprint.iacr.org/2021/926","open_access":"1"}],"article_processing_charge":"No","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1"},{"publication":"arXiv","date_updated":"2023-05-03T10:40:16Z","article_number":"2109.10203","oa":1,"year":"2021","keyword":["minimum 0-extension problem","metric labeling problem","discrete metric spaces","metric extensions","computational complexity","valued constraint satisfaction problems","discrete convex analysis","L-convex functions"],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2109.10203","open_access":"1"}],"type":"preprint","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2109.10203"]},"date_published":"2021-09-21T00:00:00Z","date_created":"2021-09-27T10:48:23Z","status":"public","publication_status":"submitted","author":[{"last_name":"Dvorak","full_name":"Dvorak, Martin","first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"title":"Generalized minimum 0-extension problem and discrete convexity","_id":"10045","abstract":[{"text":"Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n","lang":"eng"}],"doi":"10.48550/arXiv.2109.10203","arxiv":1,"file":[{"file_id":"10046","date_created":"2021-09-27T10:54:51Z","access_level":"open_access","checksum":"e7e83065f7bc18b9c188bf93b5ca5db6","content_type":"application/pdf","success":1,"date_updated":"2021-09-27T10:54:51Z","file_name":"Generalized-0-Ext.pdf","relation":"main_file","creator":"mdvorak","file_size":603672}],"has_accepted_license":"1","article_processing_charge":"No","day":"21","citation":{"ama":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2109.10203\">10.48550/arXiv.2109.10203</a>","ista":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. arXiv, 2109.10203.","short":"M. Dvorak, V. Kolmogorov, ArXiv (n.d.).","apa":"Dvorak, M., &#38; Kolmogorov, V. (n.d.). Generalized minimum 0-extension problem and discrete convexity. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2109.10203\">https://doi.org/10.48550/arXiv.2109.10203</a>","ieee":"M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” <i>arXiv</i>. .","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>ArXiv</i>, 2109.10203, doi:<a href=\"https://doi.org/10.48550/arXiv.2109.10203\">10.48550/arXiv.2109.10203</a>.","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2109.10203\">https://doi.org/10.48550/arXiv.2109.10203</a>."},"ddc":["004"],"file_date_updated":"2021-09-27T10:54:51Z","month":"09","oa_version":"Preprint"},{"article_processing_charge":"No","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"International Association for Cryptologic Research","main_file_link":[{"url":"https://ia.cr/2021/059","open_access":"1"}],"date_created":"2021-09-27T12:52:05Z","oa_version":"Preprint","conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2021-11-11","start_date":"2021-11-08","location":"Raleigh, NC, United States"},"date_published":"2021-07-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","citation":{"mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” <i>19th Theory of Cryptography Conference 2021</i>, International Association for Cryptologic Research, 2021.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research, 2021.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in <i>19th Theory of Cryptography Conference 2021</i>, Raleigh, NC, United States, 2021.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2021). The cost of adaptivity in security games on graphs. In <i>19th Theory of Cryptography Conference 2021</i>. Raleigh, NC, United States: International Association for Cryptologic Research.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research; 2021.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference."},"day":"08","department":[{"_id":"KrPi"}],"related_material":{"record":[{"id":"10410","relation":"later_version","status":"public"},{"relation":"dissertation_contains","status":"public","id":"10035"}]},"status":"public","publication_status":"published","date_updated":"2023-10-17T09:24:08Z","publication":"19th Theory of Cryptography Conference 2021","abstract":[{"lang":"eng","text":"The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical\r\nframework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower\r\nbounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and\r\nbroadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques.\r\n"}],"year":"2021","_id":"10048","oa":1,"title":"The cost of adaptivity in security games on graphs","author":[{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482"}]},{"date_published":"2021-08-26T00:00:00Z","date_created":"2021-09-27T13:46:27Z","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"IEEE","main_file_link":[{"url":"https://eprint.iacr.org/2019/1489","open_access":"1"}],"year":"2021","oa":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10035"}]},"page":"268-284","publication":"2021 IEEE Symposium on Security and Privacy ","date_updated":"2023-09-07T13:32:11Z","oa_version":"Preprint","conference":{"end_date":"2021-05-27","start_date":"2021-05-24","location":"San Francisco, CA, United States","name":"SP: Symposium on Security and Privacy"},"citation":{"chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In <i>2021 IEEE Symposium on Security and Privacy </i>, 268–84. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>.","mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” <i>2021 IEEE Symposium on Security and Privacy </i>, IEEE, 2021, pp. 268–84, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>.","ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: <i>2021 IEEE Symposium on Security and Privacy </i>. IEEE; 2021:268-284. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>","ieee":"K. Klein <i>et al.</i>, “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in <i>2021 IEEE Symposium on Security and Privacy </i>, San Francisco, CA, United States, 2021, pp. 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In <i>2021 IEEE Symposium on Security and Privacy </i> (pp. 268–284). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>"},"day":"26","month":"08","article_processing_charge":"No","abstract":[{"text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open.","lang":"eng"}],"doi":"10.1109/sp40001.2021.00035","title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","author":[{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"},{"orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo"},{"orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","full_name":"Walter, Michael"},{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Margarita","full_name":"Capretto, Margarita","last_name":"Capretto"},{"first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"full_name":"Markov, Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia"},{"first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","full_name":"Yeo, Michelle X"},{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"_id":"10049","status":"public","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","publication_status":"published","ec_funded":1,"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}]},{"date_updated":"2023-08-14T06:56:30Z","publication":"Journal of Neuroscience","article_type":"original","page":"7742-7767","oa":1,"year":"2021","intvolume":"        41","publisher":"Society for Neuroscience","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"RySh"}],"scopus_import":"1","date_created":"2021-09-27T14:33:13Z","date_published":"2021-09-15T00:00:00Z","external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"publication_status":"published","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","status":"public","_id":"10051","author":[{"first_name":"Tanvi","last_name":"Butola","full_name":"Butola, Tanvi"},{"first_name":"Theocharis","last_name":"Alvanos","full_name":"Alvanos, Theocharis"},{"first_name":"Anika","last_name":"Hintze","full_name":"Hintze, Anika"},{"orcid":"0000-0002-3509-1948","first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","last_name":"Koppensteiner","full_name":"Koppensteiner, Peter"},{"last_name":"Kleindienst","full_name":"Kleindienst, David","first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444"},{"full_name":"Wichmann, Carolin","last_name":"Wichmann","first_name":"Carolin"},{"full_name":"Moser, Tobias","last_name":"Moser","first_name":"Tobias"}],"title":"RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse","doi":"10.1523/JNEUROSCI.0586-21.2021","issue":"37","abstract":[{"text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization.","lang":"eng"}],"file":[{"file_size":11571961,"relation":"main_file","creator":"dernst","file_name":"2021_JourNeuroscience_Butola.pdf","date_updated":"2022-05-31T09:10:15Z","success":1,"content_type":"application/pdf","checksum":"769ab627c7355a50ccfd445e43a5f351","access_level":"open_access","date_created":"2022-05-31T09:10:15Z","file_id":"11423"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":41,"article_processing_charge":"No","has_accepted_license":"1","pmid":1,"month":"09","ddc":["570"],"file_date_updated":"2022-05-31T09:10:15Z","day":"15","citation":{"chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2021. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>.","mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>.","ieee":"T. Butola <i>et al.</i>, “RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” <i>Journal of Neuroscience</i>, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. 2021;41(37):7742-7767. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767."},"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/"},{"date_created":"2021-09-27T14:33:14Z","scopus_import":"1","date_published":"2021-08-13T00:00:00Z","external_id":{"arxiv":["2107.04683"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","intvolume":"       203","year":"2021","alternative_title":["LIPIcs"],"oa":1,"article_number":"18","date_updated":"2022-05-13T08:12:52Z","publication":"32nd International Conference on Concurrency Theory","oa_version":"Published Version","conference":{"start_date":"2021-08-23","location":"Paris, France","end_date":"2021-08-27","name":"CONCUR: Conference on Concurrency Theory"},"ddc":["000"],"month":"08","file_date_updated":"2021-10-01T11:10:53Z","citation":{"ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in <i>32nd International Conference on Concurrency Theory</i>, Paris, France, 2021, vol. 203.","apa":"Jecker, I. R., Mazzocchi, N., &#38; Wolf, P. (2021). Decomposing permutation automata. In <i>32nd International Conference on Concurrency Theory</i> (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: <i>32nd International Conference on Concurrency Theory</i>. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In <i>32nd International Conference on Concurrency Theory</i>, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>.","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” <i>32nd International Conference on Concurrency Theory</i>, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>."},"day":"13","article_processing_charge":"No","volume":203,"has_accepted_license":"1","file":[{"date_created":"2021-10-01T11:10:53Z","file_id":"10064","content_type":"application/pdf","checksum":"4722c81be82265cf45e78adf9db91250","access_level":"open_access","date_updated":"2021-10-01T11:10:53Z","success":1,"file_size":1003552,"creator":"cchlebak","relation":"main_file","file_name":"2021_CONCUR_Jecker.pdf"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"doi":"10.4230/LIPIcs.CONCUR.2021.18","abstract":[{"lang":"eng","text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet."}],"_id":"10052","title":"Decomposing permutation automata","author":[{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"first_name":"Nicolas","full_name":"Mazzocchi, Nicolas","last_name":"Mazzocchi"},{"full_name":"Wolf, Petra","last_name":"Wolf","first_name":"Petra"}],"ec_funded":1,"acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","publication_status":"published","status":"public","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]}},{"date_published":"2021-09-01T00:00:00Z","external_id":{"isi":["000701502202078"],"arxiv":["2012.13378"]},"date_created":"2021-09-27T14:33:14Z","scopus_import":"1","department":[{"_id":"MaMo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"url":"https://arxiv.org/abs/2012.13378","open_access":"1"}],"year":"2021","oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"10364"}]},"page":"2369-2374","publication":"2021 IEEE International Symposium on Information Theory","date_updated":"2024-09-10T13:03:18Z","oa_version":"Preprint","conference":{"name":"ISIT: International Symposium on Information Theory","end_date":"2021-07-20","location":"Melbourne, Australia","start_date":"2021-07-12"},"citation":{"apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith, A. (2021). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In <i>2021 IEEE International Symposium on Information Theory</i> (pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” in <i>2021 IEEE International Symposium on Information Theory</i>, Melbourne, Australia, 2021, pp. 2369–2374.","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–2374.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In: <i>2021 IEEE International Symposium on Information Theory</i>. Institute of Electrical and Electronics Engineers; 2021:2369-2374. doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>","ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 2369–2374.","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>2021 IEEE International Symposium on Information Theory</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74, doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” In <i>2021 IEEE International Symposium on Information Theory</i>, 2369–74. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>."},"day":"01","month":"09","article_processing_charge":"No","arxiv":1,"abstract":[{"text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.","lang":"eng"}],"doi":"10.1109/ISIT45174.2021.9518153","title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"last_name":"Fazeli","full_name":"Fazeli, Arman","first_name":"Arman"},{"full_name":"Vardy, Alexander","last_name":"Vardy","first_name":"Alexander"},{"first_name":"John","full_name":"Cioffi, John","last_name":"Cioffi"},{"first_name":"Andrea","full_name":"Goldsmith, Andrea","last_name":"Goldsmith"}],"_id":"10053","publication_status":"published","status":"public","acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei. M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104.","publication_identifier":{"isbn":["978-1-5386-8210-4"],"issn":["2157-8095"],"eisbn":["978-1-5386-8209-8"]},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}]},{"oa":1,"year":"2021","alternative_title":["LIPIcs"],"date_updated":"2025-07-14T09:10:08Z","publication":"48th International Colloquium on Automata, Languages, and Programming","article_number":"124","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","department":[{"_id":"KrCh"}],"date_created":"2021-09-27T14:33:15Z","scopus_import":"1","date_published":"2021-07-02T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","intvolume":"       198","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","_id":"10054","title":"Faster algorithms for bounded liveness in graphs and game graphs","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sagar Sudhir","last_name":"Kale","full_name":"Kale, Sagar Sudhir"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"doi":"10.4230/LIPIcs.ICALP.2021.124","abstract":[{"lang":"eng","text":"Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a \"good\" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives."}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"publication_identifier":{"isbn":["978-3-95977-195-5"],"issn":["1868-8969"]},"ec_funded":1,"acknowledgement":"Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt). Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publication_status":"published","status":"public","ddc":["000"],"month":"07","file_date_updated":"2021-10-01T08:49:26Z","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in <i>48th International Colloquium on Automata, Languages, and Programming</i>, Glasgow, Scotland, 2021, vol. 198.","apa":"Chatterjee, K., Henzinger, M. H., Kale, S. S., &#38; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In <i>48th International Colloquium on Automata, Languages, and Programming</i> (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>","ama":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: <i>48th International Colloquium on Automata, Languages, and Programming</i>. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>","short":"K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ista":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In <i>48th International Colloquium on Automata, Languages, and Programming</i>, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” <i>48th International Colloquium on Automata, Languages, and Programming</i>, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>."},"day":"02","oa_version":"Published Version","conference":{"location":"Glasgow, Scotland","start_date":"2021-07-12","end_date":"2021-07-16","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2021_LIPIcs_Chatterjee.pdf","creator":"cchlebak","relation":"main_file","file_size":854576,"access_level":"open_access","content_type":"application/pdf","checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","success":1,"date_updated":"2021-10-01T08:49:26Z","file_id":"10062","date_created":"2021-10-01T08:49:26Z"}],"volume":198,"article_processing_charge":"No","has_accepted_license":"1"},{"oa_version":"Published Version","conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2021-03-19","start_date":"2021-03-16","location":"Saarbrücken, Germany"},"month":"03","file_date_updated":"2021-10-01T09:55:00Z","ddc":["000"],"citation":{"ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Saarbrücken, Germany, 2021, vol. 187.","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In <i>38th International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: <i>38th International Symposium on Theoretical Aspects of Computer Science</i>. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>","ista":"Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.","chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>."},"day":"10","article_processing_charge":"No","volume":187,"has_accepted_license":"1","file":[{"creator":"cchlebak","relation":"main_file","file_size":720250,"file_name":"2021_LIPIcs_Jecker.pdf","checksum":"17432a05733f408de300e17e390a90e4","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-10-01T09:55:00Z","success":1,"date_created":"2021-10-01T09:55:00Z","file_id":"10063"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.STACS.2021.44","abstract":[{"text":"Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2.","lang":"eng"}],"_id":"10055","title":"A Ramsey theorem for finite monoids","author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"}],"ec_funded":1,"publication_status":"published","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman for their valuable insights concerning Green’s relations.","status":"public","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7180-1"]},"date_created":"2021-09-27T14:33:15Z","scopus_import":"1","external_id":{"isi":["000635691700044"]},"date_published":"2021-03-10T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"KrCh"}],"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","intvolume":"       187","alternative_title":["LIPIcs"],"year":"2021","oa":1,"article_number":"44","date_updated":"2023-08-14T07:03:23Z","publication":"38th International Symposium on Theoretical Aspects of Computer Science"},{"type":"dissertation","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","date_published":"2021-10-05T00:00:00Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_created":"2021-09-30T07:53:49Z","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"8831","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"10065"},{"status":"public","relation":"part_of_dissertation","id":"10066"},{"status":"public","relation":"part_of_dissertation","id":"8909"},{"status":"public","relation":"part_of_dissertation","id":"5816"}]},"page":"151","date_updated":"2023-09-08T11:41:08Z","alternative_title":["ISTA Thesis"],"year":"2021","keyword":["qubits","quantum computing","holes"],"oa":1,"has_accepted_license":"1","article_processing_charge":"No","degree_awarded":"PhD","file":[{"file_id":"10061","date_created":"2021-09-30T14:29:14Z","embargo_to":"open_access","date_updated":"2022-12-20T23:30:07Z","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"ad6bcb24083ed7c02baaf1885c9ea3d5","file_name":"PHD_Thesis_Jirovec_Source.zip","relation":"source_file","file_size":32397600,"creator":"djirovec"},{"date_updated":"2022-12-20T23:30:07Z","content_type":"application/pdf","checksum":"5fbe08d4f66d1153e04c47971538fae8","access_level":"open_access","embargo":"2022-10-06","creator":"djirovec","relation":"main_file","file_size":26910829,"file_name":"PHD_Thesis_pdfa2b_1.pdf","date_created":"2021-10-05T07:56:49Z","file_id":"10087"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"05","citation":{"ista":"Jirovec D. 2021. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases. Institute of Science and Technology Austria.","short":"D. Jirovec, Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases, Institute of Science and Technology Austria, 2021.","ama":"Jirovec D. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10058\">10.15479/at:ista:10058</a>","ieee":"D. Jirovec, “Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases,” Institute of Science and Technology Austria, 2021.","apa":"Jirovec, D. (2021). <i>Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10058\">https://doi.org/10.15479/at:ista:10058</a>","mla":"Jirovec, Daniel. <i>Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10058\">10.15479/at:ista:10058</a>.","chicago":"Jirovec, Daniel. “Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10058\">https://doi.org/10.15479/at:ista:10058</a>."},"ddc":["621","539"],"file_date_updated":"2022-12-20T23:30:07Z","month":"10","status":"public","publication_status":"published","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No P30207, and the Nomis foundation.","publication_identifier":{"issn":["2663-337X"]},"project":[{"_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207","call_identifier":"FWF","name":"Hole spin orbit qubits in Ge quantum wells"}],"abstract":[{"text":"Quantum information and computation has become a vast field paved with opportunities for researchers and investors. As large multinational companies and international funds are heavily investing in quantum technologies it is still a question which platform is best suited for the task of realizing a scalable quantum processor. In this work we investigate hole spins in Ge quantum wells. These hold great promise as they possess several favorable properties: a small effective mass, a strong spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine noise. All these characteristics helped Ge hole spin qubits to evolve from a single qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated a qubit approach leveraging the large out-of-plane g-factors of heavy hole states in Ge quantum dots. We found this qubit to be reproducibly operable at extremely low magnetic field and at large speeds while maintaining coherence. This was possible because large differences of g-factors in adjacent dots can be achieved in the out-of-plane direction. In the in-plane direction the small g-factors, on the other hand, can be altered very effectively by the confinement potentials. Here, we found that this can even lead to a sign change of the g-factors. The resulting g-factor difference alters the dynamics of the system drastically and produces effects typically attributed to a spin-orbit induced spin-flip term.  The investigations carried out in this thesis give further insights into the possibilities of holes in Ge and reveal new physical properties that need to be considered when designing future spin qubit experiments.","lang":"eng"}],"doi":"10.15479/at:ista:10058","author":[{"orcid":"0000-0002-7197-4801","first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","last_name":"Jirovec","full_name":"Jirovec, Daniel"}],"supervisor":[{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"}],"title":"Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases","_id":"10058"},{"citation":{"apa":"Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec, D., … Ares, N. (n.d.). Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.12975\">https://doi.org/10.48550/arXiv.2107.12975</a>","ieee":"B. Severin <i>et al.</i>, “Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning,” <i>arXiv</i>. .","ista":"Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio A, Chrastina D, Isella G, Kruijf M de, Carballido MJ, Svab S, Kuhlmann AV, Braakman FR, Geyer S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl DM, Briggs GAD, Ares N. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. arXiv, 2107.12975.","ama":"Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.12975\">10.48550/arXiv.2107.12975</a>","short":"B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec, A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab, A.V. Kuhlmann, F.R. Braakman, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne, D. Sejdinovic, G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, ArXiv (n.d.).","chicago":"Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.12975\">https://doi.org/10.48550/arXiv.2107.12975</a>.","mla":"Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” <i>ArXiv</i>, 2107.12975, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.12975\">10.48550/arXiv.2107.12975</a>."},"department":[{"_id":"GeKa"}],"day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","external_id":{"arxiv":["2107.12975"]},"date_published":"2021-07-27T00:00:00Z","date_created":"2021-10-01T12:40:22Z","oa_version":"Preprint","acknowledged_ssus":[{"_id":"NanoFab"}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2107.12975","open_access":"1"}],"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"title":"Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning","oa":1,"author":[{"first_name":"B.","last_name":"Severin","full_name":"Severin, B."},{"full_name":"Lennon, D. T.","last_name":"Lennon","first_name":"D. T."},{"first_name":"L. C.","full_name":"Camenzind, L. C.","last_name":"Camenzind"},{"full_name":"Vigneau, F.","last_name":"Vigneau","first_name":"F."},{"first_name":"F.","full_name":"Fedele, F.","last_name":"Fedele"},{"full_name":"Jirovec, Daniel","last_name":"Jirovec","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","orcid":"0000-0002-7197-4801"},{"first_name":"A.","last_name":"Ballabio","full_name":"Ballabio, A."},{"last_name":"Chrastina","full_name":"Chrastina, D.","first_name":"D."},{"full_name":"Isella, G.","last_name":"Isella","first_name":"G."},{"first_name":"M. de","full_name":"Kruijf, M. de","last_name":"Kruijf"},{"first_name":"M. J.","last_name":"Carballido","full_name":"Carballido, M. J."},{"last_name":"Svab","full_name":"Svab, S.","first_name":"S."},{"first_name":"A. V.","full_name":"Kuhlmann, A. V.","last_name":"Kuhlmann"},{"last_name":"Braakman","full_name":"Braakman, F. R.","first_name":"F. R."},{"first_name":"S.","last_name":"Geyer","full_name":"Geyer, S."},{"first_name":"F. N. M.","last_name":"Froning","full_name":"Froning, F. N. M."},{"first_name":"H.","last_name":"Moon","full_name":"Moon, H."},{"full_name":"Osborne, M. A.","last_name":"Osborne","first_name":"M. A."},{"first_name":"D.","full_name":"Sejdinovic, D.","last_name":"Sejdinovic"},{"full_name":"Katsaros, Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","orcid":"0000-0001-8342-202X"},{"first_name":"D. M.","last_name":"Zumbühl","full_name":"Zumbühl, D. M."},{"first_name":"G. A. D.","last_name":"Briggs","full_name":"Briggs, G. A. D."},{"last_name":"Ares","full_name":"Ares, N.","first_name":"N."}],"_id":"10066","abstract":[{"text":"The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions. We give a key step towards tackling this variability with an algorithm that, without modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.","lang":"eng"}],"year":"2021","doi":"10.48550/arXiv.2107.12975","publication":"arXiv","project":[{"call_identifier":"FWF","name":"Hole spin orbit qubits in Ge quantum wells","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207"}],"date_updated":"2024-03-25T23:30:14Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10058"}]},"acknowledgement":"We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven) for the fabrication of the Ge/Si nanowire. This work was supported by the Royal Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform Grant\r\n(EP/R029229/1), the European Research Council (Grant agreement 948932), the Swiss Nanoscience Institute, the\r\nNCCR SPIN, the EU H2020 European Microkelvin Platform EMP grant No. 824109, the Scientific Service Units\r\nof IST Austria through resources provided by the nanofabrication facility and, the FWF-P30207 project. This publication was also made possible through support from Templeton World Charity Foundation and John Templeton Foundation. The opinions expressed in this publication are those of the authors and do not necessarily reflect the views of the Templeton Foundations.","status":"public","publication_status":"submitted","article_number":"2107.12975"},{"article_number":"104205","article_type":"original","publication":"Physical Review B","date_updated":"2023-08-14T07:24:47Z","year":"2021","oa":1,"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"American Physical Society","intvolume":"       104","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.05735"}],"date_published":"2021-09-30T00:00:00Z","external_id":{"isi":["000704414400002"],"arxiv":["2107.05735"]},"date_created":"2021-10-02T09:03:42Z","department":[{"_id":"MaSe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","status":"public","acknowledgement":"We would like to thank S. De Nicola, P. Brighi, and V. Karle for fruitful discussions and valuable feedback on the manuscript. R.M. and M.S. acknowledge support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Grant Agreement No. 850899). R.V. acknowledges support from the US Department of Energy, Office of Science, Basic Energy Sciences, under Early Career Award No. DE-SC0019168, and the Alfred P. Sloan Foundation through a Sloan Research Fellowship.","ec_funded":1,"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"project":[{"grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"abstract":[{"text":"The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.","lang":"eng"}],"issue":"10","doi":"10.1103/physrevb.104.104205","title":"Entanglement transitions from restricted Boltzmann machines","author":[{"full_name":"Medina Ramos, Raimel A","last_name":"Medina Ramos","id":"CE680B90-D85A-11E9-B684-C920E6697425","first_name":"Raimel A","orcid":"0000-0002-5383-2869"},{"first_name":"Romain","last_name":"Vasseur","full_name":"Vasseur, Romain"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827"}],"_id":"10067","article_processing_charge":"No","volume":104,"arxiv":1,"oa_version":"Preprint","citation":{"ista":"Medina Ramos RA, Vasseur R, Serbyn M. 2021. Entanglement transitions from restricted Boltzmann machines. Physical Review B. 104(10), 104205.","ama":"Medina Ramos RA, Vasseur R, Serbyn M. Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. 2021;104(10). doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>","short":"R.A. Medina Ramos, R. Vasseur, M. Serbyn, Physical Review B 104 (2021).","apa":"Medina Ramos, R. A., Vasseur, R., &#38; Serbyn, M. (2021). Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>","ieee":"R. A. Medina Ramos, R. Vasseur, and M. Serbyn, “Entanglement transitions from restricted Boltzmann machines,” <i>Physical Review B</i>, vol. 104, no. 10. American Physical Society, 2021.","mla":"Medina Ramos, Raimel A., et al. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>, vol. 104, no. 10, 104205, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>.","chicago":"Medina Ramos, Raimel A, Romain Vasseur, and Maksym Serbyn. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>."},"day":"30","month":"09"},{"has_accepted_license":"1","article_processing_charge":"Yes","volume":11,"file":[{"file_name":"2021_ScientificReports_Robinson.pdf","file_size":6970368,"relation":"main_file","creator":"cchlebak","access_level":"open_access","checksum":"f002ec22f609f58e1263b79e7f79601e","content_type":"application/pdf","success":1,"date_updated":"2021-10-05T14:56:48Z","file_id":"10091","date_created":"2021-10-05T14:56:48Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","citation":{"short":"M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports 11 (2021).","ista":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. 11, 19238.","ama":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. 2021;11. doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>","apa":"Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., &#38; Baud, D. (2021). Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>","ieee":"M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy,” <i>Scientific Reports</i>, vol. 11. Springer Nature, 2021.","mla":"Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>, vol. 11, 19238, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>.","chicago":"Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum, and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>."},"day":"28","month":"09","file_date_updated":"2021-10-05T14:56:48Z","ddc":["618"],"pmid":1,"status":"public","publication_status":"published","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the study and all the midwives and doctors for the computerized obstetrical data.","publication_identifier":{"eissn":["2045-2322"]},"abstract":[{"text":"The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups.","lang":"eng"}],"doi":"10.1038/s41598-021-98411-z","title":"Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy","author":[{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","last_name":"Robinson","orcid":"0000-0001-8982-8813"},{"first_name":"Marion","full_name":"Patxot, Marion","last_name":"Patxot"},{"full_name":"Stojanov, Miloš","last_name":"Stojanov","first_name":"Miloš"},{"last_name":"Blum","full_name":"Blum, Sabine","first_name":"Sabine"},{"first_name":"David","last_name":"Baud","full_name":"Baud, David"}],"_id":"10069","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer Nature","intvolume":"        11","date_published":"2021-09-28T00:00:00Z","external_id":{"isi":["000701575500083"],"pmid":["34584125"]},"date_created":"2021-10-03T22:01:21Z","scopus_import":"1","department":[{"_id":"MaRo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"19238","article_type":"original","publication":"Scientific Reports","date_updated":"2023-08-14T07:05:15Z","year":"2021","oa":1},{"publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"status":"public","publication_status":"published","acknowledgement":"The authors are grateful to Professor Kazuhiro Kuwae for kindly providing a copy of [49]. They are also grateful to Dr. Bang-Xian Han for helpful discussions on the Sobolev-to-Lipschitz property on metric measure spaces. They wish to express their deepest gratitude to an anonymous Reviewer, whose punctual remarks and comments greatly improved the accessibility and overall quality of the initial submission. This work was completed while L.D.S. was a member of the Institut für Angewandte Mathematik of the University of Bonn. He acknowledges funding of his position at that time by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Sonderforschungsbereich (Sfb, Collaborative Research Center) 1060 - project number 211504053. He also acknowledges funding of his current position by the Austrian Science Fund (FWF) grant F65, and by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas). K.S. gratefully acknowledges funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research Center Initiative (WPI), MEXT, Japan; and JSPS Grant-in-Aid for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number 17H06465.","ec_funded":1,"author":[{"orcid":"0000-0002-9881-6870","last_name":"Dello Schiavo","full_name":"Dello Schiavo, Lorenzo","first_name":"Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E"},{"first_name":"Kohei","last_name":"Suzuki","full_name":"Suzuki, Kohei"}],"title":"Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces","_id":"10070","issue":"11","abstract":[{"text":"We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties for generalized intrinsic distances on strongly local Dirichlet spaces possibly without square field operator. We present many non-smooth and infinite-dimensional examples. As an application, we prove the integral Varadhan short-time asymptotic with respect to a given distance function for a large class of strongly local Dirichlet forms.","lang":"eng"}],"doi":"10.1016/j.jfa.2021.109234","arxiv":1,"volume":281,"article_processing_charge":"No","day":"15","citation":{"apa":"Dello Schiavo, L., &#38; Suzuki, K. (2021). Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>","ieee":"L. Dello Schiavo and K. Suzuki, “Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces,” <i>Journal of Functional Analysis</i>, vol. 281, no. 11. Elsevier, 2021.","short":"L. Dello Schiavo, K. Suzuki, Journal of Functional Analysis 281 (2021).","ama":"Dello Schiavo L, Suzuki K. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. 2021;281(11). doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>","ista":"Dello Schiavo L, Suzuki K. 2021. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. Journal of Functional Analysis. 281(11), 109234.","chicago":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>.","mla":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>, vol. 281, no. 11, 109234, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>."},"month":"09","oa_version":"Preprint","publication":"Journal of Functional Analysis","date_updated":"2023-08-14T07:05:44Z","article_type":"original","article_number":"109234","oa":1,"year":"2021","intvolume":"       281","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2008.01492","open_access":"1"}],"publisher":"Elsevier","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-09-15T00:00:00Z","external_id":{"arxiv":["2008.01492"],"isi":["000703896600005"]},"scopus_import":"1","date_created":"2021-10-03T22:01:21Z"},{"main_file_link":[{"url":"http://www.ams.org/notices/","open_access":"1"}],"intvolume":"        68","publisher":"American Mathematical Society","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","department":[{"_id":"HeEd"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2021-10-01T00:00:00Z","scopus_import":"1","date_created":"2021-10-03T22:01:22Z","publication":"Notices of the American Mathematical Society","date_updated":"2021-12-03T07:31:26Z","article_type":"letter_note","page":"1511-1514","oa":1,"alternative_title":["Early Career"],"year":"2021","article_processing_charge":"No","volume":68,"day":"01","citation":{"mla":"Adams, Henry, et al. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14, doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>.","chicago":"Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>. American Mathematical Society, 2021. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>.","ieee":"H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to tutorial-a-thon,” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9. American Mathematical Society, pp. 1511–1514, 2021.","apa":"Adams, H., Kourimska, H., Heiss, T., Percival, S., &#38; Ziegelmeier, L. (2021). How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>","short":"H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of the American Mathematical Society 68 (2021) 1511–1514.","ista":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon. Notices of the American Mathematical Society. 68(9), 1511–1514.","ama":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. 2021;68(9):1511-1514. doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>"},"month":"10","oa_version":"Published Version","publication_identifier":{"issn":["0002-9920"],"eissn":["1088-9477"]},"publication_status":"published","status":"public","author":[{"full_name":"Adams, Henry","last_name":"Adams","first_name":"Henry"},{"id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana","full_name":"Kourimska, Hana","last_name":"Kourimska"},{"orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","full_name":"Heiss, Teresa","last_name":"Heiss"},{"first_name":"Sarah","full_name":"Percival, Sarah","last_name":"Percival"},{"last_name":"Ziegelmeier","full_name":"Ziegelmeier, Lori","first_name":"Lori"}],"title":"How to tutorial-a-thon","_id":"10071","issue":"9","doi":"10.1090/noti2349"},{"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","intvolume":"       207","date_created":"2021-10-03T22:01:22Z","scopus_import":"1","date_published":"2021-09-15T00:00:00Z","external_id":{"arxiv":["2008.05569"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"article_number":"31","date_updated":"2022-03-18T10:08:25Z","publication":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","year":"2021","alternative_title":["LIPIcs"],"oa":1,"volume":207,"article_processing_charge":"Yes","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"file":[{"date_updated":"2021-10-06T13:51:54Z","success":1,"checksum":"9d2544d53aa5b01565c6891d97a4d765","content_type":"application/pdf","access_level":"open_access","file_size":804472,"creator":"cchlebak","relation":"main_file","file_name":"2021_LIPIcs_Harris.pdf","date_created":"2021-10-06T13:51:54Z","file_id":"10098"}],"oa_version":"Published Version","conference":{"name":"APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation","location":"Virtual","start_date":"2021-08-16","end_date":"2021-08-18"},"file_date_updated":"2021-10-06T13:51:54Z","ddc":["000"],"month":"09","citation":{"mla":"Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>.","chicago":"Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>.","ieee":"D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Virtual, 2021, vol. 207.","apa":"Harris, D. G., Iliopoulos, F., &#38; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i> (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","short":"D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ama":"Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>. Vol 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","ista":"Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31."},"day":"15","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"Fotis Iliopoulos: This material is based upon work directly supported by the IAS Fund for Math and indirectly supported by the National Science Foundation Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is also supported by the National Science Foundation Grant No. CCF-1815328.\r\nVladimir Kolmogorov: Supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160.","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"publication_identifier":{"isbn":["978-3-9597-7207-5"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.APPROX/RANDOM.2021.31","abstract":[{"text":"The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, \"are they parallelizable?\", \"how many solutions can they output?\", \"what is the expected \"weight\" of a solution?\", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs.","lang":"eng"}],"_id":"10072","title":"A new notion of commutativity for the algorithmic Lovász Local Lemma","author":[{"full_name":"Harris, David G.","last_name":"Harris","first_name":"David G."},{"full_name":"Iliopoulos, Fotis","last_name":"Iliopoulos","first_name":"Fotis"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}]},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaIb"}],"scopus_import":"1","acknowledged_ssus":[{"_id":"EM-Fac"}],"date_created":"2021-10-03T22:01:23Z","external_id":{"isi":["000700689400001"],"pmid":["34576640"]},"date_published":"2021-09-19T00:00:00Z","intvolume":"        14","publisher":"MDPI","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"oa":1,"year":"2021","date_updated":"2023-08-14T08:00:01Z","publication":"Materials","article_type":"original","article_number":"5416","file_date_updated":"2021-10-14T11:56:39Z","ddc":["540"],"pmid":1,"month":"09","day":"19","citation":{"mla":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>, vol. 14, no. 18, 5416, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>.","chicago":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>.","ista":"Chang C, Ibáñez M. 2021. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. Materials. 14(18), 5416.","ama":"Chang C, Ibáñez M. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. 2021;14(18). doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>","short":"C. Chang, M. Ibáñez, Materials 14 (2021).","ieee":"C. Chang and M. Ibáñez, “Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites,” <i>Materials</i>, vol. 14, no. 18. MDPI, 2021.","apa":"Chang, C., &#38; Ibáñez, M. (2021). Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. MDPI. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>"},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","checksum":"4929dfc673a3ae77c010b6174279cc1d","content_type":"application/pdf","success":1,"date_updated":"2021-10-14T11:56:39Z","file_name":"2021_Materials_Chang.pdf","relation":"main_file","file_size":4404141,"creator":"cchlebak","file_id":"10140","date_created":"2021-10-14T11:56:39Z"}],"volume":14,"article_processing_charge":"Yes","has_accepted_license":"1","_id":"10073","author":[{"orcid":"0000-0002-9515-4277","last_name":"Chang","full_name":"Chang, Cheng","first_name":"Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"}],"title":"Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites","doi":"10.3390/ma14185416","issue":"18","abstract":[{"text":"Thermoelectric materials enable the direct conversion between heat and electricity. SnTe is a promising candidate due to its high charge transport performance. Here, we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe nanoparticles (NP), followed by a unique surface treatment prior NP consolidation. This synthetic approach allowed optimizing the charge and phonon transport synergistically. The novelty of this strategy was the use of a soluble PbS molecular complex prepared using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite is formed. The presence of PbS complexes significantly compensates for the Sn vacancy and increases the average grain size of the nanocomposite, thus improving the carrier mobility. Moreover, lattice thermal conductivity is also reduced by the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct rational surface treatment on NP-based thermoelectrics.","lang":"eng"}],"project":[{"grant_number":"M02889","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications"}],"publication_identifier":{"eissn":["1996-1944"]},"publication_status":"published","acknowledgement":"The authors thank the EMF facility in IST Austria for providing SEM and EDX measurements.\r\n","status":"public"},{"publication_status":"published","status":"public","acknowledgement":"Ismaël Jecker: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411. Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 892704.","ec_funded":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7201-3"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"abstract":[{"text":"We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.","lang":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2021.53","title":"A bit of nondeterminism makes pushdown automata expressive and succinct","author":[{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"first_name":"Karoliina","full_name":"Lehtinen, Karoliina","last_name":"Lehtinen"},{"last_name":"Zimmermann","full_name":"Zimmermann, Martin","first_name":"Martin"}],"_id":"10075","has_accepted_license":"1","volume":202,"article_processing_charge":"No","file":[{"content_type":"application/pdf","checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","access_level":"open_access","date_updated":"2021-10-06T12:44:05Z","success":1,"file_size":825567,"relation":"main_file","creator":"cchlebak","file_name":"2021_LIPIcs_Guha.pdf","date_created":"2021-10-06T12:44:05Z","file_id":"10097"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"oa_version":"Published Version","conference":{"end_date":"2021-08-27","location":"Tallinn, Estonia","start_date":"2021-08-23","name":"MFCS: Mathematical Foundations of Computer Science"},"citation":{"mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>.","chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>.","apa":"Guha, S., Jecker, I. R., Lehtinen, K., &#38; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In <i>46th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>","ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Tallinn, Estonia, 2021, vol. 202.","short":"S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: <i>46th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>","ista":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53."},"day":"18","ddc":["000"],"file_date_updated":"2021-10-06T12:44:05Z","month":"08","article_number":"53","publication":"46th International Symposium on Mathematical Foundations of Computer Science","date_updated":"2022-05-13T08:21:56Z","year":"2021","alternative_title":["LIPIcs"],"oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","intvolume":"       202","external_id":{"arxiv":["2105.02611"]},"date_published":"2021-08-18T00:00:00Z","date_created":"2021-10-03T22:01:23Z","scopus_import":"1","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"17","citation":{"apa":"Blackshear, S., Chalkias, K., Chatzigiannis, P., Faizullabhoy, R., Khaburzaniya, I., Kokoris Kogias, E., … Zakian, T. (2021). Reactive key-loss protection in blockchains. In <i>FC 2021 Workshops</i> (Vol. 12676, pp. 431–450). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">https://doi.org/10.1007/978-3-662-63958-0_34</a>","ieee":"S. Blackshear <i>et al.</i>, “Reactive key-loss protection in blockchains,” in <i>FC 2021 Workshops</i>, Virtual, 2021, vol. 12676, pp. 431–450.","ista":"Blackshear S, Chalkias K, Chatzigiannis P, Faizullabhoy R, Khaburzaniya I, Kokoris Kogias E, Lind J, Wong D, Zakian T. 2021. Reactive key-loss protection in blockchains. FC 2021 Workshops. FC: International Conference on Financial Cryptography and Data Security, LNCS, vol. 12676, 431–450.","ama":"Blackshear S, Chalkias K, Chatzigiannis P, et al. Reactive key-loss protection in blockchains. In: <i>FC 2021 Workshops</i>. Vol 12676. Springer Nature; 2021:431-450. doi:<a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">10.1007/978-3-662-63958-0_34</a>","short":"S. Blackshear, K. Chalkias, P. Chatzigiannis, R. Faizullabhoy, I. Khaburzaniya, E. Kokoris Kogias, J. Lind, D. Wong, T. Zakian, in:, FC 2021 Workshops, Springer Nature, 2021, pp. 431–450.","chicago":"Blackshear, Sam, Konstantinos Chalkias, Panagiotis Chatzigiannis, Riyaz Faizullabhoy, Irakliy Khaburzaniya, Eleftherios Kokoris Kogias, Joshua Lind, David Wong, and Tim Zakian. “Reactive Key-Loss Protection in Blockchains.” In <i>FC 2021 Workshops</i>, 12676:431–50. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">https://doi.org/10.1007/978-3-662-63958-0_34</a>.","mla":"Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.” <i>FC 2021 Workshops</i>, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:<a href=\"https://doi.org/10.1007/978-3-662-63958-0_34\">10.1007/978-3-662-63958-0_34</a>."},"month":"09","conference":{"name":"FC: International Conference on Financial Cryptography and Data Security","start_date":"2021-03-01","location":"Virtual","end_date":"2021-03-05"},"oa_version":"Preprint","article_processing_charge":"No","volume":"12676 ","author":[{"last_name":"Blackshear","full_name":"Blackshear, Sam","first_name":"Sam"},{"full_name":"Chalkias, Konstantinos","last_name":"Chalkias","first_name":"Konstantinos"},{"full_name":"Chatzigiannis, Panagiotis","last_name":"Chatzigiannis","first_name":"Panagiotis"},{"first_name":"Riyaz","last_name":"Faizullabhoy","full_name":"Faizullabhoy, Riyaz"},{"full_name":"Khaburzaniya, Irakliy","last_name":"Khaburzaniya","first_name":"Irakliy"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias"},{"full_name":"Lind, Joshua","last_name":"Lind","first_name":"Joshua"},{"last_name":"Wong","full_name":"Wong, David","first_name":"David"},{"last_name":"Zakian","full_name":"Zakian, Tim","first_name":"Tim"}],"title":"Reactive key-loss protection in blockchains","_id":"10076","abstract":[{"lang":"eng","text":"We present a novel approach for blockchain asset owners to reclaim their funds in case of accidental private-key loss or transfer to a mistyped address. Our solution can be deployed upon failure or absence of proactively implemented backup mechanisms, such as secret sharing and cold storage. The main advantages against previous proposals is it does not require any prior action from users and works with both single-key and multi-sig accounts. We achieve this by a 3-phase   Commit()→Reveal()→Claim()−or−Challenge()  smart contract that enables accessing funds of addresses for which the spending key is not available. We provide an analysis of the threat and incentive models and formalize the concept of reactive KEy-Loss Protection (KELP)."}],"doi":"10.1007/978-3-662-63958-0_34","publication_identifier":{"eissn":["1611-3349"],"eisbn":["978-3-662-63958-0"],"issn":["0302-9743"],"isbn":["978-3-6626-3957-3"]},"status":"public","publication_status":"published","acknowledgement":"The authors would like to thank all anonymous reviewers of FC21 WTSC workshop for comments and suggestions that greatly improved the quality of this paper.","department":[{"_id":"ElKo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-09-17T00:00:00Z","external_id":{"isi":["000713005000034"]},"scopus_import":"1","date_created":"2021-10-03T22:01:24Z","main_file_link":[{"open_access":"1","url":"https://research.fb.com/publications/reactive-key-loss-protection-in-blockchains/"}],"publisher":"Springer Nature","isi":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"year":"2021","alternative_title":["LNCS"],"publication":"FC 2021 Workshops","date_updated":"2023-08-14T07:06:16Z","page":"431-450"}]