[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"110729","date_published":"2021-04-24T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2021","keyword":["General Biochemistry","Genetics and Molecular Biology","Modelling and Simulation","Statistics and Probability","General Immunology and Microbiology","Applied Mathematics","General Agricultural and Biological Sciences","General Medicine"],"type":"journal_article","isi":1,"oa":1,"das_tickbox":"1","status":"public","publication":"Journal of Theoretical Biology","month":"04","language":[{"iso":"eng"}],"intvolume":"       524","date_created":"2021-05-12T05:58:42Z","pmid":1,"abstract":[{"lang":"eng","text":"We report the complete analysis of a deterministic model of deleterious mutations and negative selection against them at two haploid loci without recombination. As long as mutation is a weaker force than selection, mutant alleles remain rare at the only stable equilibrium, and otherwise, a variety of dynamics are possible. If the mutation-free genotype is absent, generally the only stable equilibrium is the one that corresponds to fixation of the mutant allele at the locus where it is less deleterious. This result suggests that fixation of a deleterious allele that follows a click of the Muller’s ratchet is governed by natural selection, instead of random drift."}],"publisher":"Elsevier","title":"Two linked loci under mutation-selection balance and Muller’s ratchet","date_updated":"2026-07-06T12:58:31Z","author":[{"full_name":"Khudiakova, Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","last_name":"Khudiakova","orcid":"0000-0002-6246-1465","first_name":"Kseniia"},{"last_name":"Neretina","first_name":"Tatiana Yu.","full_name":"Neretina, Tatiana Yu."},{"full_name":"Kondrashov, Alexey S.","first_name":"Alexey S.","last_name":"Kondrashov"}],"external_id":{"pmid":["33901507"],"isi":["000659161500002"]},"day":"24","acknowledgement":"This work was supported by the Russian Science Foundation grant N 16-14-10173.","article_type":"original","publication_identifier":{"issn":["0022-5193"]},"_id":"9387","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/477489v1"}],"doi":"10.1016/j.jtbi.2021.110729","citation":{"apa":"Khudiakova, K., Neretina, T. Y., &#38; Kondrashov, A. S. (2021). Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>","ista":"Khudiakova K, Neretina TY, Kondrashov AS. 2021. Two linked loci under mutation-selection balance and Muller’s ratchet. Journal of Theoretical Biology. 524, 110729.","ama":"Khudiakova K, Neretina TY, Kondrashov AS. Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. 2021;524. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>","ieee":"K. Khudiakova, T. Y. Neretina, and A. S. Kondrashov, “Two linked loci under mutation-selection balance and Muller’s ratchet,” <i>Journal of Theoretical Biology</i>, vol. 524. Elsevier, 2021.","mla":"Khudiakova, Kseniia, et al. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>, vol. 524, 110729, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>.","short":"K. Khudiakova, T.Y. Neretina, A.S. Kondrashov, Journal of Theoretical Biology 524 (2021).","chicago":"Khudiakova, Kseniia, Tatiana Yu. Neretina, and Alexey S. Kondrashov. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>."},"department":[{"_id":"GradSch"}],"scopus_import":"1","volume":524},{"issue":"52","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"publication":"Advanced Materials","status":"public","month":"12","corr_author":"1","ddc":["620"],"has_accepted_license":"1","date_created":"2021-10-11T20:07:24Z","pmid":1,"abstract":[{"text":"Solution synthesis of particles emerged as an alternative to prepare thermoelectric materials with less demanding processing conditions than conventional solid-state synthetic methods. However, solution synthesis generally involves the presence of additional molecules or ions belonging to the precursors or added to enable solubility and/or regulate nucleation and growth. These molecules or ions can end up in the particles as surface adsorbates and interfere in the material properties. This work demonstrates that ionic adsorbates, in particular Na⁺ ions, are electrostatically adsorbed in SnSe particles synthesized in water and play a crucial role not only in directing the material nano/microstructure but also in determining the transport properties of the consolidated material. In dense pellets prepared by sintering SnSe particles, Na remains within the crystal lattice as dopant, in dislocations, precipitates, and forming grain boundary complexions. These results highlight the importance of considering all the possible unintentional impurities to establish proper structure-property relationships and control material properties in solution-processed thermoelectric materials.","lang":"eng"}],"publisher":"Wiley","language":[{"iso":"eng"}],"intvolume":"        33","article_processing_charge":"Yes (via OA deal)","year":"2021","keyword":["mechanical engineering","mechanics of materials","general materials science"],"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":5595666,"checksum":"990bccc527c64d85cf1c97885110b5f4","creator":"cchlebak","file_name":"2021_AdvancedMaterials_Liu.pdf","relation":"main_file","date_created":"2022-02-03T13:16:14Z","date_updated":"2022-02-03T13:16:14Z","file_id":"10720","success":1}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-12-29T00:00:00Z","article_number":"2106858","type":"journal_article","ec_funded":1,"isi":1,"oa":1,"_id":"10123","quality_controlled":"1","oa_version":"Published Version","scopus_import":"1","department":[{"_id":"EM-Fac"},{"_id":"MaIb"}],"volume":33,"project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"citation":{"ista":"Liu Y, Calcabrini M, Yu Y, Genç A, Chang C, Costanzo T, Kleinhanns T, Lee S, Llorca J, Cojocaru‐Mirédin O, Ibáñez M. 2021. The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. Advanced Materials. 33(52), 2106858.","ama":"Liu Y, Calcabrini M, Yu Y, et al. The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. <i>Advanced Materials</i>. 2021;33(52). doi:<a href=\"https://doi.org/10.1002/adma.202106858\">10.1002/adma.202106858</a>","apa":"Liu, Y., Calcabrini, M., Yu, Y., Genç, A., Chang, C., Costanzo, T., … Ibáñez, M. (2021). The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.202106858\">https://doi.org/10.1002/adma.202106858</a>","mla":"Liu, Yu, et al. “The Importance of Surface Adsorbates in Solution‐processed Thermoelectric Materials: The Case of SnSe.” <i>Advanced Materials</i>, vol. 33, no. 52, 2106858, Wiley, 2021, doi:<a href=\"https://doi.org/10.1002/adma.202106858\">10.1002/adma.202106858</a>.","ieee":"Y. Liu <i>et al.</i>, “The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe,” <i>Advanced Materials</i>, vol. 33, no. 52. Wiley, 2021.","short":"Y. Liu, M. Calcabrini, Y. Yu, A. Genç, C. Chang, T. Costanzo, T. Kleinhanns, S. Lee, J. Llorca, O. Cojocaru‐Mirédin, M. Ibáñez, Advanced Materials 33 (2021).","chicago":"Liu, Yu, Mariano Calcabrini, Yuan Yu, Aziz Genç, Cheng Chang, Tommaso Costanzo, Tobias Kleinhanns, et al. “The Importance of Surface Adsorbates in Solution‐processed Thermoelectric Materials: The Case of SnSe.” <i>Advanced Materials</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/adma.202106858\">https://doi.org/10.1002/adma.202106858</a>."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1002/adma.202106858","author":[{"orcid":"0000-0001-7313-6740","last_name":"Liu","first_name":"Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"id":"45D7531A-F248-11E8-B48F-1D18A9856A87","full_name":"Calcabrini, Mariano","orcid":"0000-0003-4566-5877","last_name":"Calcabrini","first_name":"Mariano"},{"last_name":"Yu","first_name":"Yuan","full_name":"Yu, Yuan"},{"full_name":"Genç, Aziz","last_name":"Genç","first_name":"Aziz"},{"first_name":"Cheng","last_name":"Chang","orcid":"0000-0002-9515-4277","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"first_name":"Tommaso","last_name":"Costanzo","orcid":"0000-0001-9732-3815","full_name":"Costanzo, Tommaso","id":"D93824F4-D9BA-11E9-BB12-F207E6697425"},{"orcid":"0000-0003-1537-7436","last_name":"Kleinhanns","first_name":"Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","full_name":"Kleinhanns, Tobias"},{"orcid":"0000-0002-6962-8598","last_name":"Lee","first_name":"Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","full_name":"Lee, Seungho"},{"first_name":"Jordi","last_name":"Llorca","full_name":"Llorca, Jordi"},{"full_name":"Cojocaru‐Mirédin, Oana","first_name":"Oana","last_name":"Cojocaru‐Mirédin"},{"last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-07-06T13:07:38Z","title":"The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe","publication_identifier":{"issn":["0935-9648"],"eissn":["1521-4095"]},"acknowledgement":"Y.L. and M.C. contributed equally to this work. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF). This work was financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. M.C. has received funding from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385. Y.Y. and O.C.-M. acknowledge the financial support from DFG within the project SFB 917: Nanoswitches. J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program. C.C. acknowledges funding from the FWF “Lise Meitner Fellowship” grant agreement M 2889-N.","file_date_updated":"2022-02-03T13:16:14Z","article_type":"original","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12885"},{"status":"public","id":"17062","relation":"later_version"}]},"day":"29","license":"https://creativecommons.org/licenses/by/4.0/","external_id":{"isi":["000709899300001"],"pmid":["34626034"]}},{"date_updated":"2026-07-06T13:11:10Z","title":"Quantifying tissue tension in the granulosa layer after laser surgery","author":[{"full_name":"Xia, Peng","id":"4AB6C7D0-F248-11E8-B48F-1D18A9856A87","first_name":"Peng","last_name":"Xia","orcid":"0000-0002-5419-7756"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"}],"external_id":{"pmid":["33606227"]},"publication_identifier":{"issn":["1064-3745"],"eisbn":["978-1-0716-0970-5"],"isbn":["978-1-0716-0969-9"],"eissn":["1940-6029"]},"acknowledgement":"We thank Prof. Masazumi Tada and Roland Dosch for providing transgenic zebrafish lines, the Heisenberg lab for technical assistance and feedback on the manuscript, and the Bioimaging and Fish facilities of IST Austria for continuous support. This work was funded by an ERC advanced grant (MECSPEC to C.-P.H.).","day":"20","_id":"9245","oa_version":"None","quality_controlled":"1","project":[{"_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"}],"citation":{"mla":"Xia, Peng, and Carl-Philipp J. Heisenberg. “Quantifying Tissue Tension in the Granulosa Layer after Laser Surgery.” <i>Germline Development in the Zebrafish</i>, edited by Roland Dosch, vol. 2218, Humana Press, 2021, pp. 117–28, doi:<a href=\"https://doi.org/10.1007/978-1-0716-0970-5_10\">10.1007/978-1-0716-0970-5_10</a>.","ieee":"P. Xia and C.-P. J. Heisenberg, “Quantifying tissue tension in the granulosa layer after laser surgery,” in <i>Germline Development in the Zebrafish</i>, vol. 2218, R. Dosch, Ed. Humana Press, 2021, pp. 117–128.","ama":"Xia P, Heisenberg C-PJ. Quantifying tissue tension in the granulosa layer after laser surgery. In: Dosch R, ed. <i>Germline Development in the Zebrafish</i>. Vol 2218. Humana Press; 2021:117-128. doi:<a href=\"https://doi.org/10.1007/978-1-0716-0970-5_10\">10.1007/978-1-0716-0970-5_10</a>","ista":"Xia P, Heisenberg C-PJ. 2021.Quantifying tissue tension in the granulosa layer after laser surgery. In: Germline Development in the Zebrafish. Methods in Molecular Biology, vol. 2218, 117–128.","apa":"Xia, P., &#38; Heisenberg, C.-P. J. (2021). Quantifying tissue tension in the granulosa layer after laser surgery. In R. Dosch (Ed.), <i>Germline Development in the Zebrafish</i> (Vol. 2218, pp. 117–128). Humana Press. <a href=\"https://doi.org/10.1007/978-1-0716-0970-5_10\">https://doi.org/10.1007/978-1-0716-0970-5_10</a>","chicago":"Xia, Peng, and Carl-Philipp J Heisenberg. “Quantifying Tissue Tension in the Granulosa Layer after Laser Surgery.” In <i>Germline Development in the Zebrafish</i>, edited by Roland Dosch, 2218:117–28. Humana Press, 2021. <a href=\"https://doi.org/10.1007/978-1-0716-0970-5_10\">https://doi.org/10.1007/978-1-0716-0970-5_10</a>.","short":"P. Xia, C.-P.J. Heisenberg, in:, R. Dosch (Ed.), Germline Development in the Zebrafish, Humana Press, 2021, pp. 117–128."},"doi":"10.1007/978-1-0716-0970-5_10","scopus_import":"1","department":[{"_id":"CaHe"}],"volume":2218,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-02-20T00:00:00Z","year":"2021","keyword":["Tissue tension","Morphogenesis","Laser ablation","Zebrafish folliculogenesis","Granulosa cells"],"article_processing_charge":"No","publication_status":"published","type":"book_chapter","ec_funded":1,"page":"117-128","editor":[{"full_name":"Dosch, Roland","last_name":"Dosch","first_name":"Roland"}],"das_tickbox":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"status":"public","month":"02","publication":"Germline Development in the Zebrafish","corr_author":"1","language":[{"iso":"eng"}],"intvolume":"      2218","alternative_title":["Methods in Molecular Biology"],"abstract":[{"lang":"eng","text":"Tissue morphogenesis is driven by mechanical forces triggering cell movements and shape changes. Quantitatively measuring tension within tissues is of great importance for understanding the role of mechanical signals acting on the cell and tissue level during morphogenesis. Here we introduce laser ablation as a useful tool to probe tissue tension within the granulosa layer, an epithelial monolayer of somatic cells that surround the zebrafish female gamete during folliculogenesis. We describe in detail how to isolate follicles, mount samples, perform laser surgery, and analyze the data."}],"date_created":"2021-03-14T23:01:34Z","pmid":1,"publisher":"Humana Press"},{"publisher":"Fundació de la comunitat valenciana SCITO","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"date_created":"2024-04-03T08:28:26Z","doi":"10.29363/nanoge.incnc.2021.050","citation":{"ista":"Balazs D, Cimada da Silva J, Dunbar T, Ibáñez M, Hanrath T. 2021. Controlled reactive assembly of colloidal nanocrystal superlattices: Mechanism and kinetics. Proceedings of the Internet NanoGe Conference on Nanocrystals. iNCNC: Internet nanoGe Conference on Nanocrystals, 050.","ama":"Balazs D, Cimada da Silva J, Dunbar T, Ibáñez M, Hanrath T. Controlled reactive assembly of colloidal nanocrystal superlattices: Mechanism and kinetics. In: <i>Proceedings of the Internet NanoGe Conference on Nanocrystals</i>. Fundació de la comunitat valenciana SCITO; 2021. doi:<a href=\"https://doi.org/10.29363/nanoge.incnc.2021.050\">10.29363/nanoge.incnc.2021.050</a>","apa":"Balazs, D., Cimada da Silva, J., Dunbar, T., Ibáñez, M., &#38; Hanrath, T. (2021). Controlled reactive assembly of colloidal nanocrystal superlattices: Mechanism and kinetics. In <i>Proceedings of the Internet NanoGe Conference on Nanocrystals</i>. Virtual: Fundació de la comunitat valenciana SCITO. <a href=\"https://doi.org/10.29363/nanoge.incnc.2021.050\">https://doi.org/10.29363/nanoge.incnc.2021.050</a>","mla":"Balazs, Daniel, et al. “Controlled Reactive Assembly of Colloidal Nanocrystal Superlattices: Mechanism and Kinetics.” <i>Proceedings of the Internet NanoGe Conference on Nanocrystals</i>, 050, Fundació de la comunitat valenciana SCITO, 2021, doi:<a href=\"https://doi.org/10.29363/nanoge.incnc.2021.050\">10.29363/nanoge.incnc.2021.050</a>.","ieee":"D. Balazs, J. Cimada da Silva, T. Dunbar, M. Ibáñez, and T. Hanrath, “Controlled reactive assembly of colloidal nanocrystal superlattices: Mechanism and kinetics,” in <i>Proceedings of the Internet NanoGe Conference on Nanocrystals</i>, Virtual, 2021.","short":"D. Balazs, J. Cimada da Silva, T. Dunbar, M. Ibáñez, T. Hanrath, in:, Proceedings of the Internet NanoGe Conference on Nanocrystals, Fundació de la comunitat valenciana SCITO, 2021.","chicago":"Balazs, Daniel, Jessica Cimada da Silva, Tyler Dunbar, Maria Ibáñez, and Tobias Hanrath. “Controlled Reactive Assembly of Colloidal Nanocrystal Superlattices: Mechanism and Kinetics.” In <i>Proceedings of the Internet NanoGe Conference on Nanocrystals</i>. Fundació de la comunitat valenciana SCITO, 2021. <a href=\"https://doi.org/10.29363/nanoge.incnc.2021.050\">https://doi.org/10.29363/nanoge.incnc.2021.050</a>."},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.29363/nanoge.incnc.2021.050"}],"month":"06","publication":"Proceedings of the Internet NanoGe Conference on Nanocrystals","quality_controlled":"1","ddc":["530"],"status":"public","oa_version":"Published Version","corr_author":"1","_id":"15280","day":"08","oa":1,"type":"conference_abstract","conference":{"start_date":"2021-06-28","name":"iNCNC: Internet nanoGe Conference on Nanocrystals","location":"Virtual","end_date":"2021-07-02"},"author":[{"id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","full_name":"Balazs, Daniel","first_name":"Daniel","orcid":"0000-0001-7597-043X","last_name":"Balazs"},{"full_name":"Cimada da Silva, Jessica","first_name":"Jessica","last_name":"Cimada da Silva"},{"first_name":"Tyler","last_name":"Dunbar","full_name":"Dunbar, Tyler"},{"first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"last_name":"Hanrath","first_name":"Tobias","full_name":"Hanrath, Tobias"}],"year":"2021","article_processing_charge":"No","publication_status":"published","article_number":"050","date_updated":"2026-07-06T13:07:52Z","date_published":"2021-06-08T00:00:00Z","title":"Controlled reactive assembly of colloidal nanocrystal superlattices: Mechanism and kinetics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","isi":1,"ec_funded":1,"oa":1,"page":"550-581","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-11-04T00:00:00Z","year":"2021","article_processing_charge":"No","publication_status":"published","language":[{"iso":"eng"}],"intvolume":"     13043","alternative_title":["LNCS"],"date_created":"2021-12-05T23:01:43Z","abstract":[{"lang":"eng","text":"The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical framework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower bounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and broadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques."}],"publisher":"Springer Nature","publication":"19th International Conference","month":"11","status":"public","conference":{"name":"TCC: Theory of Cryptography","location":"Raleigh, NC, United States","start_date":"2021-11-08","end_date":"2021-11-11"},"external_id":{"isi":["000728364000019"]},"related_material":{"record":[{"status":"public","id":"10048","relation":"earlier_version"}]},"acknowledgement":"C. Kamath—Supported by Azrieli International Postdoctoral Fellowship. Most of the work was done while the author was at Northeastern University and Charles University, funded by the IARPA grant IARPA/2019-19-020700009 and project PRIMUS/17/SCI/9, respectively. K. Klein—Supported in part by ERC CoG grant 724307. Most of the work was done while the author was at IST Austria funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT). K. Pietrzak—Funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9-783-0309-0452-4"]},"day":"04","date_updated":"2026-07-06T13:16:17Z","title":"The cost of adaptivity in security games on graphs","author":[{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg"},{"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","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael","first_name":"Michael","orcid":"0000-0003-3186-2482","last_name":"Walter"}],"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"doi":"10.1007/978-3-030-90453-1_19","citation":{"mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” <i>19th International Conference</i>, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">10.1007/978-3-030-90453-1_19</a>.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13043, pp. 550–581.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: <i>19th International Conference</i>. Vol 13043. Springer Nature; 2021:550-581. doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">10.1007/978-3-030-90453-1_19</a>","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2021). The cost of adaptivity in security games on graphs. In <i>19th International Conference</i> (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">https://doi.org/10.1007/978-3-030-90453-1_19</a>","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In <i>19th International Conference</i>, 13043:550–81. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_19\">https://doi.org/10.1007/978-3-030-90453-1_19</a>.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 550–581."},"department":[{"_id":"KrPi"}],"scopus_import":"1","volume":13043,"_id":"10410","main_file_link":[{"open_access":"1","url":"https://ia.cr/2021/059"}],"quality_controlled":"1","oa_version":"Preprint"},{"publication":"19th International Conference","month":"11","status":"public","language":[{"iso":"eng"}],"publisher":"Springer Nature","alternative_title":["LNCS"],"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   SO(w)  loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly   O(δwlog(S)) ,   δ  being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.  with only a   SO(w)  loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly   O(δwlog(S)) ,   δ  being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity."}],"date_created":"2021-12-05T23:01:43Z","date_published":"2021-11-04T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","year":"2021","publication_status":"published","oa":1,"type":"conference","isi":1,"ec_funded":1,"page":"486-517","main_file_link":[{"url":"https://eprint.iacr.org/2021/926","open_access":"1"}],"quality_controlled":"1","oa_version":"Preprint","_id":"10409","doi":"10.1007/978-3-030-90453-1_17","citation":{"apa":"Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In <i>19th International Conference</i> (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">https://doi.org/10.1007/978-3-030-90453-1_17</a>","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: <i>19th International Conference</i>. Vol 13043. Springer Nature; 2021:486-517. doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">10.1007/978-3-030-90453-1_17</a>","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 486–517.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13043, pp. 486–517.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” <i>19th International Conference</i>, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:<a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">10.1007/978-3-030-90453-1_17</a>.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference, Springer Nature, 2021, pp. 486–517.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In <i>19th International Conference</i>, 13043:486–517. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90453-1_17\">https://doi.org/10.1007/978-3-030-90453-1_17</a>."},"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":"13043 ","scopus_import":"1","department":[{"_id":"KrPi"}],"date_updated":"2026-07-06T13:15:57Z","title":"On treewidth, separators and Yao’s garbling","author":[{"last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","last_name":"Klein"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"external_id":{"isi":["000728364000017"]},"conference":{"start_date":"2021-11-08","name":"TCC: Theory of Cryptography","location":"Raleigh, NC, United States","end_date":"2021-11-11"},"acknowledgement":"We are grateful to Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. We would also like to thank Crypto 2021 and TCC 2021 reviewers for their detailed review and suggestions, which helped improve presentation considerably.","publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"],"issn":["0302-9743"]},"related_material":{"record":[{"id":"10044","relation":"earlier_version","status":"public"}]},"day":"04"},{"_id":"10048","das_tickbox":"1","quality_controlled":"1","status":"public","publication":"19th Theory of Cryptography Conference 2021","month":"07","oa_version":"Preprint","main_file_link":[{"url":"https://ia.cr/2021/059","open_access":"1"}],"cryptoeprintid":1,"language":[{"iso":"eng"}],"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.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, 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.","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.","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.","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."},"department":[{"_id":"KrPi"}],"date_created":"2021-09-27T12:52:05Z","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"}],"publisher":"International Association for Cryptologic Research","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The cost of adaptivity in security games on graphs","date_updated":"2026-07-06T13:16:17Z","date_published":"2021-07-08T00:00:00Z","publication_status":"published","year":"2021","article_processing_charge":"No","author":[{"first_name":"Chethan","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael","first_name":"Michael","orcid":"0000-0003-3186-2482","last_name":"Walter"}],"conference":{"location":"Raleigh, NC, United States","name":"TCC: Theory of Cryptography Conference","start_date":"2021-11-08","end_date":"2021-11-11"},"type":"conference","oa":1,"external_id":{"cryptoeprintid":["2021/059"]},"day":"08","related_material":{"record":[{"status":"public","id":"10410","relation":"later_version"},{"status":"public","id":"10035","relation":"dissertation_contains"}]}},{"department":[{"_id":"KrPi"}],"citation":{"chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research, 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, 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.","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.","apa":"Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In <i>19th Theory of Cryptography Conference 2021</i>. Raleigh, NC, United States: International Association for Cryptologic Research.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: <i>19th Theory of Cryptography Conference 2021</i>. International Association for Cryptologic Research; 2021."},"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"_id":"10044","day":"08","related_material":{"record":[{"status":"public","id":"10409","relation":"later_version"},{"id":"10035","relation":"dissertation_contains","status":"public"}]},"acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling.  ","external_id":{"cryptoeprintid":["2021/926"]},"conference":{"end_date":"2021-11-11","start_date":"2021-11-08","name":"TCC: Theory of Cryptography Conference","location":"Raleigh, NC, United States"},"author":[{"orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"title":"On treewidth, separators and Yao's garbling","date_updated":"2026-07-06T13:15:57Z","publisher":"International Association for Cryptologic Research","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."}],"date_created":"2021-09-24T12:01:34Z","language":[{"iso":"eng"}],"cryptoeprintid":1,"month":"07","publication":"19th Theory of Cryptography Conference 2021","status":"public","das_tickbox":"1","oa":1,"type":"conference","ec_funded":1,"publication_status":"published","article_processing_charge":"No","year":"2021","article_number":"2021/926","date_published":"2021-07-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":17,"scopus_import":"1","department":[{"_id":"ToHe"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. EPI Sciences, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, EPI Sciences, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. EPI Sciences, p. 10:1-10:23, 2021.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. EPI Sciences. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>"},"doi":"10.23638/LMCS-17(1:10)2021","project":[{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","quality_controlled":"1","_id":"10674","arxiv":1,"day":"03","publication_identifier":{"eissn":["1860-5974"]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","file_date_updated":"2022-01-26T08:04:50Z","article_type":"original","external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"author":[{"full_name":"Aghajohari, Milad","last_name":"Aghajohari","first_name":"Milad"},{"first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Determinacy in discrete-bidding infinite-duration games","date_updated":"2026-07-06T13:21:45Z","publisher":"EPI Sciences","date_created":"2022-01-25T16:32:13Z","has_accepted_license":"1","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.","lang":"eng"}],"intvolume":"        17","language":[{"iso":"eng"}],"issue":"1","publication":"Logical Methods in Computer Science","status":"public","month":"02","corr_author":"1","ddc":["510"],"das_tickbox":"1","page":"10:1-10:23","oa":1,"type":"journal_article","isi":1,"file":[{"success":1,"file_id":"10690","date_updated":"2022-01-26T08:04:50Z","creator":"alisjak","file_name":"2021_LMCS_AGHAJOHAR.pdf","checksum":"b35586a50ed1ca8f44767de116d18d81","relation":"main_file","date_created":"2022-01-26T08:04:50Z","content_type":"application/pdf","access_level":"open_access","file_size":819878}],"publication_status":"published","year":"2021","article_processing_charge":"No","keyword":["computer science","computer science and game theory","logic in computer science"],"date_published":"2021-02-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"_id":"10023","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.14177"}],"project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"citation":{"apa":"Karatzas, I., Maas, J., &#38; Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>","ama":"Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. 2021;21(4):481-536. doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>","ista":"Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 21(4), 481–536.","ieee":"I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” <i>Communications in Information and Systems</i>, vol. 21, no. 4. International Press of Boston, pp. 481–536, 2021.","mla":"Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>, vol. 21, no. 4, International Press of Boston, 2021, pp. 481–536, doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>.","short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","chicago":"Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>. International Press of Boston, 2021. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>."},"doi":"10.4310/CIS.2021.v21.n4.a1","department":[{"_id":"JaMa"}],"volume":21,"title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","date_updated":"2026-07-06T13:38:10Z","author":[{"first_name":"Ioannis","last_name":"Karatzas","full_name":"Karatzas, Ioannis"},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338"},{"first_name":"Walter","last_name":"Schachermayer","full_name":"Schachermayer, Walter"}],"external_id":{"arxiv":["2005.14177"]},"day":"04","article_type":"original","acknowledgement":"I.K. acknowledges support from the U.S. National Science Foundation under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and from the Austrian Science Fund (FWF) through project F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008 and MA16-021.","publication_identifier":{"issn":["1526-7555"]},"arxiv":1,"das_tickbox":"1","publication":"Communications in Information and Systems","status":"public","month":"06","issue":"4","language":[{"iso":"eng"}],"intvolume":"        21","date_created":"2021-09-19T08:53:19Z","abstract":[{"lang":"eng","text":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extensions are developed to general “convex divergences” and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context."}],"publisher":"International Press of Boston","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-06-04T00:00:00Z","publication_status":"published","keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"year":"2021","article_processing_charge":"No","ec_funded":1,"type":"journal_article","oa":1,"page":"481-536"},{"quality_controlled":"1","oa_version":"Submitted Version","_id":"10204","volume":17,"scopus_import":"1","department":[{"_id":"HeEd"}],"doi":"10.1039/d1sm00774b","citation":{"short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.","chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>. Royal Society of Chemistry, 2021. <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>.","ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. 2021;17(40):9107-9115. doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","apa":"Osang, G. F., Edelsbrunner, H., &#38; Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>","ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” <i>Soft Matter</i>, vol. 17, no. 40. Royal Society of Chemistry, pp. 9107–9115, 2021.","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>, vol. 17, no. 40, Royal Society of Chemistry, 2021, pp. 9107–15, doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>."},"project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"}],"author":[{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Saadatfar, Mohammad","first_name":"Mohammad","last_name":"Saadatfar"}],"title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","date_updated":"2026-07-06T13:55:05Z","day":"20","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"file_date_updated":"2023-10-03T09:21:42Z","acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","article_type":"original","external_id":{"pmid":["34569592"],"isi":["000700090000001"]},"issue":"40","ddc":["540"],"status":"public","publication":"Soft Matter","month":"10","das_tickbox":"1","publisher":"Royal Society of Chemistry","date_created":"2021-10-31T23:01:30Z","pmid":1,"has_accepted_license":"1","abstract":[{"text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals.","lang":"eng"}],"intvolume":"        17","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"14385","date_updated":"2023-10-03T09:21:42Z","date_created":"2023-10-03T09:21:42Z","relation":"main_file","creator":"dernst","file_name":"2021_SoftMatter_acceptedversion_Osang.pdf","checksum":"b4da0c420530295e61b153960f6cb350","file_size":4678788,"access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","year":"2021","article_processing_charge":"No","date_published":"2021-10-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"9107-9115","oa":1,"isi":1,"ec_funded":1,"type":"journal_article"},{"_id":"9733","oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"doi":"10.15479/at:ista:9733","citation":{"short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>","apa":"Feliciangeli, D. (2021). <i>The polaron at strong coupling</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>","ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","mla":"Feliciangeli, Dario. <i>The Polaron at Strong Coupling</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>."},"author":[{"orcid":"0000-0003-0754-8530","last_name":"Feliciangeli","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario"}],"title":"The polaron at strong coupling","date_updated":"2026-07-06T14:02:25Z","day":"20","related_material":{"record":[{"status":"public","id":"9787","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9792"},{"relation":"part_of_dissertation","id":"9791","status":"public"},{"status":"public","id":"9225","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9781"}]},"file_date_updated":"2022-03-10T12:13:57Z","publication_identifier":{"issn":["2663-337X"]},"OA_place":"publisher","license":"https://creativecommons.org/licenses/by-nd/4.0/","degree_awarded":"PhD","corr_author":"1","status":"public","month":"08","ddc":["515","519","539"],"date_created":"2021-07-27T15:48:30Z","abstract":[{"lang":"eng","text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author."}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert"},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"publication_status":"published","year":"2021","article_processing_charge":"No","file":[{"date_updated":"2021-09-06T09:28:56Z","file_id":"9944","file_size":1958710,"access_level":"open_access","content_type":"application/pdf","date_created":"2021-08-19T14:03:48Z","relation":"main_file","creator":"dfelicia","checksum":"e88bb8ca43948abe060eb2d2fa719881","file_name":"Thesis_FeliciangeliA.pdf"},{"file_name":"thesis.7z","creator":"dfelicia","checksum":"72810843abee83705853505b3f8348aa","date_created":"2021-08-19T14:06:35Z","relation":"source_file","access_level":"closed","content_type":"application/octet-stream","file_size":3771669,"file_id":"9945","date_updated":"2022-03-10T12:13:57Z"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2021-08-20T00:00:00Z","page":"180","ec_funded":1,"type":"dissertation","oa":1},{"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry","grant_number":"I4887"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"doi":"10.1080/10586458.2021.1980459","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ieee":"A. Akopyan, H. Edelsbrunner, and A. Nikitenko, “The beauty of random polytopes inscribed in the 2-sphere,” <i>Experimental Mathematics</i>. Taylor &#38; Francis, pp. 1–15, 2021.","mla":"Akopyan, Arseniy, et al. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>, Taylor &#38; Francis, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>.","apa":"Akopyan, A., Edelsbrunner, H., &#38; Nikitenko, A. (2021). The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>","ista":"Akopyan A, Edelsbrunner H, Nikitenko A. 2021. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics., 1–15.","ama":"Akopyan A, Edelsbrunner H, Nikitenko A. The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. 2021:1-15. doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, and Anton Nikitenko. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>. Taylor &#38; Francis, 2021. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>.","short":"A. Akopyan, H. Edelsbrunner, A. Nikitenko, Experimental Mathematics (2021) 1–15."},"scopus_import":"1","department":[{"_id":"HeEd"}],"_id":"10222","quality_controlled":"1","oa_version":"Published Version","external_id":{"arxiv":["2007.07783"],"isi":["000710893500001"]},"publication_identifier":{"issn":["1058-6458"],"eissn":["1944-950X"]},"article_type":"original","file_date_updated":"2023-08-14T11:55:10Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.\r\nWe are grateful to Dmitry Zaporozhets and Christoph Thäle for valuable comments and for directing us to relevant references. We also thank to Anton Mellit for a useful discussion on Bessel functions.","day":"25","arxiv":1,"date_updated":"2026-07-07T05:33:35Z","title":"The beauty of random polytopes inscribed in the 2-sphere","author":[{"first_name":"Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201","last_name":"Nikitenko","first_name":"Anton"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Consider a random set of points on the unit sphere in ℝd, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the case d = 3, for which there are elementary proofs and fascinating formulas for metric properties. In particular, we study the fraction of acute facets, the expected intrinsic volumes, the total edge length, and the distance to a fixed point. Finally we generalize the results to the ellipsoid with homeoid density.","lang":"eng"}],"date_created":"2021-11-07T23:01:25Z","has_accepted_license":"1","publisher":"Taylor & Francis","das_tickbox":"1","corr_author":"1","month":"10","status":"public","publication":"Experimental Mathematics","ddc":["510"],"type":"journal_article","ec_funded":1,"isi":1,"oa":1,"page":"1-15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-10-25T00:00:00Z","year":"2021","article_processing_charge":"Yes (via OA deal)","publication_status":"published","file":[{"date_updated":"2023-08-14T11:55:10Z","success":1,"file_id":"14053","file_size":1966019,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-08-14T11:55:10Z","checksum":"3514382e3a1eb87fa6c61ad622874415","creator":"dernst","file_name":"2023_ExperimentalMath_Akopyan.pdf"}]},{"external_id":{"isi":["000624968100103"]},"publication_identifier":{"eissn":["1094-4087"]},"article_type":"original","acknowledgement":"H2020 Marie Skłodowska-Curie Actions (642841); European Research Council (715767); Grantová Agentura České Republiky (16-08111S, 16-18964S); Univerzita Karlova v Praze (SVV-2017-260452); Engineering and Physical Sciences Research Council (EP/K023578/1).\r\nWe are grateful to Stratasys Ltd. for access to the voxel-level print interface of the J750\r\nmachine.","file_date_updated":"2021-03-22T08:15:28Z","day":"01","date_updated":"2026-07-07T05:54:53Z","title":"Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing","author":[{"last_name":"Elek","first_name":"Oskar","full_name":"Elek, Oskar"},{"first_name":"Ran","last_name":"Zhang","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sumin, Denis","last_name":"Sumin","first_name":"Denis"},{"full_name":"Myszkowski, Karol","first_name":"Karol","last_name":"Myszkowski"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"first_name":"Jaroslav","last_name":"Křivánek","full_name":"Křivánek, Jaroslav"},{"last_name":"Weyrich","first_name":"Tim","full_name":"Weyrich, Tim"}],"project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"642841","name":"Distributed 3D Object Design"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1364/OE.406095","citation":{"ista":"Elek O, Zhang R, Sumin D, Myszkowski K, Bickel B, Wilkie A, Křivánek J, Weyrich T. 2021. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. Optics Express. 29(5), 7568–7588.","ama":"Elek O, Zhang R, Sumin D, et al. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. 2021;29(5):7568-7588. doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>","apa":"Elek, O., Zhang, R., Sumin, D., Myszkowski, K., Bickel, B., Wilkie, A., … Weyrich, T. (2021). Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>","mla":"Elek, Oskar, et al. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>, vol. 29, no. 5, Optica Publishing Group, 2021, pp. 7568–88, doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>.","ieee":"O. Elek <i>et al.</i>, “Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing,” <i>Optics Express</i>, vol. 29, no. 5. Optica Publishing Group, pp. 7568–7588, 2021.","short":"O. Elek, R. Zhang, D. Sumin, K. Myszkowski, B. Bickel, A. Wilkie, J. Křivánek, T. Weyrich, Optics Express 29 (2021) 7568–7588.","chicago":"Elek, Oskar, Ran Zhang, Denis Sumin, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, Jaroslav Křivánek, and Tim Weyrich. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>. Optica Publishing Group, 2021. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>."},"department":[{"_id":"BeBi"}],"scopus_import":"1","volume":29,"_id":"9241","oa_version":"Published Version","quality_controlled":"1","isi":1,"type":"journal_article","ec_funded":1,"oa":1,"page":"7568-7588","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-03-01T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":10873700,"creator":"dernst","file_name":"2021_OpticsExpress_Elek.pdf","checksum":"a9697ad83136c19ad87e46aa2db63cfd","date_created":"2021-03-22T08:15:28Z","relation":"main_file","date_updated":"2021-03-22T08:15:28Z","file_id":"9269","success":1}],"language":[{"iso":"eng"}],"intvolume":"        29","has_accepted_license":"1","abstract":[{"text":"Volumetric light transport is a pervasive physical phenomenon, and therefore its accurate simulation is important for a broad array of disciplines. While suitable mathematical models for computing the transport are now available, obtaining the necessary material parameters needed to drive such simulations is a challenging task: direct measurements of these parameters from material samples are seldom possible. Building on the inverse scattering paradigm, we present a novel measurement approach which indirectly infers the transport parameters from extrinsic observations of multiple-scattered radiance. The novelty of the proposed approach lies in replacing structured illumination with a structured reflector bonded to the sample, and a robust fitting procedure that largely compensates for potential systematic errors in the calibration of the setup. We show the feasibility of our approach by validating simulations of complex 3D compositions of the measured materials against physical prints, using photo-polymer resins. As presented in this paper, our technique yields colorspace data suitable for accurate appearance reproduction in the area of 3D printing. Beyond that, and without fundamental changes to the basic measurement methodology, it could equally well be used to obtain spectral measurements that are useful for other application areas.","lang":"eng"}],"date_created":"2021-03-14T23:01:33Z","publisher":"Optica Publishing Group","ddc":["000"],"month":"03","status":"public","publication":"Optics Express","issue":"5"},{"status":"public","ddc":["000"],"month":"06","publication":"2021 IEEE International Conference on Robotics and Automation","das_tickbox":"1","OA_type":"green","language":[{"iso":"eng"}],"publisher":"IEEE","abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"date_created":"2022-01-25T15:44:54Z","has_accepted_license":"1","date_published":"2021-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2021","article_processing_charge":"No","oa":1,"type":"conference","isi":1,"page":"4140-4147","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"_id":"10666","doi":"10.1109/ICRA48506.2021.9561036","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. IEEE, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, IEEE, 2021, pp. 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, IEEE, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China: IEEE. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. IEEE; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>"},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Adversarial training is not ready for robot learning","date_updated":"2026-07-07T06:20:35Z","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"conference":{"name":"ICRA: International Conference on Robotics and Automation","location":"Xi'an, China","start_date":"2021-05-30","end_date":"2021-06-05"},"OA_place":"repository","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","arxiv":1,"day":"01","publication_identifier":{"eissn":["2577-087X"],"issn":["1050-4729"],"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"]},"related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40)."},{"status":"public","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","month":"07","das_tickbox":"1","publisher":"Association for Computing Machinery","date_created":"2021-07-18T22:01:22Z","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_status":"published","article_processing_charge":"No","year":"2021","date_published":"2021-07-06T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"129-139","oa":1,"ec_funded":1,"type":"conference","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2005.07761","open_access":"1"}],"_id":"9678","department":[{"_id":"DaAl"}],"scopus_import":"1","doi":"10.1145/3409964.3461785","citation":{"chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 129–39. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 129–139.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>,  Virtual Event, United States, 2021, pp. 129–139.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 129–39, doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 129–139).  Virtual Event, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:129-139. doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139."},"project":[{"call_identifier":"H2020","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","name":"Coordination in constrained and natural distributed systems","grant_number":"840605"}],"author":[{"full_name":"Brandt, Sebastian","last_name":"Brandt","first_name":"Sebastian"},{"last_name":"Keller","first_name":"Barbara","full_name":"Keller, Barbara"},{"orcid":"0000-0002-6432-6646","last_name":"Rybicki","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel"},{"last_name":"Suomela","first_name":"Jukka","full_name":"Suomela, Jukka"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"title":"Efficient load-balancing through distributed token dropping","date_updated":"2026-07-07T06:21:32Z","arxiv":1,"day":"06","publication_identifier":{"isbn":["9781450380706"]},"related_material":{"record":[{"relation":"earlier_version","id":"15074","status":"public"}]},"acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","external_id":{"arxiv":["2005.07761"]},"conference":{"start_date":"2021-07-06","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","location":" Virtual Event, United States","end_date":"2021-07-08"}},{"date_updated":"2026-07-07T06:49:10Z","title":"Infinite time horizon safety of Bayesian neural networks","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Žikelić, Ðorđe","first_name":"Ðorđe","last_name":"Žikelić"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06","end_date":"2021-12-10"},"external_id":{"arxiv":["2111.03165"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"file_date_updated":"2022-01-26T07:39:59Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"issn":["1049-5258"]},"day":"01","arxiv":1,"_id":"10667","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"quality_controlled":"1","oa_version":"Published Version","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"citation":{"short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021."},"doi":"10.48550/arXiv.2111.03165","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-01T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"file_size":452492,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2022-01-26T07:39:59Z","creator":"mlechner","file_name":"infinite_time_horizon_safety_o.pdf","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","date_updated":"2022-01-26T07:39:59Z","file_id":"10682","success":1}],"type":"conference","ec_funded":1,"oa":1,"das_tickbox":"1","ddc":["000"],"status":"public","publication":"35th Conference on Neural Information Processing Systems","corr_author":"1","month":"12","language":[{"iso":"eng"}],"alternative_title":[" Advances in Neural Information Processing Systems"],"date_created":"2022-01-25T15:45:58Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"publisher":"Neural Information Processing Systems Foundation"},{"date_published":"2021-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2022-01-26T07:37:24Z","success":1,"file_id":"10679","access_level":"open_access","content_type":"application/pdf","file_size":6841228,"creator":"mlechner","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","checksum":"be81f0ade174a8c9b2d4fe09590b2021","date_created":"2022-01-26T07:37:24Z","relation":"main_file"}],"year":"2021","article_processing_charge":"No","publication_status":"published","oa":1,"type":"conference","month":"12","ddc":["000"],"status":"public","publication":"35th Conference on Neural Information Processing Systems","das_tickbox":"1","language":[{"iso":"eng"}],"publisher":"Neural Information Processing Systems Foundation","alternative_title":[" Advances in Neural Information Processing Systems"],"date_created":"2022-01-25T15:47:50Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"date_updated":"2026-07-07T06:49:46Z","title":"Causal navigation by continuous-time neural networks","author":[{"last_name":"Vorbach","first_name":"Charles J","full_name":"Vorbach, Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"external_id":{"arxiv":["2106.08314"]},"conference":{"end_date":"2021-12-10","start_date":"2021-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems"},"arxiv":1,"file_date_updated":"2022-01-26T07:37:24Z","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","publication_identifier":{"issn":["1049-5258"]},"day":"01","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"oa_version":"Published Version","quality_controlled":"1","_id":"10670","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"citation":{"short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021."},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}]},{"arxiv":1,"publication_identifier":{"issn":["0004-3702"]},"article_type":"original","related_material":{"record":[{"id":"35","relation":"earlier_version","status":"public"}]},"day":"16","external_id":{"arxiv":["1804.07031"],"isi":["000657537500003"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"date_updated":"2026-07-07T13:36:04Z","title":"Algorithms and conditional lower bounds for planning problems","volume":297,"scopus_import":"1","department":[{"_id":"KrCh"}],"doi":"10.1016/j.artint.2021.103499","citation":{"short":"K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>.","ista":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M., &#38; Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>","ama":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. 2021;297(8). doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>, vol. 297, no. 8, 103499, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>.","ieee":"K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” <i>Artificial Intelligence</i>, vol. 297, no. 8. Elsevier, 2021."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"quality_controlled":"1","oa_version":"Preprint","_id":"9293","oa":1,"type":"journal_article","isi":1,"article_processing_charge":"No","year":"2021","publication_status":"published","article_number":"103499","date_published":"2021-03-16T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","date_created":"2021-03-28T22:01:40Z","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"intvolume":"       297","language":[{"iso":"eng"}],"issue":"8","month":"03","publication":"Artificial Intelligence","status":"public","corr_author":"1"},{"_id":"9441","quality_controlled":"1","oa_version":"Published Version","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In <i>37th International Symposium on Computational Geometry</i>, 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th International Symposium on Computational Geometry</i>. Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In <i>37th International Symposium on Computational Geometry</i> (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium on Computational Geometry</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in <i>37th International Symposium on Computational Geometry</i>, Virtual, 2021, vol. 189, p. 17:1-17:16."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.SoCG.2021.17","scopus_import":"1","department":[{"_id":"HeEd"}],"volume":189,"date_updated":"2026-07-07T13:43:40Z","title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","first_name":"Mathijs"}],"conference":{"location":"Virtual","name":"SoCG: Symposium on Computational Geometry","start_date":"2021-06-07","end_date":"2021-06-11"},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-184-9"]},"file_date_updated":"2021-06-02T10:22:33Z","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","related_material":{"record":[{"status":"public","id":"12960","relation":"later_version"}]},"day":"02","das_tickbox":"1","ddc":["005","516","514"],"month":"06","publication":"37th International Symposium on Computational Geometry","status":"public","language":[{"iso":"eng"}],"intvolume":"       189","alternative_title":["LIPIcs"],"has_accepted_license":"1","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. ","lang":"eng"}],"date_created":"2021-06-02T10:10:55Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Dagstuhl, Germany","date_published":"2021-06-02T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"creator":"mwintrae","file_name":"LIPIcs-SoCG-2021-17.pdf","checksum":"c322aa48d5d35a35877896cc565705b6","relation":"main_file","date_created":"2021-06-02T10:22:33Z","content_type":"application/pdf","access_level":"open_access","file_size":1972902,"success":1,"file_id":"9442","date_updated":"2021-06-02T10:22:33Z"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","ec_funded":1,"type":"conference","oa":1,"page":"17:1-17:16"}]