[{"external_id":{"arxiv":["2101.12566"]},"doi":"10.48550/arXiv.2101.12566","oa_version":"Preprint","ddc":["510"],"title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","article_processing_charge":"No","publication":"arXiv","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","department":[{"_id":"RoSe"}],"publication_status":"draft","ec_funded":1,"date_published":"2021-02-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12566"}],"corr_author":"1","status":"public","month":"02","year":"2021","author":[{"first_name":"Dario","last_name":"Feliciangeli","orcid":"0000-0003-0754-8530","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario"},{"last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"date_created":"2021-08-06T08:25:57Z","arxiv":1,"citation":{"ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.","apa":"Feliciangeli, D., &#38; Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>","ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” <i>arXiv</i>. .","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>.","short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, 2101.12566, doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>."},"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"2101.12566","type":"preprint","oa":1,"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T06:59:49Z","_id":"9787","related_material":{"record":[{"relation":"later_version","id":"10224","status":"public"},{"id":"9733","status":"public","relation":"dissertation_contains"}]},"day":"01"},{"_id":"9791","related_material":{"record":[{"relation":"later_version","id":"10755","status":"public"},{"relation":"dissertation_contains","status":"public","id":"9733"}]},"day":"08","citation":{"ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, 2107.03720, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>.","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720.","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” <i>arXiv</i>. .","apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>"},"article_number":"2107.03720 ","type":"preprint","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"abstract":[{"lang":"eng","text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar."}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T06:59:49Z","department":[{"_id":"RoSe"}],"publication_status":"draft","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.03720"}],"date_published":"2021-07-08T00:00:00Z","corr_author":"1","status":"public","month":"07","year":"2021","author":[{"last_name":"Feliciangeli","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530"},{"orcid":"0000-0001-5059-4466","full_name":"Rademacher, Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","first_name":"Simone Anna Elvira","last_name":"Rademacher"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer"}],"date_created":"2021-08-06T08:49:45Z","arxiv":1,"doi":"10.48550/arXiv.2107.03720","oa_version":"Preprint","external_id":{"arxiv":["2107.03720"]},"ddc":["510"],"OA_place":"repository","title":"The effective mass problem for the Landau-Pekar equations","article_processing_charge":"No","publication":"arXiv","acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.."},{"conference":{"end_date":"2021-07-23","name":"CAV: Computer Aided Verification ","location":"Virtual","start_date":"2021-07-20"},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","citation":{"mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” <i>33rd International Conference on Computer-Aided Verification </i>, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>.","ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: <i>33rd International Conference on Computer-Aided Verification </i>. Vol 12759. Springer Nature; 2021:341-366. doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>","short":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In <i>33rd International Conference on Computer-Aided Verification </i>, 12759:341–66. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>.","ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in <i>33rd International Conference on Computer-Aided Verification </i>, Virtual, 2021, vol. 12759, pp. 341–366.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., &#38; Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In <i>33rd International Conference on Computer-Aided Verification </i> (Vol. 12759, pp. 341–366). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>","ista":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366."},"date_updated":"2026-04-08T07:00:30Z","abstract":[{"text":"Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present   RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover,   RVF-SMC  generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"volume":"12759 ","type":"conference","page":"341-366","publisher":"Springer Nature","day":"15","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"_id":"9987","scopus_import":"1","alternative_title":["LNCS"],"title":"Stateless model checking under a reads-value-from equivalence","quality_controlled":"1","file":[{"relation":"main_file","date_created":"2022-05-13T07:00:20Z","date_updated":"2022-05-13T07:00:20Z","access_level":"open_access","file_name":"2021_LNCS_Agarwal.pdf","checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","success":1,"file_size":1516756,"content_type":"application/pdf","file_id":"11368","creator":"dernst"}],"oa_version":"Published Version","external_id":{"arxiv":["2105.06424"],"isi":["000698732400016"]},"file_date_updated":"2022-05-13T07:00:20Z","doi":"10.1007/978-3-030-81685-8_16","ddc":["000"],"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publication":"33rd International Conference on Computer-Aided Verification ","article_processing_charge":"Yes","corr_author":"1","ec_funded":1,"date_published":"2021-07-15T00:00:00Z","publication_status":"published","department":[{"_id":"KrCh"}],"isi":1,"date_created":"2021-09-05T22:01:24Z","arxiv":1,"author":[{"first_name":"Pratyush","last_name":"Agarwal","full_name":"Agarwal, Pratyush"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pathak, Shreya","last_name":"Pathak","first_name":"Shreya"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","first_name":"Viktor"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-81685-8"],"isbn":["978-3-030-81684-1"]},"year":"2021","status":"public","month":"07"},{"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","degree_awarded":"PhD","ec_funded":1,"date_published":"2021-10-31T00:00:00Z","corr_author":"1","status":"public","month":"10","year":"2021","author":[{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","first_name":"Viktor"}],"publication_identifier":{"issn":["2663-337X"]},"date_created":"2021-10-29T20:09:01Z","file_date_updated":"2021-11-09T09:00:50Z","oa_version":"Published Version","doi":"10.15479/at:ista:10199","ddc":["000"],"file":[{"relation":"main_file","file_name":"toman_th_final.pdf","access_level":"open_access","date_updated":"2021-11-08T14:12:22Z","date_created":"2021-11-08T14:12:22Z","creator":"vtoman","file_id":"10225","content_type":"application/pdf","file_size":2915234,"checksum":"4f412a1ee60952221b499a4b1268df35"},{"relation":"source_file","date_updated":"2021-11-09T09:00:50Z","date_created":"2021-11-08T14:12:46Z","access_level":"closed","file_name":"toman_thesis.zip","checksum":"9584943f99127be2dd2963f6784c37d4","file_size":8616056,"file_id":"10226","content_type":"application/zip","creator":"vtoman"}],"OA_place":"publisher","title":"Improved verification techniques for concurrent systems","acknowledged_ssus":[{"_id":"SSU"}],"alternative_title":["ISTA Thesis"],"article_processing_charge":"No","page":"166","_id":"10199","supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"related_material":{"record":[{"status":"public","id":"9987","relation":"part_of_dissertation"},{"id":"10191","status":"public","relation":"part_of_dissertation"},{"id":"141","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10190"}]},"day":"31","publisher":"Institute of Science and Technology Austria","citation":{"chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>.","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021."},"has_accepted_license":"1","keyword":["concurrency","verification","model checking"],"type":"dissertation","oa":1,"project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","abstract":[{"lang":"eng","text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness."}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T07:00:31Z"},{"abstract":[{"text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T07:00:31Z","keyword":["safety","risk","reliability and quality","software"],"type":"journal_article","volume":5,"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"OOPSLA","article_number":"164","citation":{"apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>.","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>"},"related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"publisher":"Association for Computing Machinery","day":"15","_id":"10191","article_type":"original","publication":"Proceedings of the ACM on Programming Languages","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","article_processing_charge":"No","title":"The reads-from equivalence for the TSO and PSO memory models","quality_controlled":"1","scopus_import":"1","external_id":{"arxiv":["2011.11763"]},"oa_version":"Published Version","file_date_updated":"2021-11-04T07:24:48Z","doi":"10.1145/3485541","ddc":["000"],"file":[{"access_level":"open_access","file_name":"2021_ProcACMPL_Bui.pdf","date_created":"2021-11-04T07:24:48Z","date_updated":"2021-11-04T07:24:48Z","file_id":"10215","creator":"cchlebak","content_type":"application/pdf","checksum":"9d6dce7b611853c529bb7b1915ac579e","success":1,"file_size":2903485,"relation":"main_file"}],"author":[{"last_name":"Bui","first_name":"Truc Lam","full_name":"Bui, Truc Lam"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Gautam","first_name":"Tushar","full_name":"Gautam, Tushar"},{"first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","first_name":"Viktor"}],"publication_identifier":{"eissn":["2475-1421"]},"intvolume":"         5","date_created":"2021-10-27T15:05:34Z","arxiv":1,"status":"public","month":"10","year":"2021","ec_funded":1,"date_published":"2021-10-15T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published"},{"related_material":{"record":[{"status":"public","id":"10012","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10013"},{"status":"public","id":"7489","relation":"part_of_dissertation"}]},"publisher":"Institute of Science and Technology Austria","day":"14","_id":"10007","supervisor":[{"last_name":"Fischer","first_name":"Julian L","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X"}],"page":"300","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis."}],"date_updated":"2026-04-08T07:01:01Z","type":"dissertation","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","name":"Bridging Scales in Random Materials"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"has_accepted_license":"1","citation":{"chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10007\">https://doi.org/10.15479/at:ista:10007</a>.","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","apa":"Hensel, S. (2021). <i>Curvature driven interface evolution: Uniqueness properties of weak solution concepts</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10007\">https://doi.org/10.15479/at:ista:10007</a>","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","mla":"Hensel, Sebastian. <i>Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10007\">10.15479/at:ista:10007</a>.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10007\">10.15479/at:ista:10007</a>","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021."},"publication_identifier":{"issn":["2663-337X"]},"author":[{"orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian","first_name":"Sebastian","last_name":"Hensel"}],"date_created":"2021-09-13T11:12:34Z","month":"09","status":"public","year":"2021","date_published":"2021-09-14T00:00:00Z","ec_funded":1,"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"degree_awarded":"PhD","publication_status":"published","article_processing_charge":"No","title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","alternative_title":["ISTA Thesis"],"ddc":["515"],"oa_version":"Published Version","file_date_updated":"2021-09-15T14:37:30Z","doi":"10.15479/at:ista:10007","file":[{"file_name":"thesis_final_Hensel.zip","access_level":"closed","date_updated":"2021-09-15T14:37:30Z","date_created":"2021-09-13T11:03:24Z","content_type":"application/x-zip-compressed","file_id":"10008","creator":"shensel","file_size":15022154,"checksum":"c8475faaf0b680b4971f638f1db16347","relation":"source_file"},{"relation":"main_file","file_name":"thesis_final_Hensel.pdf","access_level":"open_access","date_created":"2021-09-13T14:18:56Z","date_updated":"2021-09-14T09:52:47Z","content_type":"application/pdf","creator":"shensel","file_id":"10014","file_size":6583638,"checksum":"1a609937aa5275452822f45f2da17f07"}],"OA_place":"publisher"},{"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"degree_awarded":"PhD","publication_status":"published","date_published":"2021-12-09T00:00:00Z","ec_funded":1,"corr_author":"1","month":"12","status":"public","year":"2021","publication_identifier":{"issn":["2663-337X"]},"author":[{"last_name":"Nadiradze","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731"}],"date_created":"2021-12-08T21:52:28Z","ddc":["000"],"doi":"10.15479/at:ista:10429","oa_version":"Published Version","file_date_updated":"2022-03-28T12:55:12Z","file":[{"date_updated":"2021-12-09T17:47:49Z","date_created":"2021-12-09T17:47:49Z","file_name":"Thesis_Final_09_12_2021.pdf","access_level":"open_access","file_size":2370859,"checksum":"6bf14e9a523387328f016c0689f5e10e","success":1,"content_type":"application/pdf","creator":"gnadirad","file_id":"10436","relation":"main_file"},{"access_level":"closed","file_name":"Thesis_Final_09_12_2021.zip","date_updated":"2022-03-28T12:55:12Z","date_created":"2021-12-09T17:47:49Z","file_id":"10437","creator":"gnadirad","content_type":"application/zip","checksum":"914d6c5ca86bd0add471971a8f4c4341","file_size":2596924,"relation":"source_file"}],"OA_place":"publisher","title":"On achieving scalability through relaxation","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","page":"132","_id":"10429","supervisor":[{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"10435","status":"public"},{"relation":"part_of_dissertation","id":"10432","status":"public"},{"status":"public","id":"6673","relation":"part_of_dissertation"},{"id":"5965","status":"public","relation":"part_of_dissertation"}]},"day":"09","publisher":"Institute of Science and Technology Austria","citation":{"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.","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>.","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.","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>.","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>"},"has_accepted_license":"1","type":"dissertation","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"date_updated":"2026-04-08T07:00:46Z"},{"year":"2021","status":"public","month":"12","date_created":"2021-12-09T10:59:12Z","arxiv":1,"author":[{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba","first_name":"Amirmojtaba","last_name":"Sabour"},{"full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","last_name":"Davies","first_name":"Peter"},{"last_name":"Li","first_name":"Shigang","full_name":"Li, Shigang"},{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"publication_status":"published","department":[{"_id":"DaAl"}],"ec_funded":1,"date_published":"2021-12-01T00:00:00Z","main_file_link":[{"url":"https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html","open_access":"1"}],"article_processing_charge":"No","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","publication":"35th Conference on Neural Information Processing Systems","oa_version":"Published Version","external_id":{"arxiv":["1910.12308"]},"title":"Asynchronous decentralized SGD with quantized and local updates","quality_controlled":"1","_id":"10435","publisher":"Neural Information Processing Systems Foundation","day":"01","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10429"}]},"oa":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2026-04-08T07:00:45Z","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."}],"language":[{"iso":"eng"}],"citation":{"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.","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.","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.","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.","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.","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.","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."},"conference":{"start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-14","location":"Sydney, Australia"}},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10429"}]},"day":"18","_id":"10432","page":"9037-9045","language":[{"iso":"eng"}],"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."}],"date_updated":"2026-04-08T07:00:45Z","volume":35,"type":"conference","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"conference":{"start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual"},"issue":"10","citation":{"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.","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.","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.","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.","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.","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.","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."},"intvolume":"        35","author":[{"first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Markov","first_name":"Ilia","full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"first_name":"Bapi","last_name":"Chatterjee","orcid":"0000-0002-2742-4028","full_name":"Chatterjee, Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kungurtsev, Vyacheslav ","last_name":"Kungurtsev","first_name":"Vyacheslav "},{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"arxiv":1,"date_created":"2021-12-09T09:21:35Z","month":"05","status":"public","year":"2021","date_published":"2021-05-18T00:00:00Z","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092","open_access":"1"}],"ec_funded":1,"department":[{"_id":"DaAl"}],"publication_status":"published","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","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).","article_processing_charge":"No","quality_controlled":"1","title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","oa_version":"Published Version","external_id":{"arxiv":["2001.05918"]}},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.01733"}],"date_published":"2021-08-03T00:00:00Z","ec_funded":1,"corr_author":"1","department":[{"_id":"JuFi"}],"publication_status":"draft","author":[{"orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Hensel"},{"last_name":"Laux","first_name":"Tim","full_name":"Laux, Tim"}],"arxiv":1,"date_created":"2021-09-13T12:17:11Z","month":"08","status":"public","year":"2021","title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","external_id":{"arxiv":["2108.01733"]},"oa_version":"Preprint","doi":"10.48550/arXiv.2108.01733","publication":"arXiv","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","article_processing_charge":"No","related_material":{"record":[{"relation":"later_version","status":"public","id":"13043"},{"id":"10007","status":"public","relation":"dissertation_contains"}]},"day":"03","_id":"10013","article_number":"2108.01733","citation":{"ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733.","ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” <i>arXiv</i>. .","chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2108.01733\">https://doi.org/10.48550/arXiv.2108.01733</a>.","apa":"Hensel, S., &#38; Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2108.01733\">https://doi.org/10.48550/arXiv.2108.01733</a>","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2108.01733\">10.48550/arXiv.2108.01733</a>","short":"S. Hensel, T. Laux, ArXiv (n.d.).","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” <i>ArXiv</i>, 2108.01733, doi:<a href=\"https://doi.org/10.48550/arXiv.2108.01733\">10.48550/arXiv.2108.01733</a>."},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions."}],"date_updated":"2026-04-08T07:01:01Z","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Bridging Scales in Random Materials","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020"}],"oa":1},{"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"degree_awarded":"PhD","publication_status":"published","date_published":"2021-05-30T00:00:00Z","corr_author":"1","month":"05","status":"public","year":"2021","publication_identifier":{"issn":["2663-337X"]},"author":[{"first_name":"Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"}],"date_created":"2021-05-24T13:06:23Z","ddc":["000"],"doi":"10.15479/AT:ISTA:9418","oa_version":"Published Version","file_date_updated":"2021-05-24T11:56:02Z","file":[{"file_id":"9419","content_type":"application/pdf","creator":"bphuong","file_size":2673905,"checksum":"4f0abe64114cfed264f9d36e8d1197e3","success":1,"file_name":"mph-thesis-v519-pdfimages.pdf","access_level":"open_access","date_created":"2021-05-24T11:22:29Z","date_updated":"2021-05-24T11:22:29Z","relation":"main_file"},{"relation":"source_file","date_created":"2021-05-24T11:56:02Z","date_updated":"2021-05-24T11:56:02Z","file_name":"thesis.zip","access_level":"closed","file_size":92995100,"checksum":"f5699e876bc770a9b0df8345a77720a2","file_id":"9420","content_type":"application/zip","creator":"bphuong"}],"OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"title":"Underspecification in deep learning","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","page":"125","_id":"9418","supervisor":[{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"related_material":{"record":[{"id":"7435","status":"deleted","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7481","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"9416"},{"relation":"part_of_dissertation","id":"7479","status":"public"}]},"publisher":"Institute of Science and Technology Austria","day":"30","citation":{"ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021."},"has_accepted_license":"1","type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"language":[{"iso":"eng"}],"abstract":[{"text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models.","lang":"eng"}],"date_updated":"2026-04-08T07:01:17Z"},{"file":[{"relation":"source_file","creator":"patrickd","file_id":"9063","content_type":"application/zip","checksum":"bcf27986147cab0533b6abadd74e7629","file_size":13446994,"access_level":"closed","file_name":"thesis_source.zip","date_updated":"2021-02-03T10:37:28Z","date_created":"2021-02-02T14:09:25Z"},{"relation":"main_file","file_name":"thesis_pdfA2b.pdf","access_level":"open_access","date_updated":"2021-02-02T14:09:18Z","date_created":"2021-02-02T14:09:18Z","creator":"patrickd","file_id":"9064","content_type":"application/pdf","file_size":5210329,"success":1,"checksum":"9cc8af266579a464385bbe2aff6af606"}],"OA_place":"publisher","doi":"10.15479/AT:ISTA:9056","file_date_updated":"2021-02-03T10:37:28Z","oa_version":"Published Version","ddc":["006","514","516"],"alternative_title":["ISTA Thesis"],"title":"Multi-cover persistence and Delaunay mosaics","article_processing_charge":"No","publication_status":"published","degree_awarded":"PhD","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"corr_author":"1","date_published":"2021-02-01T00:00:00Z","year":"2021","status":"public","month":"02","date_created":"2021-02-02T14:11:06Z","author":[{"orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","last_name":"Osang"}],"publication_identifier":{"issn":["2663-337X"]},"citation":{"mla":"Osang, Georg F. <i>Multi-Cover Persistence and Delaunay Mosaics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>.","ama":"Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>","short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021.","chicago":"Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>.","ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","apa":"Osang, G. F. (2021). <i>Multi-cover persistence and Delaunay mosaics</i>. Institute of Science and Technology Austria, Klosterneuburg. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","type":"dissertation","date_updated":"2026-04-08T07:01:30Z","abstract":[{"text":"In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"134","supervisor":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"place":"Klosterneuburg","_id":"9056","publisher":"Institute of Science and Technology Austria","day":"01","related_material":{"record":[{"relation":"part_of_dissertation","id":"187","status":"public"},{"status":"public","id":"8703","relation":"part_of_dissertation"}]}},{"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publication_status":"published","main_file_link":[{"url":"https://openreview.net/pdf?id=krz7T0xU9Z_","open_access":"1"}],"date_published":"2021-05-01T00:00:00Z","corr_author":"1","month":"05","status":"public","year":"2021","author":[{"first_name":"Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"date_created":"2021-05-24T11:16:46Z","ddc":["000"],"file_date_updated":"2021-05-24T11:15:57Z","oa_version":"Published Version","file":[{"relation":"main_file","checksum":"f34ff17017527db5ba6927f817bdd125","file_size":502356,"file_id":"9417","content_type":"application/pdf","creator":"bphuong","date_created":"2021-05-24T11:15:57Z","date_updated":"2021-05-24T11:15:57Z","access_level":"open_access","file_name":"iclr2021_conference.pdf"}],"quality_controlled":"1","title":"The inductive bias of ReLU networks on orthogonally separable data","scopus_import":"1","article_processing_charge":"No","publication":"9th International Conference on Learning Representations","_id":"9416","related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"day":"01","citation":{"chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021.","ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021."},"has_accepted_license":"1","conference":{"location":"Virtual","end_date":"2021-05-07","name":"ICLR: International Conference on Learning Representations","start_date":"2021-05-03"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"abstract":[{"text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.","lang":"eng"}],"date_updated":"2026-04-08T07:01:16Z"},{"page":"486-515","place":"Cham","_id":"10041","publisher":"Springer Nature","day":"11","related_material":{"record":[{"status":"public","id":"10035","relation":"dissertation_contains"}]},"citation":{"chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual International Cryptology Conference, Part II </i>, 12826:486–515. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology Conference, Part II </i>, Virtual, 2021, vol. 12826, pp. 486–515.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology Conference, Part II </i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” <i>41st Annual International Cryptology Conference, Part II </i>, vol. 12826, Springer Nature, 2021, pp. 486–515, doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference, Part II </i>. Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515."},"conference":{"start_date":"2021-08-16","location":"Virtual","end_date":"2021-08-20","name":"CRYPTO: Annual International Cryptology Conference"},"oa":1,"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":12826,"type":"conference","date_updated":"2026-04-08T07:01:43Z","abstract":[{"text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth   δ , the loss in security is at most exponential in   δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth  δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in   δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"KrPi"}],"ec_funded":1,"date_published":"2021-08-11T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/945"}],"year":"2021","status":"public","month":"08","isi":1,"date_created":"2021-09-23T14:06:15Z","author":[{"first_name":"Chethan","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"intvolume":"     12826","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["978-3-030-84244-4"],"eisbn":["978-3-030-84245-1"]},"external_id":{"isi":["000696697800017"]},"doi":"10.1007/978-3-030-84245-1_17","oa_version":"Preprint","scopus_import":"1","alternative_title":["LCNS"],"title":"Limits on the Adaptive Security of Yao’s Garbling","quality_controlled":"1","article_processing_charge":"No","acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","publication":"41st Annual International Cryptology Conference, Part II "},{"status":"public","month":"08","year":"2021","author":[{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein"},{"orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","last_name":"Pascual Perez"},{"orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael","first_name":"Michael","last_name":"Walter"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"full_name":"Capretto, Margarita","last_name":"Capretto","first_name":"Margarita"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","full_name":"Cueto Noval, Miguel","orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","first_name":"Miguel"},{"last_name":"Markov","first_name":"Ilia","full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"orcid":"0009-0001-3676-4809","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X","last_name":"Yeo"},{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"}],"isi":1,"date_created":"2021-09-27T13:46:27Z","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"publication_status":"published","ec_funded":1,"date_published":"2021-08-26T00:00:00Z","main_file_link":[{"url":"https://eprint.iacr.org/2019/1489","open_access":"1"}],"corr_author":"1","article_processing_charge":"No","publication":"2021 IEEE Symposium on Security and Privacy ","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","doi":"10.1109/sp40001.2021.00035","oa_version":"Preprint","external_id":{"isi":["001316065000016"]},"title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","quality_controlled":"1","scopus_import":"1","_id":"10049","related_material":{"record":[{"status":"public","id":"18088","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"10035"}]},"day":"26","publisher":"IEEE","page":"268-284","type":"conference","oa":1,"project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T07:01:44Z","citation":{"ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In <i>2021 IEEE Symposium on Security and Privacy </i>, 268–84. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>.","ieee":"K. Klein <i>et al.</i>, “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in <i>2021 IEEE Symposium on Security and Privacy </i>, San Francisco, CA, United States, 2021, pp. 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In <i>2021 IEEE Symposium on Security and Privacy </i> (pp. 268–284). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: <i>2021 IEEE Symposium on Security and Privacy </i>. IEEE; 2021:268-284. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” <i>2021 IEEE Symposium on Security and Privacy </i>, IEEE, 2021, pp. 268–84, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>."},"conference":{"start_date":"2021-05-24","location":"San Francisco, CA, United States","end_date":"2021-05-27","name":"SP: Symposium on Security and Privacy"}},{"date_created":"2021-09-27T12:52:05Z","day":"08","publisher":"International Association for Cryptologic Research","author":[{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter"}],"related_material":{"record":[{"status":"public","id":"10410","relation":"later_version"},{"relation":"dissertation_contains","status":"public","id":"10035"}]},"year":"2021","status":"public","month":"07","_id":"10048","date_published":"2021-07-08T00:00:00Z","main_file_link":[{"url":"https://ia.cr/2021/059","open_access":"1"}],"publication_status":"published","department":[{"_id":"KrPi"}],"date_updated":"2026-04-08T07:01:43Z","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\r\nframework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower\r\nbounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and\r\nbroadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques.\r\n","lang":"eng"}],"publication":"19th Theory of Cryptography Conference 2021","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","article_processing_charge":"No","conference":{"location":"Raleigh, NC, United States","end_date":"2021-11-11","name":"TCC: Theory of Cryptography Conference","start_date":"2021-11-08"},"title":"The cost of adaptivity in security games on graphs","quality_controlled":"1","oa_version":"Preprint","citation":{"chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research, 2021.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in <i>19th Theory of Cryptography Conference 2021</i>, Raleigh, NC, United States, 2021.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2021). The cost of adaptivity in security games on graphs. In <i>19th Theory of Cryptography Conference 2021</i>. Raleigh, NC, United States: International Association for Cryptologic Research.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference.","mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” <i>19th Theory of Cryptography Conference 2021</i>, International Association for Cryptologic Research, 2021.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research; 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021."}},{"month":"07","_id":"10044","status":"public","year":"2021","related_material":{"record":[{"relation":"later_version","status":"public","id":"10409"},{"relation":"dissertation_contains","status":"public","id":"10035"}]},"author":[{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"day":"08","publisher":"International Association for Cryptologic Research","date_created":"2021-09-24T12:01:34Z","department":[{"_id":"KrPi"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"date_published":"2021-07-08T00:00:00Z","ec_funded":1,"article_processing_charge":"No","type":"conference","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"language":[{"iso":"eng"}],"publication":"19th Theory of Cryptography Conference 2021","abstract":[{"lang":"eng","text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity."}],"acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling.  ","date_updated":"2026-04-08T07:01:43Z","oa_version":"Preprint","citation":{"ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research, 2021.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in <i>19th Theory of Cryptography Conference 2021</i>, Raleigh, NC, United States, 2021.","apa":"Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In <i>19th Theory of Cryptography Conference 2021</i>. Raleigh, NC, United States: International Association for Cryptologic Research.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research; 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” <i>19th Theory of Cryptography Conference 2021</i>, 2021/926, International Association for Cryptologic Research, 2021."},"quality_controlled":"1","title":"On treewidth, separators and Yao's garbling","article_number":"2021/926","conference":{"start_date":"2021-11-08","end_date":"2021-11-11","name":"TCC: Theory of Cryptography Conference","location":"Raleigh, NC, United States"}},{"department":[{"_id":"SiHi"}],"publication_status":"published","ec_funded":1,"date_published":"2021-11-10T00:00:00Z","corr_author":"1","status":"public","month":"11","year":"2021","author":[{"last_name":"Amberg","first_name":"Nicole","full_name":"Amberg, Nicole","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3183-8207"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","first_name":"Simon"}],"publication_identifier":{"eissn":["2666-1667"]},"intvolume":"         2","date_created":"2021-11-21T23:01:28Z","doi":"10.1016/j.xpro.2021.100939","file_date_updated":"2021-11-22T08:23:58Z","oa_version":"Published Version","ddc":["573"],"file":[{"relation":"main_file","file_name":"2021_STARProtocols_Amberg.pdf","access_level":"open_access","date_updated":"2021-11-22T08:23:58Z","date_created":"2021-11-22T08:23:58Z","content_type":"application/pdf","file_id":"10329","creator":"cchlebak","file_size":7309464,"success":1,"checksum":"9e3f6d06bf583e7a8b6a9e9a60500a28"}],"title":"Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers","quality_controlled":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"scopus_import":"1","article_processing_charge":"Yes","publication":"STAR Protocols","acknowledgement":"This research was supported by the Scientific Service Units (SSU) at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical Facilities (PCF). We particularly thank Mohammad Goudarzi for assistance with photography of mouse perfusion and dissection. N.A. received support from FWF Firnberg-Programm (T 1031). This work was also supported by IST Austria institutional funds; FWF SFB F78 to S.H.; and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro) to S.H.","_id":"10321","article_type":"original","day":"10","publisher":"Cell Press","citation":{"mla":"Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate Genes in Mice Using Mosaic Analysis with Double Markers.” <i>STAR Protocols</i>, vol. 2, no. 4, 100939, Cell Press, 2021, doi:<a href=\"https://doi.org/10.1016/j.xpro.2021.100939\">10.1016/j.xpro.2021.100939</a>.","short":"N. Amberg, S. Hippenmeyer, STAR Protocols 2 (2021).","ama":"Amberg N, Hippenmeyer S. Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers. <i>STAR Protocols</i>. 2021;2(4). doi:<a href=\"https://doi.org/10.1016/j.xpro.2021.100939\">10.1016/j.xpro.2021.100939</a>","apa":"Amberg, N., &#38; Hippenmeyer, S. (2021). Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers. <i>STAR Protocols</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.xpro.2021.100939\">https://doi.org/10.1016/j.xpro.2021.100939</a>","ieee":"N. Amberg and S. Hippenmeyer, “Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers,” <i>STAR Protocols</i>, vol. 2, no. 4. Cell Press, 2021.","chicago":"Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate Genes in Mice Using Mosaic Analysis with Double Markers.” <i>STAR Protocols</i>. Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.xpro.2021.100939\">https://doi.org/10.1016/j.xpro.2021.100939</a>.","ista":"Amberg N, Hippenmeyer S. 2021. Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers. STAR Protocols. 2(4), 100939."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","issue":"4","article_number":"100939","type":"journal_article","volume":2,"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"},{"name":"Role of Eed in neural stem cell lineage progression","_id":"268F8446-B435-11E9-9278-68D0E5697425","grant_number":"T01031","call_identifier":"FWF"},{"name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E","grant_number":"F7805"}],"abstract":[{"text":"Mosaic analysis with double markers (MADM) technology enables the generation of genetic mosaic tissue in mice. MADM enables concomitant fluorescent cell labeling and introduction of a mutation of a gene of interest with single-cell resolution. This protocol highlights major steps for the generation of genetic mosaic tissue and the isolation and processing of respective tissues for downstream histological analysis. For complete details on the use and execution of this protocol, please refer to Contreras et al. (2021).","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:23:07Z"},{"ec_funded":1,"date_published":"2021-02-03T00:00:00Z","department":[{"_id":"SiHi"}],"publication_status":"published","author":[{"full_name":"Hanganu-Opatz, Ileana L.","first_name":"Ileana L.","last_name":"Hanganu-Opatz"},{"full_name":"Butt, Simon J. B.","first_name":"Simon J. B.","last_name":"Butt"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","first_name":"Simon"},{"full_name":"De Marco García, Natalia V.","last_name":"De Marco García","first_name":"Natalia V."},{"last_name":"Cardin","first_name":"Jessica A.","full_name":"Cardin, Jessica A."},{"first_name":"Bradley","last_name":"Voytek","full_name":"Voytek, Bradley"},{"full_name":"Muotri, Alysson R.","first_name":"Alysson R.","last_name":"Muotri"}],"intvolume":"        41","publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"date_created":"2021-02-03T12:23:51Z","isi":1,"status":"public","month":"02","year":"2021","title":"The logic of developing neocortical circuits in health and disease","quality_controlled":"1","scopus_import":"1","file_date_updated":"2022-05-27T06:59:55Z","oa_version":"Published Version","external_id":{"pmid":["33431633"],"isi":["000616763400002"]},"doi":"10.1523/jneurosci.1655-20.2020","ddc":["570"],"file":[{"file_name":"2021_JourNeuroscience_Hanganu.pdf","access_level":"open_access","date_updated":"2022-05-27T06:59:55Z","date_created":"2022-05-27T06:59:55Z","creator":"dernst","content_type":"application/pdf","file_id":"11414","file_size":1031150,"success":1,"checksum":"578fd7ed1a0aef74bce61bea2d987b33","relation":"main_file"}],"pmid":1,"publication":"The Journal of Neuroscience","acknowledgement":"Work in the I.L.H.-O. laboratory was supported by European Research Council Grant ERC-2015-CoG 681577 and German Research Foundation Ha 4466/10-1, Ha4466/11-1, Ha4466/12-1, SPP 1665, and SFB 936B5. Work in the S.J.B.B. laboratory was supported by Biotechnology and Biological Sciences Research Council BB/P003796/1, Medical Research Council MR/K004387/1 and MR/T033320/1, Wellcome Trust 215199/Z/19/Z and 102386/Z/13/Z, and John Fell Fund. Work in the S.H. laboratory was supported by European Research Council Grants ERC-2016-CoG 725780 LinPro and FWF SFB F78. This work was supported by National Institutes of Health Grant NIMH 1R01MH110553 to N.V.D.M.G. Work in the J.A.C. laboratory was supported by the Ludwig Family Foundation, Simons Foundation SFARI Research Award, and National Institutes of Health/National Institute of Mental Health R01 MH102365 and R01MH113852. The B.V. laboratory was supported by Whitehall Foundation 2017-12-73, National Science Foundation 1736028, National Institutes of Health, National Institute of General Medical Sciences R01GM134363-01, and Halıcıoğlu Data Science Institute Fellowship. This work was supported by the University of California San Diego School of Medicine.","article_processing_charge":"No","page":"813-822","publisher":"Society for Neuroscience","day":"03","article_type":"original","_id":"9073","has_accepted_license":"1","issue":"5","citation":{"ieee":"I. L. Hanganu-Opatz <i>et al.</i>, “The logic of developing neocortical circuits in health and disease,” <i>The Journal of Neuroscience</i>, vol. 41, no. 5. Society for Neuroscience, pp. 813–822, 2021.","chicago":"Hanganu-Opatz, Ileana L., Simon J. B. Butt, Simon Hippenmeyer, Natalia V. De Marco García, Jessica A. Cardin, Bradley Voytek, and Alysson R. Muotri. “The Logic of Developing Neocortical Circuits in Health and Disease.” <i>The Journal of Neuroscience</i>. Society for Neuroscience, 2021. <a href=\"https://doi.org/10.1523/jneurosci.1655-20.2020\">https://doi.org/10.1523/jneurosci.1655-20.2020</a>.","apa":"Hanganu-Opatz, I. L., Butt, S. J. B., Hippenmeyer, S., De Marco García, N. V., Cardin, J. A., Voytek, B., &#38; Muotri, A. R. (2021). The logic of developing neocortical circuits in health and disease. <i>The Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/jneurosci.1655-20.2020\">https://doi.org/10.1523/jneurosci.1655-20.2020</a>","ista":"Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, De Marco García NV, Cardin JA, Voytek B, Muotri AR. 2021. The logic of developing neocortical circuits in health and disease. The Journal of Neuroscience. 41(5), 813–822.","mla":"Hanganu-Opatz, Ileana L., et al. “The Logic of Developing Neocortical Circuits in Health and Disease.” <i>The Journal of Neuroscience</i>, vol. 41, no. 5, Society for Neuroscience, 2021, pp. 813–22, doi:<a href=\"https://doi.org/10.1523/jneurosci.1655-20.2020\">10.1523/jneurosci.1655-20.2020</a>.","ama":"Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, et al. The logic of developing neocortical circuits in health and disease. <i>The Journal of Neuroscience</i>. 2021;41(5):813-822. doi:<a href=\"https://doi.org/10.1523/jneurosci.1655-20.2020\">10.1523/jneurosci.1655-20.2020</a>","short":"I.L. Hanganu-Opatz, S.J.B. Butt, S. Hippenmeyer, N.V. De Marco García, J.A. Cardin, B. Voytek, A.R. Muotri, The Journal of Neuroscience 41 (2021) 813–822."},"abstract":[{"lang":"eng","text":"The sensory and cognitive abilities of the mammalian neocortex are underpinned by intricate columnar and laminar circuits formed from an array of diverse neuronal populations. One approach to determining how interactions between these circuit components give rise to complex behavior is to investigate the rules by which cortical circuits are formed and acquire functionality during development. This review summarizes recent research on the development of the neocortex, from genetic determination in neural stem cells through to the dynamic role that specific neuronal populations play in the earliest circuits of neocortex, and how they contribute to emergent function and cognition. While many of these endeavors take advantage of model systems, consideration will also be given to advances in our understanding of activity in nascent human circuits. Such cross-species perspective is imperative when investigating the mechanisms underlying the dysfunction of early neocortical circuits in neurodevelopmental disorders, so that one can identify targets amenable to therapeutic intervention."}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:23:06Z","keyword":["General Neuroscience"],"volume":41,"type":"journal_article","oa":1,"project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F7805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"publication_identifier":{"eissn":["2073-4425"]},"intvolume":"        12","author":[{"full_name":"Vasic, Verica","last_name":"Vasic","first_name":"Verica"},{"full_name":"Jones, Mattson S.O.","last_name":"Jones","first_name":"Mattson S.O."},{"last_name":"Haslinger","first_name":"Denise","id":"76922BDA-3D3B-11EA-90BD-A44F3DDC885E","full_name":"Haslinger, Denise"},{"first_name":"Lisa","last_name":"Knaus","full_name":"Knaus, Lisa","id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmeisser, Michael J.","first_name":"Michael J.","last_name":"Schmeisser"},{"first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chiocchetti, Andreas G.","first_name":"Andreas G.","last_name":"Chiocchetti"}],"date_created":"2021-11-14T23:01:24Z","isi":1,"month":"10","status":"public","year":"2021","date_published":"2021-10-30T00:00:00Z","ec_funded":1,"department":[{"_id":"GaNo"}],"publication_status":"published","publication":"Genes","acknowledgement":"This review was funded by the IMI2 Initiative under the grant AIMS-2-TRIALS No 777394, by the Hessian Ministry for Science and Arts; State of Hesse Ministry for Science and Arts: LOEWE-Grant to the CePTER-Consortium (www.uni-frankfurt.de/67689811); Research (BMBF) under the grant RAISE-genic No 779282 all to AGC. This work was also supported by the European Union’s Horizon 2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM) and by the Austrian Science Fund (FWF) (DK W1232-B24) both to G.N. and both BMBF GeNeRARe 01GM1519A and CRC 1080, project B10, of the German Research Foundation (DFG) to M.J.S, respectively. We want to thank R. Waltes for her support in preparing this manuscript.","article_processing_charge":"No","quality_controlled":"1","title":"Translating the role of mtor-and ras-associated signalopathies in autism spectrum disorder: Models, mechanisms and treatment","alternative_title":["Special Issue \"From Genes to Therapy in Autism Spectrum Disorder\""],"scopus_import":"1","ddc":["570"],"external_id":{"isi":["000834044200002"]},"doi":"10.3390/genes12111746","file_date_updated":"2022-05-16T07:02:27Z","oa_version":"Published Version","file":[{"relation":"main_file","date_updated":"2022-05-16T07:02:27Z","date_created":"2022-05-16T07:02:27Z","file_name":"2021_Genes_Vasic.pdf","access_level":"open_access","file_size":1335308,"success":1,"checksum":"256cb832a9c3051c7dc741f6423b8cbd","file_id":"11380","content_type":"application/pdf","creator":"dernst"}],"day":"30","publisher":"MDPI","_id":"10281","article_type":"original","language":[{"iso":"eng"}],"abstract":[{"text":"Mutations affecting mTOR or RAS signaling underlie defined syndromes (the so-called mTORopathies and RASopathies) with high risk for Autism Spectrum Disorder (ASD). These syndromes show a broad variety of somatic phenotypes including cancers, skin abnormalities, heart disease and facial dysmorphisms. Less well studied are the neuropsychiatric symptoms such as ASD. Here, we assess the relevance of these signalopathies in ASD reviewing genetic, human cell model, rodent studies and clinical trials. We conclude that signalopathies have an increased liability for ASD and that, in particular, ASD individuals with dysmorphic features and intellectual disability (ID) have a higher chance for disruptive mutations in RAS- and mTOR-related genes. Studies on rodent and human cell models confirm aberrant neuronal development as the underlying pathology. Human studies further suggest that multiple hits are necessary to induce the respective phenotypes. Recent clinical trials do only report improvements for comorbid conditions such as epilepsy or cancer but not for behavioral aspects. Animal models show that treatment during early development can rescue behavioral phenotypes. Taken together, we suggest investigating the differential roles of mTOR and RAS signaling in both human and rodent models, and to test drug treatment both during and after neuronal development in the available model systems","lang":"eng"}],"date_updated":"2025-04-15T07:29:28Z","volume":12,"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25444568-B435-11E9-9278-68D0E5697425","grant_number":"715508","call_identifier":"H2020","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models"},{"call_identifier":"FWF","grant_number":"W1232","_id":"2548AE96-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets"}],"oa":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","article_number":"1746","issue":"11","citation":{"mla":"Vasic, Verica, et al. “Translating the Role of Mtor-and Ras-Associated Signalopathies in Autism Spectrum Disorder: Models, Mechanisms and Treatment.” <i>Genes</i>, vol. 12, no. 11, 1746, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/genes12111746\">10.3390/genes12111746</a>.","ama":"Vasic V, Jones MSO, Haslinger D, et al. Translating the role of mtor-and ras-associated signalopathies in autism spectrum disorder: Models, mechanisms and treatment. <i>Genes</i>. 2021;12(11). doi:<a href=\"https://doi.org/10.3390/genes12111746\">10.3390/genes12111746</a>","short":"V. Vasic, M.S.O. Jones, D. Haslinger, L. Knaus, M.J. Schmeisser, G. Novarino, A.G. Chiocchetti, Genes 12 (2021).","ieee":"V. Vasic <i>et al.</i>, “Translating the role of mtor-and ras-associated signalopathies in autism spectrum disorder: Models, mechanisms and treatment,” <i>Genes</i>, vol. 12, no. 11. MDPI, 2021.","chicago":"Vasic, Verica, Mattson S.O. Jones, Denise Haslinger, Lisa Knaus, Michael J. Schmeisser, Gaia Novarino, and Andreas G. Chiocchetti. “Translating the Role of Mtor-and Ras-Associated Signalopathies in Autism Spectrum Disorder: Models, Mechanisms and Treatment.” <i>Genes</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/genes12111746\">https://doi.org/10.3390/genes12111746</a>.","apa":"Vasic, V., Jones, M. S. O., Haslinger, D., Knaus, L., Schmeisser, M. J., Novarino, G., &#38; Chiocchetti, A. G. (2021). Translating the role of mtor-and ras-associated signalopathies in autism spectrum disorder: Models, mechanisms and treatment. <i>Genes</i>. MDPI. <a href=\"https://doi.org/10.3390/genes12111746\">https://doi.org/10.3390/genes12111746</a>","ista":"Vasic V, Jones MSO, Haslinger D, Knaus L, Schmeisser MJ, Novarino G, Chiocchetti AG. 2021. Translating the role of mtor-and ras-associated signalopathies in autism spectrum disorder: Models, mechanisms and treatment. Genes. 12(11), 1746."}}]