[{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"title":"On treewidth, separators and Yao’s garbling","publisher":"Springer Nature","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"article_processing_charge":"No","quality_controlled":"1","_id":"10409","scopus_import":"1","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   SO(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(δwlog(S)) ,   δ  being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.  with only a   SO(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(δwlog(S)) ,   δ  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"}],"type":"conference","citation":{"mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” <i>19th International Conference</i>, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">10.1007/978-3-030-90453-1_17</a>.","apa":"Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In <i>19th International Conference</i> (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">https://doi.org/10.1007/978-3-030-90453-1_17</a>","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In <i>19th International Conference</i>, 13043:486–517. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">https://doi.org/10.1007/978-3-030-90453-1_17</a>.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference, Springer Nature, 2021, pp. 486–517.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13043, pp. 486–517.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 486–517.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: <i>19th International Conference</i>. Vol 13043. Springer Nature; 2021:486-517. doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">10.1007/978-3-030-90453-1_17</a>"},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"],"issn":["0302-9743"]},"publication_status":"published","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"}],"oa":1,"date_updated":"2023-08-17T06:21:38Z","acknowledgement":"We are grateful to Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. We would also like to thank Crypto 2021 and TCC 2021 reviewers for their detailed review and suggestions, which helped improve presentation considerably.","date_published":"2021-11-04T00:00:00Z","alternative_title":["LNCS"],"month":"11","year":"2021","conference":{"location":"Raleigh, NC, United States","name":"TCC: Theory of Cryptography","end_date":"2021-11-11","start_date":"2021-11-08"},"external_id":{"isi":["000728364000017"]},"page":"486-517","status":"public","day":"04","date_created":"2021-12-05T23:01:43Z","volume":"13043 ","ec_funded":1,"oa_version":"Preprint","isi":1,"related_material":{"record":[{"id":"10044","status":"public","relation":"earlier_version"}]},"publication":"19th International Conference","doi":"10.1007/978-3-030-90453-1_17","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}]},{"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"}],"publication_status":"published","_id":"10410","quality_controlled":"1","citation":{"mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” <i>19th International Conference</i>, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">10.1007/978-3-030-90453-1_19</a>.","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 International Conference</i> (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">https://doi.org/10.1007/978-3-030-90453-1_19</a>","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In <i>19th International Conference</i>, 13043:550–81. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">https://doi.org/10.1007/978-3-030-90453-1_19</a>.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 550–581.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13043, pp. 550–581.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: <i>19th International Conference</i>. Vol 13043. Springer Nature; 2021:550-581. doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">10.1007/978-3-030-90453-1_19</a>"},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"]},"abstract":[{"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 framework 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 bounds 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 broadcast 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.","lang":"eng"}],"scopus_import":"1","type":"conference","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrPi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"The cost of adaptivity in security games on graphs","author":[{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","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"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael"}],"publisher":"Springer Nature","related_material":{"record":[{"id":"10048","relation":"earlier_version","status":"public"}]},"ec_funded":1,"oa_version":"Preprint","isi":1,"publication":"19th International Conference","doi":"10.1007/978-3-030-90453-1_19","main_file_link":[{"url":"https://ia.cr/2021/059","open_access":"1"}],"date_created":"2021-12-05T23:01:43Z","status":"public","day":"04","volume":13043,"year":"2021","page":"550-581","external_id":{"isi":["000728364000019"]},"conference":{"location":"Raleigh, NC, United States","start_date":"2021-11-08","end_date":"2021-11-11","name":"TCC: Theory of Cryptography"},"date_updated":"2023-10-17T09:24:07Z","oa":1,"alternative_title":["LNCS"],"date_published":"2021-11-04T00:00:00Z","month":"11","intvolume":"     13043","acknowledgement":"C. Kamath—Supported by Azrieli International Postdoctoral Fellowship. Most of the work was done while the author was at Northeastern University and Charles University, funded by the IARPA grant IARPA/2019-19-020700009 and project PRIMUS/17/SCI/9, respectively. K. Klein—Supported in part by ERC CoG grant 724307. Most of the work was done while the author was at IST Austria funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT). K. Pietrzak—Funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT)."},{"status":"public","day":"10","date_created":"2021-12-05T23:01:45Z","volume":13047,"isi":1,"oa_version":"Preprint","ec_funded":1,"related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"later_version","id":"14778"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.02188"}],"doi":"10.1007/978-3-030-90870-6_33","publication":"24th International Symposium on Formal Methods","oa":1,"date_updated":"2025-07-14T09:10:11Z","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","intvolume":"     13047","month":"11","alternative_title":["LNCS"],"date_published":"2021-11-10T00:00:00Z","year":"2021","conference":{"location":"Virtual","start_date":"2021-11-20","end_date":"2021-11-26","name":"FM: Formal Methods"},"external_id":{"arxiv":["2108.02188"],"isi":["000758218600033"]},"page":"619-639","quality_controlled":"1","_id":"10414","type":"conference","arxiv":1,"scopus_import":"1","abstract":[{"text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.","lang":"eng"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>24th International Symposium on Formal Methods</i>, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., &#38; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In <i>24th International Symposium on Formal Methods</i> (Vol. 13047, pp. 619–639). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In <i>24th International Symposium on Formal Methods</i>, 13047:619–39. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>.","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in <i>24th International Symposium on Formal Methods</i>, Virtual, 2021, vol. 13047, pp. 619–639.","short":"K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.","ista":"Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: <i>24th International Symposium on Formal Methods</i>. Vol 13047. Springer Nature; 2021:619-639. doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9-783-0309-0869-0"],"eissn":["1611-3349"],"eisbn":["978-3-030-90870-6"]},"publication_status":"published","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar","last_name":"Goharshady"},{"full_name":"Novotný, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"full_name":"Zárevúcky, Jiří","last_name":"Zárevúcky","first_name":"Jiří"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699"}],"title":"On lexicographic proof rules for probabilistic termination","publisher":"Springer Nature","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No"},{"page":"XIV, 166","article_processing_charge":"No","department":[{"_id":"TiBr"}],"language":[{"iso":"eng"}],"year":"2021","month":"12","intvolume":"       343","date_published":"2021-12-01T00:00:00Z","alternative_title":["Progress in Mathematics"],"publisher":"Springer Nature","date_updated":"2022-06-03T07:38:33Z","title":"Cubic Forms and the Circle Method","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","doi":"10.1007/978-3-030-86872-7","place":"Cham","oa_version":"None","citation":{"short":"T.D. Browning, Cubic Forms and the Circle Method, Springer Nature, Cham, 2021.","ieee":"T. D. Browning, <i>Cubic Forms and the Circle Method</i>, vol. 343. Cham: Springer Nature, 2021.","ista":"Browning TD. 2021. Cubic Forms and the Circle Method, Cham: Springer Nature, XIV, 166p.","ama":"Browning TD. <i>Cubic Forms and the Circle Method</i>. Vol 343. Cham: Springer Nature; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-86872-7\">10.1007/978-3-030-86872-7</a>","chicago":"Browning, Timothy D. <i>Cubic Forms and the Circle Method</i>. Vol. 343. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-86872-7\">https://doi.org/10.1007/978-3-030-86872-7</a>.","apa":"Browning, T. D. (2021). <i>Cubic Forms and the Circle Method</i> (Vol. 343). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-86872-7\">https://doi.org/10.1007/978-3-030-86872-7</a>","mla":"Browning, Timothy D. <i>Cubic Forms and the Circle Method</i>. Vol. 343, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-86872-7\">10.1007/978-3-030-86872-7</a>."},"publication_identifier":{"eissn":["2296-505X"],"isbn":["978-3-030-86871-0"],"eisbn":["978-3-030-86872-7"],"issn":["0743-1643"]},"volume":343,"type":"book","scopus_import":"1","abstract":[{"text":"The Hardy–Littlewood circle method was invented over a century ago to study integer solutions to special Diophantine equations, but it has since proven to be one of the most successful all-purpose tools available to number theorists. Not only is it capable of handling remarkably general systems of polynomial equations defined over arbitrary global fields, but it can also shed light on the space of rational curves that lie on algebraic varieties.  This book, in which the arithmetic of cubic polynomials takes centre stage, is aimed at bringing beginning graduate students into contact with some of the many facets of the circle method, both classical and modern. This monograph is the winner of the 2021 Ferran Sunyer i Balaguer Prize, a prestigious award for books of expository nature presenting the latest developments in an active area of research in mathematics.","lang":"eng"}],"date_created":"2021-12-05T23:01:46Z","_id":"10415","status":"public","day":"01","quality_controlled":"1"},{"oa_version":"Published Version","degree_awarded":"MS","doi":"10.15479/at:ista:10422","publication_status":"published","date_created":"2021-12-07T10:48:06Z","_id":"10422","ddc":["530"],"day":"07","status":"public","supervisor":[{"last_name":"Goodrich","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter"}],"citation":{"apa":"Piankov, A. (2021). <i>Towards designer materials using customizable particle shape</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>","mla":"Piankov, Anton. <i>Towards Designer Materials Using Customizable Particle Shape</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>.","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021.","short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria.","ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>","chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>."},"publication_identifier":{"issn":["2791-4585"]},"abstract":[{"text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems.","lang":"eng"}],"file_date_updated":"2022-03-10T12:10:25Z","type":"dissertation","language":[{"iso":"eng"}],"year":"2021","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"date_updated":"2023-09-07T13:34:12Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"id":"865E3C26-AA8C-11E9-A409-C4C4E5697425","first_name":"Anton","last_name":"Piankov","full_name":"Piankov, Anton"}],"title":"Towards designer materials using customizable particle shape","file":[{"file_name":"Thesis.zip","date_updated":"2022-03-10T12:10:25Z","date_created":"2021-12-07T11:13:52Z","file_id":"10424","content_type":"application/x-zip-compressed","creator":"cchlebak","file_size":394018,"access_level":"closed","relation":"source_file","checksum":"114e8f4b2c002c6c352416c12de2c695"},{"date_created":"2021-12-07T11:14:01Z","date_updated":"2022-03-10T12:10:25Z","file_name":"Preliminary_pages_Piankov.docx","access_level":"closed","checksum":"cd15ae991ced352a9959815f794e657c","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"10425","creator":"cchlebak","file_size":47638},{"file_name":"2021_Piankov_combined.pdf","success":1,"date_created":"2021-12-07T11:20:35Z","date_updated":"2021-12-07T11:20:35Z","file_size":484965,"creator":"cchlebak","file_id":"10426","content_type":"application/pdf","access_level":"open_access","checksum":"e6899c798b75ba42fab9822bce309050","relation":"main_file"}],"alternative_title":["ISTA Master's Thesis"],"date_published":"2021-12-07T00:00:00Z","has_accepted_license":"1","month":"12","publisher":"Institute of Science and Technology Austria"},{"publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same."}],"type":"dissertation","file_date_updated":"2022-03-28T12:55:12Z","publication_identifier":{"issn":["2663-337X"]},"citation":{"mla":"Nadiradze, Giorgi. <i>On Achieving Scalability through Relaxation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>.","apa":"Nadiradze, G. (2021). <i>On achieving scalability through relaxation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>","chicago":"Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>.","ama":"Nadiradze G. On achieving scalability through relaxation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>","short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria."},"_id":"10429","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","author":[{"orcid":"0000-0001-5634-0731","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"title":"On achieving scalability through relaxation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"checksum":"6bf14e9a523387328f016c0689f5e10e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"10436","creator":"gnadirad","file_size":2370859,"date_updated":"2021-12-09T17:47:49Z","date_created":"2021-12-09T17:47:49Z","success":1,"file_name":"Thesis_Final_09_12_2021.pdf"},{"date_created":"2021-12-09T17:47:49Z","date_updated":"2022-03-28T12:55:12Z","file_name":"Thesis_Final_09_12_2021.zip","access_level":"closed","checksum":"914d6c5ca86bd0add471971a8f4c4341","relation":"source_file","file_size":2596924,"creator":"gnadirad","file_id":"10437","content_type":"application/zip"}],"doi":"10.15479/at:ista:10429","degree_awarded":"PhD","ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10432"},{"id":"6673","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"5965"},{"id":"10435","relation":"part_of_dissertation","status":"public"}]},"status":"public","day":"09","supervisor":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"date_created":"2021-12-08T21:52:28Z","page":"132","year":"2021","alternative_title":["ISTA Thesis"],"date_published":"2021-12-09T00:00:00Z","month":"12","oa":1,"date_updated":"2023-10-17T11:48:55Z"},{"project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","citation":{"mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 10, 2021, pp. 9037–45.","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 9037–9045). Virtual.","chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav  Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:9037–45, 2021.","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.","ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. ; 2021:9037-9045."},"type":"conference","arxiv":1,"abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"_id":"10432","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-5634-0731","last_name":"Nadiradze","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"},{"first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","full_name":"Markov, Ilia"},{"full_name":"Chatterjee, Bapi","last_name":"Chatterjee","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi"},{"full_name":"Kungurtsev, Vyacheslav ","last_name":"Kungurtsev","first_name":"Vyacheslav "},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092","open_access":"1"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"oa_version":"Published Version","ec_funded":1,"volume":35,"date_created":"2021-12-09T09:21:35Z","day":"18","status":"public","external_id":{"arxiv":["2001.05918"]},"page":"9037-9045","conference":{"location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"year":"2021","month":"05","intvolume":"        35","date_published":"2021-05-18T00:00:00Z","acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","date_updated":"2023-09-07T13:31:39Z","issue":"10","oa":1},{"related_material":{"record":[{"id":"10429","relation":"dissertation_contains","status":"public"}]},"oa_version":"Published Version","ec_funded":1,"main_file_link":[{"url":"https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html","open_access":"1"}],"publication":"35th Conference on Neural Information Processing Systems","date_created":"2021-12-09T10:59:12Z","day":"01","status":"public","year":"2021","external_id":{"arxiv":["1910.12308"]},"conference":{"location":"Sydney, Australia","start_date":"2021-12-06","end_date":"2021-12-14","name":"NeurIPS: Neural Information Processing Systems"},"date_updated":"2023-10-17T11:48:56Z","oa":1,"month":"12","date_published":"2021-12-01T00:00:00Z","acknowledgement":"We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411. SL was funded in part by European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement DAPP, No. 678880, and EPiGRAM-HS, No. 801039).\r\n","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"publication_status":"published","_id":"10435","quality_controlled":"1","citation":{"apa":"Nadiradze, G., Sabour, A., Davies, P., Li, S., &#38; Alistarh, D.-A. (2021). Asynchronous decentralized SGD with quantized and local updates. In <i>35th Conference on Neural Information Processing Systems</i>. Sydney, Australia: Neural Information Processing Systems Foundation.","mla":"Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021.","short":"G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","ieee":"G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous decentralized SGD with quantized and local updates,” in <i>35th Conference on Neural Information Processing Systems</i>, Sydney, Australia, 2021.","ista":"Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 2021. Asynchronous decentralized SGD with quantized and local updates. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","ama":"Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized SGD with quantized and local updates. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","chicago":"Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021."},"type":"conference","abstract":[{"lang":"eng","text":"Decentralized optimization is emerging as a viable alternative for scalable distributed machine learning, but also introduces new challenges in terms of synchronization costs. To this end, several communication-reduction techniques, such as non-blocking communication, quantization, and local steps, have been explored in the decentralized setting. Due to the complexity of analyzing optimization in such a relaxed setting, this line of work often assumes \\emph{global} communication rounds, which require additional synchronization. In this paper, we consider decentralized optimization in the simpler, but harder to analyze, \\emph{asynchronous gossip} model, in which communication occurs in discrete, randomly chosen pairings among nodes. Perhaps surprisingly, we show that a variant of SGD called \\emph{SwarmSGD} still converges in this setting, even if \\emph{non-blocking communication}, \\emph{quantization}, and \\emph{local steps} are all applied \\emph{in conjunction}, and even if the node data distributions and underlying graph topology are both \\emph{heterogenous}. Our analysis is based on a new connection with multi-dimensional load-balancing processes. We implement this algorithm and deploy it in a super-computing environment, showing that it can outperform previous decentralized methods in terms of end-to-end training time, and that it can even rival carefully-tuned large-batch SGD for certain tasks."}],"arxiv":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"DaAl"}],"title":"Asynchronous decentralized SGD with quantized and local updates","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi"},{"full_name":"Sabour, Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","last_name":"Sabour"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter","orcid":"0000-0002-5646-9524","last_name":"Davies","full_name":"Davies, Peter"},{"full_name":"Li, Shigang","last_name":"Li","first_name":"Shigang"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"publisher":"Neural Information Processing Systems Foundation"},{"citation":{"apa":"Ghazaryan, A., Holder, T., Serbyn, M., &#38; Berg, E. (2021). Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.127.247001\">https://doi.org/10.1103/physrevlett.127.247001</a>","mla":"Ghazaryan, Areg, et al. “Unconventional Superconductivity in Systems with Annular Fermi Surfaces: Application to Rhombohedral Trilayer Graphene.” <i>Physical Review Letters</i>, vol. 127, no. 24, 247001, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevlett.127.247001\">10.1103/physrevlett.127.247001</a>.","ista":"Ghazaryan A, Holder T, Serbyn M, Berg E. 2021. Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene. Physical Review Letters. 127(24), 247001.","ieee":"A. Ghazaryan, T. Holder, M. Serbyn, and E. Berg, “Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene,” <i>Physical Review Letters</i>, vol. 127, no. 24. American Physical Society, 2021.","short":"A. Ghazaryan, T. Holder, M. Serbyn, E. Berg, Physical Review Letters 127 (2021).","ama":"Ghazaryan A, Holder T, Serbyn M, Berg E. Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene. <i>Physical Review Letters</i>. 2021;127(24). doi:<a href=\"https://doi.org/10.1103/physrevlett.127.247001\">10.1103/physrevlett.127.247001</a>","chicago":"Ghazaryan, Areg, Tobias Holder, Maksym Serbyn, and Erez Berg. “Unconventional Superconductivity in Systems with Annular Fermi Surfaces: Application to Rhombohedral Trilayer Graphene.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevlett.127.247001\">https://doi.org/10.1103/physrevlett.127.247001</a>."},"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"arxiv":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"We show that in a two-dimensional electron gas with an annular Fermi surface, long-range Coulomb interactions can lead to unconventional superconductivity by the Kohn-Luttinger mechanism. Superconductivity is strongly enhanced when the inner and outer Fermi surfaces are close to each other. The most prevalent state has chiral p-wave symmetry, but d-wave and extended s-wave pairing are also possible. We discuss these results in the context of rhombohedral trilayer graphene, where superconductivity was recently discovered in regimes where the normal state has an annular Fermi surface. Using realistic parameters, our mechanism can account for the order of magnitude of Tc, as well as its trends as a function of electron density and perpendicular displacement field. Moreover, it naturally explains some of the outstanding puzzles in this material, that include the weak temperature dependence of the resistivity above Tc, and the proximity of spin singlet superconductivity to the ferromagnetic phase."}],"type":"journal_article","_id":"10527","quality_controlled":"1","project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"publication_status":"published","publisher":"American Physical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene","author":[{"full_name":"Ghazaryan, Areg","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Holder, Tobias","first_name":"Tobias","last_name":"Holder"},{"full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827"},{"full_name":"Berg, Erez","first_name":"Erez","last_name":"Berg"}],"article_processing_charge":"No","department":[{"_id":"MaSe"}],"language":[{"iso":"eng"}],"article_type":"original","volume":127,"date_created":"2021-12-10T07:51:33Z","day":"09","status":"public","publication":"Physical Review Letters","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.00011"}],"doi":"10.1103/physrevlett.127.247001","related_material":{"link":[{"description":"News on IST Webpage","url":"https://ist.ac.at/en/news/resolving-the-puzzles-of-graphene-superconductivity/","relation":"press_release"}]},"ec_funded":1,"oa_version":"Preprint","isi":1,"date_published":"2021-12-09T00:00:00Z","intvolume":"       127","month":"12","article_number":"247001","acknowledgement":"We thank Yang-Zhi Chou, Andrey Chubukov, Johannes Hofmann, Steve Kivelson, Sri Raghu, and Sankar das Sarma, Jay Sau, Fengcheng Wu, and Andrea Young for many stimulating discussions and for their comments on the manuscript. E.B. thanks S. Chatterjee, T. Wang, and M. Zaletel for a collaboration on a related topic. A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. E.B. and T.H. were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799), by the Israel-USA Binational Science Foundation (BSF), and by a Research grant from Irving and Cherna Moskowitz.","keyword":["general physics and astronomy"],"date_updated":"2023-08-14T13:19:13Z","oa":1,"issue":"24","external_id":{"isi":["000923819400004"],"arxiv":["2109.00011"]},"year":"2021"},{"project":[{"_id":"62935a00-2b32-11ec-9570-eff30fa39068","name":"Quantitative analysis of DNA methylation maintenance with chromatin","call_identifier":"H2020","grant_number":"725746"}],"publication_status":"published","citation":{"ama":"Choi J, Lyons DB, Zilberman D. Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/elife.72676\">10.7554/elife.72676</a>","short":"J. Choi, D.B. Lyons, D. Zilberman, ELife 10 (2021).","ista":"Choi J, Lyons DB, Zilberman D. 2021. Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin. eLife. 10, e72676.","ieee":"J. Choi, D. B. Lyons, and D. Zilberman, “Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","chicago":"Choi, Jaemyung, David B Lyons, and Daniel Zilberman. “Histone H1 Prevents Non-CG Methylation-Mediated Small RNA Biogenesis in Arabidopsis Heterochromatin.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/elife.72676\">https://doi.org/10.7554/elife.72676</a>.","apa":"Choi, J., Lyons, D. B., &#38; Zilberman, D. (2021). Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.72676\">https://doi.org/10.7554/elife.72676</a>","mla":"Choi, Jaemyung, et al. “Histone H1 Prevents Non-CG Methylation-Mediated Small RNA Biogenesis in Arabidopsis Heterochromatin.” <i>ELife</i>, vol. 10, e72676, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/elife.72676\">10.7554/elife.72676</a>."},"publication_identifier":{"issn":["2050-084X"]},"scopus_import":"1","abstract":[{"text":"Flowering plants utilize small RNA molecules to guide DNA methyltransferases to genomic sequences. This RNA-directed DNA methylation (RdDM) pathway preferentially targets euchromatic transposable elements. However, RdDM is thought to be recruited by methylation of histone H3 at lysine 9 (H3K9me), a hallmark of heterochromatin. How RdDM is targeted to euchromatin despite an affinity for H3K9me is unclear. Here we show that loss of histone H1 enhances heterochromatic RdDM, preferentially at nucleosome linker DNA. Surprisingly, this does not require SHH1, the RdDM component that binds H3K9me. Furthermore, H3K9me is dispensable for RdDM, as is CG DNA methylation. Instead, we find that non-CG methylation is specifically associated with small RNA biogenesis, and without H1 small RNA production quantitatively expands to non-CG methylated loci. Our results demonstrate that H1 enforces the separation of euchromatic and heterochromatic DNA methylation pathways by excluding the small RNA-generating branch of RdDM from non-CG methylated heterochromatin.","lang":"eng"}],"type":"journal_article","file_date_updated":"2022-05-16T10:42:22Z","_id":"10533","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"DaZi"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"eLife Sciences Publications","title":"Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Choi","first_name":"Jaemyung","full_name":"Choi, Jaemyung"},{"last_name":"Lyons","first_name":"David B","full_name":"Lyons, David B"},{"full_name":"Zilberman, Daniel","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","last_name":"Zilberman"}],"file":[{"checksum":"22ed4c55fb550f6da02ae55c359be651","access_level":"open_access","relation":"main_file","file_size":2715200,"creator":"dernst","file_id":"11384","content_type":"application/pdf","date_created":"2022-05-16T10:42:22Z","date_updated":"2022-05-16T10:42:22Z","file_name":"2021_eLife_Choi.pdf","success":1}],"publication":"eLife","doi":"10.7554/elife.72676","oa_version":"Published Version","ec_funded":1,"isi":1,"volume":10,"pmid":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-12-10T13:12:08Z","ddc":["570"],"day":"01","status":"public","external_id":{"isi":["000754832000001"],"pmid":["34850679"]},"license":"https://creativecommons.org/licenses/by/4.0/","year":"2021","date_published":"2021-12-01T00:00:00Z","intvolume":"        10","month":"12","article_number":"e72676","acknowledgement":"We thank X Feng for helpful comments on the manuscript. This work was supported by a European Research Council grant MaintainMeth (725746) to DZ.","keyword":["genetics and molecular biology"],"date_updated":"2023-08-17T06:21:08Z","oa":1},{"quality_controlled":"1","_id":"10534","scopus_import":"1","abstract":[{"lang":"eng","text":"For many years, fullerene derivatives have been the main n-type material of organic electronics and optoelectronics. Recently, fullerene derivatives functionalized with ethylene glycol (EG) side chains have been showing important properties such as enhanced dielectric constants, facile doping and enhanced self-assembly capabilities. Here, we have prepared field-effect transistors using a series of these fullerene derivatives equipped with EG side chains of different lengths. Transport data show the beneficial effect of increasing the EG side chain. In order to understand the material properties, full structural determination of these fullerene derivatives has been achieved by coupling the X-ray data with molecular dynamics (MD) simulations. The increase in transport properties is paired with the formation of extended layered structures, efficient molecular packing and an increase in the crystallite alignment. The layer-like structure is composed of conducting layers, containing of closely packed C60 balls approaching the inter-distance of 1 nm, that are separated by well-defined EG layers, where the EG chains are rather splayed with the chain direction almost perpendicular to the layer normal. Such a layered structure appears highly ordered and highly aligned with the C60 planes oriented parallel to the substrate in the thin film configuration. The order inside the thin film increases with the EG chain length, allowing the systems to achieve mobilities as high as 0.053 cm2 V−1 s−1. Our work elucidates the structure of these interesting semiconducting organic molecules and shows that the synergistic use of X-ray structural analysis and MD simulations is a powerful tool to identify the structure of thin organic films for optoelectronic applications."}],"file_date_updated":"2021-12-13T09:24:42Z","type":"journal_article","citation":{"ista":"Dong J, Sami S, Balazs D, Alessandri R, Jahani F, Qiu L, Marrink SJ, Havenith RWA, Hummelen JC, Loi MA, Portale G. 2021. Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties. Journal of Materials Chemistry C. 9(45), 16217–16225.","short":"J. Dong, S. Sami, D. Balazs, R. Alessandri, F. Jahani, L. Qiu, S.J. Marrink, R.W.A. Havenith, J.C. Hummelen, M.A. Loi, G. Portale, Journal of Materials Chemistry C 9 (2021) 16217–16225.","ieee":"J. Dong <i>et al.</i>, “Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties,” <i>Journal of Materials Chemistry C</i>, vol. 9, no. 45. Royal Society of Chemistry, pp. 16217–16225, 2021.","ama":"Dong J, Sami S, Balazs D, et al. Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties. <i>Journal of Materials Chemistry C</i>. 2021;9(45):16217-16225. doi:<a href=\"https://doi.org/10.1039/d1tc02753k\">10.1039/d1tc02753k</a>","chicago":"Dong, Jingjin, Selim Sami, Daniel Balazs, Riccardo Alessandri, Fatimeh Jahani, Li Qiu, Siewert J. Marrink, et al. “Fullerene Derivatives with Oligoethylene-Glycol Side Chains: An Investigation on the Origin of Their Outstanding Transport Properties.” <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry, 2021. <a href=\"https://doi.org/10.1039/d1tc02753k\">https://doi.org/10.1039/d1tc02753k</a>.","apa":"Dong, J., Sami, S., Balazs, D., Alessandri, R., Jahani, F., Qiu, L., … Portale, G. (2021). Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties. <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d1tc02753k\">https://doi.org/10.1039/d1tc02753k</a>","mla":"Dong, Jingjin, et al. “Fullerene Derivatives with Oligoethylene-Glycol Side Chains: An Investigation on the Origin of Their Outstanding Transport Properties.” <i>Journal of Materials Chemistry C</i>, vol. 9, no. 45, Royal Society of Chemistry, 2021, pp. 16217–25, doi:<a href=\"https://doi.org/10.1039/d1tc02753k\">10.1039/d1tc02753k</a>."},"publication_identifier":{"issn":["2050-7534"],"eissn":["2050-7526"]},"publication_status":"published","title":"Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Jingjin","last_name":"Dong","full_name":"Dong, Jingjin"},{"full_name":"Sami, Selim","last_name":"Sami","first_name":"Selim"},{"first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","last_name":"Balazs","orcid":"0000-0001-7597-043X","full_name":"Balazs, Daniel"},{"last_name":"Alessandri","first_name":"Riccardo","full_name":"Alessandri, Riccardo"},{"full_name":"Jahani, Fatimeh","last_name":"Jahani","first_name":"Fatimeh"},{"last_name":"Qiu","first_name":"Li","full_name":"Qiu, Li"},{"first_name":"Siewert J.","last_name":"Marrink","full_name":"Marrink, Siewert J."},{"last_name":"Havenith","first_name":"Remco W.A.","full_name":"Havenith, Remco W.A."},{"full_name":"Hummelen, Jan C.","first_name":"Jan C.","last_name":"Hummelen"},{"first_name":"Maria A.","last_name":"Loi","full_name":"Loi, Maria A."},{"full_name":"Portale, Giuseppe","last_name":"Portale","first_name":"Giuseppe"}],"file":[{"checksum":"6b73c214ce54a6894a5854b4364413d7","relation":"main_file","access_level":"open_access","file_id":"10538","content_type":"application/pdf","file_size":4979390,"creator":"cchlebak","date_updated":"2021-12-13T09:24:42Z","date_created":"2021-12-13T09:24:42Z","success":1,"file_name":"2021_JMaterChemC_Dong.pdf"}],"publisher":"Royal Society of Chemistry","has_accepted_license":"1","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"MaIb"}],"article_processing_charge":"No","status":"public","day":"07","ddc":["540"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-12-12T23:01:27Z","volume":9,"oa_version":"Published Version","isi":1,"publication":"Journal of Materials Chemistry C","doi":"10.1039/d1tc02753k","oa":1,"issue":"45","date_updated":"2023-08-17T06:18:44Z","acknowledgement":"J. D. gratefully acknowledges the China Scholarship Council (CSC No. 201606340158) for supporting his PhD studies. S. S. thanks J. Antoja-Lleonart for insightful discussions on simulating the X-ray diffraction patterns. Part of the work was sponsored by NWO Exact and Natural Sciences for the use of supercomputer facilities (Contract no. 17197 7095). Regarding S. S., R. A., R. W. A. H., J. C. H., and M. A. L., this is a publication by the FOM Focus Group “Next Generation Organic Photovoltaics”, participating in the Dutch Institute for Fundamental Energy Research (DIFFER). The ESRF is acknowledged for providing the beamtime. J. D. and G. P. are grateful to the BM26B staff for their great support during the beamtime. M. A. L., D. M. B. are grateful for the financial support of the European Research Council via a Starting Grant (HySPOD, No. 306983).","date_published":"2021-12-07T00:00:00Z","month":"12","intvolume":"         9","year":"2021","external_id":{"isi":["000688135700001"]},"page":"16217-16225"},{"publication_status":"published","_id":"10535","quality_controlled":"1","publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"citation":{"mla":"Bodova, Katarina, et al. “Dynamic Maximum Entropy Provides Accurate Approximation of Structured Population Dynamics.” <i>PLoS Computational Biology</i>, vol. 17, no. 12, e1009661, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009661\">10.1371/journal.pcbi.1009661</a>.","apa":"Bodova, K., Szep, E., &#38; Barton, N. H. (2021). Dynamic maximum entropy provides accurate approximation of structured population dynamics. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1009661\">https://doi.org/10.1371/journal.pcbi.1009661</a>","chicago":"Bodova, Katarina, Eniko Szep, and Nicholas H Barton. “Dynamic Maximum Entropy Provides Accurate Approximation of Structured Population Dynamics.” <i>PLoS Computational Biology</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pcbi.1009661\">https://doi.org/10.1371/journal.pcbi.1009661</a>.","ama":"Bodova K, Szep E, Barton NH. Dynamic maximum entropy provides accurate approximation of structured population dynamics. <i>PLoS Computational Biology</i>. 2021;17(12). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009661\">10.1371/journal.pcbi.1009661</a>","ista":"Bodova K, Szep E, Barton NH. 2021. Dynamic maximum entropy provides accurate approximation of structured population dynamics. PLoS Computational Biology. 17(12), e1009661.","ieee":"K. Bodova, E. Szep, and N. H. Barton, “Dynamic maximum entropy provides accurate approximation of structured population dynamics,” <i>PLoS Computational Biology</i>, vol. 17, no. 12. Public Library of Science, 2021.","short":"K. Bodova, E. Szep, N.H. Barton, PLoS Computational Biology 17 (2021)."},"scopus_import":"1","arxiv":1,"abstract":[{"lang":"eng","text":"Realistic models of biological processes typically involve interacting components on multiple scales, driven by changing environment and inherent stochasticity. Such models are often analytically and numerically intractable. We revisit a dynamic maximum entropy method that combines a static maximum entropy with a quasi-stationary approximation. This allows us to reduce stochastic non-equilibrium dynamics expressed by the Fokker-Planck equation to a simpler low-dimensional deterministic dynamics, without the need to track microscopic details. Although the method has been previously applied to a few (rather complicated) applications in population genetics, our main goal here is to explain and to better understand how the method works. We demonstrate the usefulness of the method for two widely studied stochastic problems, highlighting its accuracy in capturing important macroscopic quantities even in rapidly changing non-stationary conditions. For the Ornstein-Uhlenbeck process, the method recovers the exact dynamics whilst for a stochastic island model with migration from other habitats, the approximation retains high macroscopic accuracy under a wide range of scenarios in a dynamic environment."}],"file_date_updated":"2022-05-16T08:53:11Z","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamic maximum entropy provides accurate approximation of structured population dynamics","author":[{"full_name":"Bod'ová, Katarína","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","first_name":"Katarína","orcid":"0000-0002-7214-0171","last_name":"Bod'ová"},{"full_name":"Szep, Eniko","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87","first_name":"Eniko","last_name":"Szep"},{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"file":[{"file_size":2299486,"creator":"dernst","content_type":"application/pdf","file_id":"11383","relation":"main_file","access_level":"open_access","checksum":"dcd185d4f7e0acee25edf1d6537f447e","file_name":"2021_PLOsComBio_Bodova.pdf","success":1,"date_created":"2022-05-16T08:53:11Z","date_updated":"2022-05-16T08:53:11Z"}],"has_accepted_license":"1","publisher":"Public Library of Science","oa_version":"Published Version","publication":"PLoS Computational Biology","doi":"10.1371/journal.pcbi.1009661","date_created":"2021-12-12T23:01:27Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"day":"01","status":"public","volume":17,"pmid":1,"year":"2021","external_id":{"arxiv":["2102.03669"],"pmid":["34851948"]},"date_updated":"2022-08-01T10:48:04Z","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"issue":"12","date_published":"2021-12-01T00:00:00Z","intvolume":"        17","month":"12","article_number":"e1009661","acknowledgement":"Computational resources for the study were provided by the Institute of Science and Technology, Austria.\r\nKB received funding from the Scientific Grant Agency of the Slovak Republic under the Grants Nos. 1/0755/19 and 1/0521/20."},{"type":"journal_article","file_date_updated":"2021-12-13T13:32:37Z","abstract":[{"text":"TGFβ overexpression is commonly detected in cancer patients and correlates with poor prognosis and metastasis. Cancer progression is often associated with an enhanced recruitment of myeloid-derived cells to the tumor microenvironment. Here we show that functional TGFβ-signaling in myeloid cells is required for metastasis to the lungs and the liver. Myeloid-specific deletion of Tgfbr2 resulted in reduced spontaneous lung metastasis, which was associated with a reduction of proinflammatory cytokines in the metastatic microenvironment. Notably, CD8+ T cell depletion in myeloid-specific Tgfbr2-deficient mice rescued lung metastasis. Myeloid-specific Tgfbr2-deficiency resulted in reduced liver metastasis with an almost complete absence of myeloid cells within metastatic foci. On contrary, an accumulation of Tgfβ-responsive myeloid cells was associated with an increased recruitment of monocytes and granulocytes and higher proinflammatory cytokine levels in control mice. Monocytic cells isolated from metastatic livers of Tgfbr2-deficient mice showed increased polarization towards the M1 phenotype, Tnfα and Il-1β expression, reduced levels of M2 markers and reduced production of chemokines responsible for myeloid-cell recruitment. No significant differences in Tgfβ levels were observed at metastatic sites of any model. These data demonstrate that Tgfβ signaling in monocytic myeloid cells suppresses CD8+ T cell activity during lung metastasis, while these cells actively contribute to tumor growth during liver metastasis. Thus, myeloid cells modulate metastasis through different mechanisms in a tissue-specific manner.","lang":"eng"}],"scopus_import":"1","citation":{"apa":"Stefanescu, C., Van Gogh, M., Roblek, M., Heikenwalder, M., &#38; Borsig, L. (2021). TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms. <i>Frontiers in Oncology</i>. Frontiers. <a href=\"https://doi.org/10.3389/fonc.2021.765151\">https://doi.org/10.3389/fonc.2021.765151</a>","mla":"Stefanescu, Cristina, et al. “TGFβ Signaling in Myeloid Cells Promotes Lung and Liver Metastasis through Different Mechanisms.” <i>Frontiers in Oncology</i>, vol. 11, 765151, Frontiers, 2021, doi:<a href=\"https://doi.org/10.3389/fonc.2021.765151\">10.3389/fonc.2021.765151</a>.","ieee":"C. Stefanescu, M. Van Gogh, M. Roblek, M. Heikenwalder, and L. Borsig, “TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms,” <i>Frontiers in Oncology</i>, vol. 11. Frontiers, 2021.","short":"C. Stefanescu, M. Van Gogh, M. Roblek, M. Heikenwalder, L. Borsig, Frontiers in Oncology 11 (2021).","ista":"Stefanescu C, Van Gogh M, Roblek M, Heikenwalder M, Borsig L. 2021. TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms. Frontiers in Oncology. 11, 765151.","ama":"Stefanescu C, Van Gogh M, Roblek M, Heikenwalder M, Borsig L. TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms. <i>Frontiers in Oncology</i>. 2021;11. doi:<a href=\"https://doi.org/10.3389/fonc.2021.765151\">10.3389/fonc.2021.765151</a>","chicago":"Stefanescu, Cristina, Merel Van Gogh, Marko Roblek, Mathias Heikenwalder, and Lubor Borsig. “TGFβ Signaling in Myeloid Cells Promotes Lung and Liver Metastasis through Different Mechanisms.” <i>Frontiers in Oncology</i>. Frontiers, 2021. <a href=\"https://doi.org/10.3389/fonc.2021.765151\">https://doi.org/10.3389/fonc.2021.765151</a>."},"publication_identifier":{"eissn":["2234-943X"]},"quality_controlled":"1","_id":"10536","publication_status":"published","publisher":"Frontiers","has_accepted_license":"1","file":[{"date_updated":"2021-12-13T13:32:37Z","date_created":"2021-12-13T13:32:37Z","success":1,"file_name":"2021_Frontiers_Stefanescu.pdf","relation":"main_file","access_level":"open_access","checksum":"56cbac80e6891ce750511a30161b7792","file_id":"10539","content_type":"application/pdf","creator":"alisjak","file_size":9245199}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms","author":[{"full_name":"Stefanescu, Cristina","first_name":"Cristina","last_name":"Stefanescu"},{"last_name":"Van Gogh","first_name":"Merel","full_name":"Van Gogh, Merel"},{"first_name":"Marko","id":"3047D808-F248-11E8-B48F-1D18A9856A87","last_name":"Roblek","orcid":"0000-0001-9588-1389","full_name":"Roblek, Marko"},{"full_name":"Heikenwalder, Mathias","last_name":"Heikenwalder","first_name":"Mathias"},{"last_name":"Borsig","first_name":"Lubor","full_name":"Borsig, Lubor"}],"department":[{"_id":"DaSi"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"pmid":1,"volume":11,"day":"18","status":"public","date_created":"2021-12-12T23:01:27Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["610"],"doi":"10.3389/fonc.2021.765151","publication":"Frontiers in Oncology","isi":1,"oa_version":"Published Version","article_number":"765151","acknowledgement":"The authors acknowledge the assistance of the Laboratory Animal Services Center (LASC) – UZH, Center for Microscopy and Image Analysis, and the Flow Cytometry Center of the University of Zurich.","month":"11","intvolume":"        11","date_published":"2021-11-18T00:00:00Z","oa":1,"date_updated":"2023-08-17T06:20:32Z","external_id":{"pmid":["34868988"],"isi":["000726603400001"]},"year":"2021"},{"date_created":"2021-12-12T23:01:28Z","day":"02","status":"public","isi":1,"oa_version":"Preprint","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08224"}],"doi":"10.1007/s00023-021-01136-y","publication":"Annales Henri Poincaré","date_updated":"2023-08-17T06:19:14Z","oa":1,"month":"12","date_published":"2021-12-02T00:00:00Z","acknowledgement":"NB was supported by Gruppo Nazionale per la Fisica Matematica (GNFM). RS was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 694227). PTN was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC-2111-390814868). MP was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (ERC StG MaMBoQ, Grant Agreement No. 802901). BS was supported by the NCCR SwissMAP, the Swiss National Science Foundation through the Grant “Dynamical and energetic properties of Bose-Einstein condensates,” and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program through the ERC-AdG CLaQS (Grant Agreement No. 834782).","year":"2021","external_id":{"arxiv":["2103.08224"],"isi":["000725405700001"]},"_id":"10537","quality_controlled":"1","publication_identifier":{"issn":["1424-0637"]},"citation":{"apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., &#38; Seiringer, R. (2021). Bosonization of fermionic many-body dynamics. <i>Annales Henri Poincaré</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00023-021-01136-y\">https://doi.org/10.1007/s00023-021-01136-y</a>","mla":"Benedikter, Niels P., et al. “Bosonization of Fermionic Many-Body Dynamics.” <i>Annales Henri Poincaré</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00023-021-01136-y\">10.1007/s00023-021-01136-y</a>.","ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Bosonization of fermionic many-body dynamics. <i>Annales Henri Poincaré</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s00023-021-01136-y\">10.1007/s00023-021-01136-y</a>","ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Bosonization of fermionic many-body dynamics,” <i>Annales Henri Poincaré</i>. Springer Nature, 2021.","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Bosonization of fermionic many-body dynamics. Annales Henri Poincaré.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Annales Henri Poincaré (2021).","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Bosonization of Fermionic Many-Body Dynamics.” <i>Annales Henri Poincaré</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00023-021-01136-y\">https://doi.org/10.1007/s00023-021-01136-y</a>."},"type":"journal_article","arxiv":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"We consider the quantum many-body evolution of a homogeneous Fermi gas in three dimensions in the coupled semiclassical and mean-field scaling regime. We study a class of initial data describing collective particle–hole pair excitations on the Fermi ball. Using a rigorous version of approximate bosonization, we prove that the many-body evolution can be approximated in Fock space norm by a quasi-free bosonic evolution of the collective particle–hole excitations."}],"project":[{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"publication_status":"published","author":[{"full_name":"Benedikter, Niels P","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","first_name":"Niels P","last_name":"Benedikter","orcid":"0000-0002-1071-6091"},{"full_name":"Nam, Phan Thành","first_name":"Phan Thành","last_name":"Nam"},{"first_name":"Marcello","last_name":"Porta","full_name":"Porta, Marcello"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"title":"Bosonization of fermionic many-body dynamics","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer Nature","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"RoSe"}]},{"project":[{"call_identifier":"H2020","grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"publication_status":"published","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"citation":{"mla":"Medina Ramos, Raimel A., and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” <i>Physical Review A</i>, vol. 104, no. 6, 062423, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physreva.104.062423\">10.1103/physreva.104.062423</a>.","apa":"Medina Ramos, R. A., &#38; Serbyn, M. (2021). Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreva.104.062423\">https://doi.org/10.1103/physreva.104.062423</a>","chicago":"Medina Ramos, Raimel A, and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physreva.104.062423\">https://doi.org/10.1103/physreva.104.062423</a>.","short":"R.A. Medina Ramos, M. Serbyn, Physical Review A 104 (2021).","ieee":"R. A. Medina Ramos and M. Serbyn, “Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT),” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","ista":"Medina Ramos RA, Serbyn M. 2021. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review A. 104(6), 062423.","ama":"Medina Ramos RA, Serbyn M. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/physreva.104.062423\">10.1103/physreva.104.062423</a>"},"type":"journal_article","arxiv":1,"abstract":[{"lang":"eng","text":"Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state. However, when the classical problem is in a so-called clustering phase, the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT model defined on simple hypergraphs. The degeneracy of classical ground state manifold translates into the emergence of an extensive number of Z2 symmetries, which remain intact even in the presence of a quantum transverse magnetic field. We establish a general duality approach that restricts the quantum problem to a given sector of conserved Z2 charges and use it to study how the outcome of the quantum adiabatic algorithm depends on the hypergraph geometry. We show that the tree hypergraph which corresponds to a classically solvable instance of the 3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters a second-order phase transition with a gap vanishing as a power-law in the problem size. The duality developed in this work provides a practical tool for studies of quantum models with classically degenerate energy manifold and reveals potential connections between glasses and gauge theories."}],"_id":"10545","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"MaSe"}],"language":[{"iso":"eng"}],"article_type":"original","publisher":"American Physical Society","author":[{"full_name":"Medina Ramos, Raimel A","first_name":"Raimel A","id":"CE680B90-D85A-11E9-B684-C920E6697425","last_name":"Medina Ramos","orcid":"0000-0002-5383-2869"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","last_name":"Serbyn","full_name":"Serbyn, Maksym"}],"title":"Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/2106.06344","open_access":"1"}],"doi":"10.1103/physreva.104.062423","publication":"Physical Review A","isi":1,"ec_funded":1,"oa_version":"Preprint","volume":104,"date_created":"2021-12-14T20:46:07Z","status":"public","day":"14","external_id":{"arxiv":["2106.06344"],"isi":["000753659200004"]},"year":"2021","month":"12","intvolume":"       104","date_published":"2021-12-14T00:00:00Z","article_number":"062423","acknowledgement":"We would like to thank S. De Nicola, A. Michaidilis, T. Gulden, Y. Nez-Fernndez, P. Brighi, and S. Sack for fruitful discussions and valuable feedback on the manuscript. M.S. acknowledges useful discussions with E. Altman, L. Cugliandolo, and C. Laumann. We acknowledge support from the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme Grant Agreement No. 850899.","date_updated":"2023-08-17T06:22:49Z","issue":"6","oa":1},{"date_published":"2021-06-30T00:00:00Z","intvolume":"       242","month":"06","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). SN acknowledges partial support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 405009441.","keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"date_updated":"2023-08-17T06:23:21Z","oa":1,"issue":"1","external_id":{"isi":["000668431200001"],"arxiv":["1908.02273"]},"page":"343-452","year":"2021","volume":242,"date_created":"2021-12-16T12:12:33Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"day":"30","status":"public","publication":"Archive for Rational Mechanics and Analysis","doi":"10.1007/s00205-021-01686-9","oa_version":"Published Version","isi":1,"has_accepted_license":"1","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Fischer, Julian L","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","orcid":"0000-0002-0479-558X"},{"full_name":"Neukamm, Stefan","first_name":"Stefan","last_name":"Neukamm"}],"title":"Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems","file":[{"date_created":"2021-12-16T14:58:08Z","date_updated":"2021-12-16T14:58:08Z","success":1,"file_name":"2021_ArchRatMechAnalysis_Fischer.pdf","access_level":"open_access","checksum":"cc830b739aed83ca2e32c4e0ce266a4c","relation":"main_file","content_type":"application/pdf","file_id":"10558","file_size":1640121,"creator":"cchlebak"}],"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"article_type":"original","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"citation":{"apa":"Fischer, J. L., &#38; Neukamm, S. (2021). Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-021-01686-9\">https://doi.org/10.1007/s00205-021-01686-9</a>","mla":"Fischer, Julian L., and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 1, Springer Nature, 2021, pp. 343–452, doi:<a href=\"https://doi.org/10.1007/s00205-021-01686-9\">10.1007/s00205-021-01686-9</a>.","ama":"Fischer JL, Neukamm S. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. <i>Archive for Rational Mechanics and Analysis</i>. 2021;242(1):343-452. doi:<a href=\"https://doi.org/10.1007/s00205-021-01686-9\">10.1007/s00205-021-01686-9</a>","ieee":"J. L. Fischer and S. Neukamm, “Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 1. Springer Nature, pp. 343–452, 2021.","short":"J.L. Fischer, S. Neukamm, Archive for Rational Mechanics and Analysis 242 (2021) 343–452.","ista":"Fischer JL, Neukamm S. 2021. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics and Analysis. 242(1), 343–452.","chicago":"Fischer, Julian L, and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00205-021-01686-9\">https://doi.org/10.1007/s00205-021-01686-9</a>."},"scopus_import":"1","abstract":[{"lang":"eng","text":"We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on \\mathbb {R}^d with stationary law (that is spatially homogeneous statistics) and fast decay of correlations on scales larger than the microscale \\varepsilon >0, we establish homogenization error estimates of the order \\varepsilon in case d\\geqq 3, and of the order \\varepsilon |\\log \\varepsilon |^{1/2} in case d=2. Previous results in nonlinear stochastic homogenization have been limited to a small algebraic rate of convergence \\varepsilon ^\\delta . We also establish error estimates for the approximation of the homogenized operator by the method of representative volumes of the order (L/\\varepsilon )^{-d/2} for a representative volume of size L. Our results also hold in the case of systems for which a (small-scale) C^{1,\\alpha } regularity theory is available."}],"arxiv":1,"file_date_updated":"2021-12-16T14:58:08Z","type":"journal_article","_id":"10549","quality_controlled":"1","publication_status":"published"},{"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/2101.12617","open_access":"1"}],"publication":"38th International Conference on Machine Learning","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160"}],"oa_version":"Preprint","ec_funded":1,"type":"conference","arxiv":1,"abstract":[{"lang":"eng","text":"We study a class of convex-concave saddle-point problems of the form minxmaxy⟨Kx,y⟩+fP(x)−h∗(y) where K is a linear operator, fP is the sum of a convex function f with a Lipschitz-continuous gradient and the indicator function of a bounded convex polytope P, and h∗ is a convex (possibly nonsmooth) function. Such problem arises, for example, as a Lagrangian relaxation of various discrete optimization problems. Our main assumptions are the existence of an efficient linear minimization oracle (lmo) for fP and an efficient proximal map for h∗ which motivate the solution via a blend of proximal primal-dual algorithms and Frank-Wolfe algorithms. In case h∗ is the indicator function of a linear constraint and function f is quadratic, we show a O(1/n2) convergence rate on the dual objective, requiring O(nlogn) calls of lmo. If the problem comes from the constrained optimization problem minx∈Rd{fP(x)|Ax−b=0} then we additionally get bound O(1/n2) both on the primal gap and on the infeasibility gap. In the most general case, we show a O(1/n) convergence rate of the primal-dual gap again requiring O(nlogn) calls of lmo. To the best of our knowledge, this improves on the known convergence rates for the considered class of saddle-point problems. We show applications to labeling problems frequently appearing in machine learning and computer vision."}],"citation":{"apa":"Kolmogorov, V., &#38; Pock, T. (2021). One-sided Frank-Wolfe algorithms for saddle problems. In <i>38th International Conference on Machine Learning</i>. Virtual.","mla":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” <i>38th International Conference on Machine Learning</i>, 2021.","ieee":"V. Kolmogorov and T. Pock, “One-sided Frank-Wolfe algorithms for saddle problems,” in <i>38th International Conference on Machine Learning</i>, Virtual, 2021.","ista":"Kolmogorov V, Pock T. 2021. One-sided Frank-Wolfe algorithms for saddle problems. 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning.","short":"V. Kolmogorov, T. Pock, in:, 38th International Conference on Machine Learning, 2021.","ama":"Kolmogorov V, Pock T. One-sided Frank-Wolfe algorithms for saddle problems. In: <i>38th International Conference on Machine Learning</i>. ; 2021.","chicago":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” In <i>38th International Conference on Machine Learning</i>, 2021."},"day":"01","quality_controlled":"1","status":"public","date_created":"2021-12-16T12:41:20Z","_id":"10552","department":[{"_id":"VlKo"}],"conference":{"end_date":"2021-07-24","start_date":"2021-07-18","name":"ICML: International Conference on Machine Learning","location":"Virtual"},"external_id":{"arxiv":["2101.12617"]},"article_processing_charge":"No","year":"2021","language":[{"iso":"eng"}],"acknowledgement":"Vladimir Kolmogorov was supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160. Thomas Pock acknowledges support by an ERC grant HOMOVIS, no 640156.","month":"07","date_published":"2021-07-01T00:00:00Z","title":"One-sided Frank-Wolfe algorithms for saddle problems","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"first_name":"Thomas","last_name":"Pock","full_name":"Pock, Thomas"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"date_updated":"2021-12-17T09:06:46Z"},{"type":"conference","scopus_import":"1","abstract":[{"lang":"eng","text":"The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds -- optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live."}],"arxiv":1,"citation":{"chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alexander Spiegelman, and Zhuolun Xiang. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, 187–90. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>.","short":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, Z. Xiang, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 187–190.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, and Z. Xiang, “Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol,” in <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2021, pp. 187–190.","ista":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. 2021. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 187–190.","ama":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In: <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2021:187-190. doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>","mla":"Gelashvili, Rati, et al. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2021, pp. 187–90, doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>.","apa":"Gelashvili, R., Kokoris Kogias, E., Spiegelman, A., &#38; Xiang, Z. (2021). Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i> (pp. 187–190). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>"},"publication_identifier":{"isbn":["9-781-4503-8548-0"]},"quality_controlled":"1","_id":"10553","publication_status":"published","publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Spiegelman","first_name":"Alexander","full_name":"Spiegelman, Alexander"},{"full_name":"Xiang, Zhuolun","first_name":"Zhuolun","last_name":"Xiang"}],"title":"Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol","department":[{"_id":"ElKo"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"day":"21","status":"public","date_created":"2021-12-16T13:20:19Z","main_file_link":[{"url":"https://arxiv.org/abs/2103.03181","open_access":"1"}],"doi":"10.1145/3465084.3467941","publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","isi":1,"oa_version":"Preprint","month":"07","date_published":"2021-07-21T00:00:00Z","oa":1,"date_updated":"2023-09-04T11:42:10Z","keyword":["optimal","state machine replication","fallback","asynchrony","byzantine faults"],"conference":{"end_date":"2021-07-30","start_date":"2021-07-26","name":"PODC: Principles of Distributed Computing","location":"Virtual, Italy"},"page":"187-190","external_id":{"isi":["000744439800018"],"arxiv":["2103.03181"]},"year":"2021"},{"oa_version":"Preprint","isi":1,"publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","doi":"10.1145/3465084.3467905","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.08325"}],"day":"21","status":"public","date_created":"2021-12-16T13:21:13Z","year":"2021","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2021-07-26","end_date":"2021-07-30","location":"Virtual, Italy"},"page":"165-175","external_id":{"isi":["000744439800016"],"arxiv":["2102.08325"]},"oa":1,"date_updated":"2023-08-17T06:24:44Z","acknowledgement":"Oded Naor is grateful to the Technion Hiroshi Fujiwara Cyber-Security Research Center for providing a research grant. Part of Oded’s work was done while at Novi Research. This work was funded by the Novi team at Facebook. We also wish to thank the Novi Research team for valuable feedback, and in particular George Danezis, Alberto Sonnino, and Dahlia Malkhi.\r\n","date_published":"2021-07-21T00:00:00Z","month":"07","publication_status":"published","quality_controlled":"1","_id":"10554","scopus_import":"1","abstract":[{"lang":"eng","text":"We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all values proposed by correct processes eventually get delivered. We construct DAG-Rider in two layers: In the first layer, processes reliably broadcast their proposals and build a structured Directed Acyclic Graph (DAG) of the communication among them. In the second layer, processes locally observe their DAGs and totally order all proposals with no extra communication."}],"arxiv":1,"type":"conference","publication_identifier":{"isbn":["978-1-4503-8548-0"]},"citation":{"ista":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. 2021. All You Need is DAG. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 165–175.","ieee":"I. Keidar, E. Kokoris Kogias, O. Naor, and A. Spiegelman, “All You Need is DAG,” in <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2021, pp. 165–175.","short":"I. Keidar, E. Kokoris Kogias, O. Naor, A. Spiegelman, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 165–175.","ama":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. All You Need is DAG. In: <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2021:165-175. doi:<a href=\"https://doi.org/10.1145/3465084.3467905\">10.1145/3465084.3467905</a>","chicago":"Keidar, Idit, Eleftherios Kokoris Kogias, Oded Naor, and Alexander Spiegelman. “All You Need Is DAG.” In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, 165–75. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3465084.3467905\">https://doi.org/10.1145/3465084.3467905</a>.","apa":"Keidar, I., Kokoris Kogias, E., Naor, O., &#38; Spiegelman, A. (2021). All You Need is DAG. In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i> (pp. 165–175). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3465084.3467905\">https://doi.org/10.1145/3465084.3467905</a>","mla":"Keidar, Idit, et al. “All You Need Is DAG.” <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2021, pp. 165–75, doi:<a href=\"https://doi.org/10.1145/3465084.3467905\">10.1145/3465084.3467905</a>."},"language":[{"iso":"eng"}],"department":[{"_id":"ElKo"}],"article_processing_charge":"No","title":"All You Need is DAG","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Idit","last_name":"Keidar","full_name":"Keidar, Idit"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"},{"last_name":"Naor","first_name":"Oded","full_name":"Naor, Oded"},{"full_name":"Spiegelman, Alexander","last_name":"Spiegelman","first_name":"Alexander"}],"publisher":"Association for Computing Machinery"},{"publication":"Physical Review Research","doi":"10.1103/physrevresearch.3.l022005","ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"id":"8831","relation":"earlier_version","status":"public"},{"id":"8834","status":"public","relation":"research_data"}]},"volume":3,"day":"15","status":"public","ddc":["620"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-12-16T18:50:57Z","external_id":{"arxiv":["2012.00322"]},"year":"2021","acknowledgement":"This research and related results were made possible with the support of the NOMIS Foundation. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant agreement No. 844511 Grant Agreement No. 862046. ICN2 acknowledge funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autnoma de Barcelona Materials Science PhD program. The HAADF-STEM microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon-Universidad de Zaragoza. Authors acknowledge the LMA-INA for offering access to their instruments and expertise. We acknowledge support from CSIC Research Platform on Quantum Technologies PTI-001. This project has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. 823717 ESTEEM3. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. G.S. and M.V. acknowledge support through a projectruimte grant associated with the Netherlands Organization of Scientific Research (NWO). J.D. acknowledges support through FRIPRO-project 274853, which is funded by the Research Council of Norway.","article_number":"L022005","date_published":"2021-04-15T00:00:00Z","intvolume":"         3","month":"04","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"oa":1,"issue":"2","keyword":["general engineering"],"date_updated":"2024-02-21T12:41:26Z","publication_status":"published","project":[{"name":"Majorana bound states in Ge/SiGe heterostructures","_id":"26A151DA-B435-11E9-9278-68D0E5697425","grant_number":"844511","call_identifier":"H2020"},{"grant_number":"862046","call_identifier":"H2020","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Hole gases in planar germanium can have high mobilities in combination with strong spin-orbit interaction and electrically tunable g factors, and are therefore emerging as a promising platform for creating hybrid superconductor-semiconductor devices. A key challenge towards hybrid Ge-based quantum technologies is the design of high-quality interfaces and superconducting contacts that are robust against magnetic fields. In this work, by combining the assets of aluminum, which provides good contact to the Ge, and niobium, which has a significant superconducting gap, we demonstrate highly transparent low-disordered JoFETs with relatively large ICRN products that are capable of withstanding high magnetic fields. We furthermore demonstrate the ability of phase-biasing individual JoFETs, opening up an avenue to explore topological superconductivity in planar Ge. The persistence of superconductivity in the reported hybrid devices beyond 1.8 T paves the way towards integrating spin qubits and proximity-induced superconductivity on the same chip."}],"arxiv":1,"file_date_updated":"2021-12-17T08:12:37Z","type":"journal_article","citation":{"chicago":"Aggarwal, Kushagra, Andrea C Hofmann, Daniel Jirovec, Ivan Prieto Gonzalez, Amir Sammak, Marc Botifoll, Sara Martí-Sánchez, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” <i>Physical Review Research</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">https://doi.org/10.1103/physrevresearch.3.l022005</a>.","ieee":"K. Aggarwal <i>et al.</i>, “Enhancement of proximity-induced superconductivity in a planar Ge hole gas,” <i>Physical Review Research</i>, vol. 3, no. 2. American Physical Society, 2021.","short":"K. Aggarwal, A.C. Hofmann, D. Jirovec, I. Prieto Gonzalez, A. Sammak, M. Botifoll, S. Martí-Sánchez, M. Veldhorst, J. Arbiol, G. Scappucci, J. Danon, G. Katsaros, Physical Review Research 3 (2021).","ista":"Aggarwal K, Hofmann AC, Jirovec D, Prieto Gonzalez I, Sammak A, Botifoll M, Martí-Sánchez S, Veldhorst M, Arbiol J, Scappucci G, Danon J, Katsaros G. 2021. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical Review Research. 3(2), L022005.","ama":"Aggarwal K, Hofmann AC, Jirovec D, et al. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. <i>Physical Review Research</i>. 2021;3(2). doi:<a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">10.1103/physrevresearch.3.l022005</a>","mla":"Aggarwal, Kushagra, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” <i>Physical Review Research</i>, vol. 3, no. 2, L022005, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">10.1103/physrevresearch.3.l022005</a>.","apa":"Aggarwal, K., Hofmann, A. C., Jirovec, D., Prieto Gonzalez, I., Sammak, A., Botifoll, M., … Katsaros, G. (2021). Enhancement of proximity-induced superconductivity in a planar Ge hole gas. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">https://doi.org/10.1103/physrevresearch.3.l022005</a>"},"publication_identifier":{"issn":["2643-1564"]},"quality_controlled":"1","_id":"10559","department":[{"_id":"GeKa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"American Physical Society","has_accepted_license":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Aggarwal","orcid":"0000-0001-9985-9293","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","first_name":"Kushagra","full_name":"Aggarwal, Kushagra"},{"id":"340F461A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea C","last_name":"Hofmann","full_name":"Hofmann, Andrea C"},{"full_name":"Jirovec, Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","last_name":"Jirovec","orcid":"0000-0002-7197-4801"},{"full_name":"Prieto Gonzalez, Ivan","first_name":"Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","last_name":"Prieto Gonzalez","orcid":"0000-0002-7370-5357"},{"first_name":"Amir","last_name":"Sammak","full_name":"Sammak, Amir"},{"last_name":"Botifoll","first_name":"Marc","full_name":"Botifoll, Marc"},{"first_name":"Sara","last_name":"Martí-Sánchez","full_name":"Martí-Sánchez, Sara"},{"full_name":"Veldhorst, Menno","first_name":"Menno","last_name":"Veldhorst"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"last_name":"Scappucci","first_name":"Giordano","full_name":"Scappucci, Giordano"},{"first_name":"Jeroen","last_name":"Danon","full_name":"Danon, Jeroen"},{"full_name":"Katsaros, Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"}],"title":"Enhancement of proximity-induced superconductivity in a planar Ge hole gas","file":[{"file_id":"10561","content_type":"application/pdf","file_size":1917512,"creator":"cchlebak","access_level":"open_access","relation":"main_file","checksum":"60a1bc9c9b616b1b155044bb8cfc6484","success":1,"file_name":"2021_PhysRevResearch_Aggarwal.pdf","date_updated":"2021-12-17T08:12:37Z","date_created":"2021-12-17T08:12:37Z"}]}]