[{"article_processing_charge":"No","publication_identifier":{"isbn":["978-1-5386-8210-4"],"eisbn":["978-1-5386-8209-8"],"issn":["2157-8095"]},"day":"01","department":[{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","oa":1,"quality_controlled":"1","_id":"10053","date_published":"2021-09-01T00:00:00Z","acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei. M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104.","isi":1,"doi":"10.1109/ISIT45174.2021.9518153","publisher":"IEEE","conference":{"name":"ISIT: International Symposium on Information Theory","location":"Melbourne, Australia","start_date":"2021-07-12","end_date":"2021-07-20"},"page":"2369-2374","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Fazeli","first_name":"Arman","full_name":"Fazeli, Arman"},{"first_name":"Alexander","last_name":"Vardy","full_name":"Vardy, Alexander"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"last_name":"Goldsmith","first_name":"Andrea","full_name":"Goldsmith, Andrea"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"10364"}]},"month":"09","year":"2021","publication_status":"published","language":[{"iso":"eng"}],"citation":{"mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>2021 IEEE International Symposium on Information Theory</i>, IEEE, 2021, pp. 2369–74, doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>.","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, in:, 2021 IEEE International Symposium on Information Theory, IEEE, 2021, pp. 2369–2374.","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith, A. (2021). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In <i>2021 IEEE International Symposium on Information Theory</i> (pp. 2369–2374). Melbourne, Australia: IEEE. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” in <i>2021 IEEE International Symposium on Information Theory</i>, Melbourne, Australia, 2021, pp. 2369–2374.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In: <i>2021 IEEE International Symposium on Information Theory</i>. IEEE; 2021:2369-2374. doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>","ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 2369–2374.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” In <i>2021 IEEE International Symposium on Information Theory</i>, 2369–74. IEEE, 2021. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>."},"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.13378"}],"publication":"2021 IEEE International Symposium on Information Theory","oa_version":"Preprint","date_created":"2021-09-27T14:33:14Z","scopus_import":"1","status":"public","external_id":{"isi":["000701502202078"],"arxiv":["2012.13378"]},"abstract":[{"lang":"eng","text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations."}],"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"arxiv":1,"date_updated":"2026-08-12T06:43:01Z"},{"quality_controlled":"1","_id":"10738","date_published":"2021-11-10T00:00:00Z","acknowledgement":"N. L. and R. S. gratefully acknowledge financial support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for stimulating discussions about the time-evolution of a polaron.\r\n","doi":"10.2140/APDE.2021.14.2079","isi":1,"publisher":"Mathematical Sciences Publishers","article_processing_charge":"No","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"The Landau–Pekar equations: Adiabatic theorem and accuracy","day":"10","department":[{"_id":"RoSe"}],"date_created":"2022-02-06T23:01:33Z","oa_version":"Preprint","publication":"Analysis and PDE","scopus_import":"1","corr_author":"1","main_file_link":[{"url":"https://arxiv.org/abs/1904.12532","open_access":"1"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2."}],"external_id":{"arxiv":["1904.12532"],"isi":["000733976600004"]},"status":"public","article_type":"original","citation":{"chicago":"Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and Robert Seiringer. “The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>.","apa":"Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021). The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.","ama":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100. doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>","ista":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.","mla":"Leopold, Nikolai K., et al. “The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100."},"ec_funded":1,"language":[{"iso":"eng"}],"intvolume":"        14","date_updated":"2026-08-12T08:46:52Z","arxiv":1,"project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"author":[{"first_name":"Nikolai K","orcid":"0000-0002-0495-6822","last_name":"Leopold","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K"},{"full_name":"Rademacher, Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","orcid":"0000-0001-5059-4466","first_name":"Simone Anna Elvira"},{"full_name":"Schlein, Benjamin","first_name":"Benjamin","last_name":"Schlein"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"page":"2079-2100","year":"2021","publication_status":"published","issue":"7","volume":14,"month":"11"},{"isi":1,"acknowledgement":"This work was supported in part by the National Science Foundation, through the Center for the Physics of Biological Function (PHY-1734030), by the National Institutes of Health (R01GM097275) and by the Fonds zur Förderung der wissenschaftlichen Forschung (FWF P28844). Deposited in PMC for release after 12 months.","doi":"10.1242/dev.176065","publisher":"Company of Biologists","quality_controlled":"1","_id":"9226","date_published":"2021-02-01T00:00:00Z","article_number":"dev176065","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"The many bits of positional information","day":"01","department":[{"_id":"GaTk"}],"article_processing_charge":"No","publication_identifier":{"eissn":["1477-9129"]},"intvolume":"       148","date_updated":"2026-08-12T09:57:53Z","ddc":["570"],"project":[{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"date_created":"2021-03-07T23:01:25Z","scopus_import":"1","publication":"Development","oa_version":"Published Version","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.1242/dev.176065","open_access":"1"}],"abstract":[{"text":"Half a century after Lewis Wolpert's seminal conceptual advance on how cellular fates distribute in space, we provide a brief historical perspective on how the concept of positional information emerged and influenced the field of developmental biology and beyond. We focus on a modern interpretation of this concept in terms of information theory, largely centered on its application to cell specification in the early Drosophila embryo. We argue that a true physical variable (position) is encoded in local concentrations of patterning molecules, that this mapping is stochastic, and that the processes by which positions and corresponding cell fates are determined based on these concentrations need to take such stochasticity into account. With this approach, we shift the focus from biological mechanisms, molecules, genes and pathways to quantitative systems-level questions: where does positional information reside, how it is transformed and accessed during development, and what fundamental limits it is subject to?","lang":"eng"}],"external_id":{"pmid":["33526425"],"isi":["000613906000007"]},"status":"public","article_type":"original","citation":{"chicago":"Tkačik, Gašper, and Thomas Gregor. “The Many Bits of Positional Information.” <i>Development</i>. Company of Biologists, 2021. <a href=\"https://doi.org/10.1242/dev.176065\">https://doi.org/10.1242/dev.176065</a>.","mla":"Tkačik, Gašper, and Thomas Gregor. “The Many Bits of Positional Information.” <i>Development</i>, vol. 148, no. 2, dev176065, Company of Biologists, 2021, doi:<a href=\"https://doi.org/10.1242/dev.176065\">10.1242/dev.176065</a>.","short":"G. Tkačik, T. Gregor, Development 148 (2021).","apa":"Tkačik, G., &#38; Gregor, T. (2021). The many bits of positional information. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.176065\">https://doi.org/10.1242/dev.176065</a>","ama":"Tkačik G, Gregor T. The many bits of positional information. <i>Development</i>. 2021;148(2). doi:<a href=\"https://doi.org/10.1242/dev.176065\">10.1242/dev.176065</a>","ista":"Tkačik G, Gregor T. 2021. The many bits of positional information. Development. 148(2), dev176065.","ieee":"G. Tkačik and T. Gregor, “The many bits of positional information,” <i>Development</i>, vol. 148, no. 2. Company of Biologists, 2021."},"language":[{"iso":"eng"}],"year":"2021","publication_status":"published","issue":"2","volume":148,"month":"02","author":[{"first_name":"Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"first_name":"Thomas","last_name":"Gregor","full_name":"Gregor, Thomas"}],"pmid":1},{"file":[{"file_size":16258500,"date_updated":"2024-04-03T13:58:51Z","file_id":"15290","file_name":"2021_CompanyBiologists_Vinter.pdf","success":1,"checksum":"6d0533fe9c712448b3f9feb15e05ec4b","access_level":"open_access","relation":"main_file","creator":"dernst","date_created":"2024-04-03T13:58:51Z","content_type":"application/pdf"}],"doi":"10.1242/dev.196121","publisher":"Company of Biologists","_id":"15262","quality_controlled":"1","date_published":"2021-09-01T00:00:00Z","article_number":"dev196121.","day":"01","keyword":["Developmental Biology","Molecular Biology"],"department":[{"_id":"AnKi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamics of hunchback translation in real-time and at single-mRNA resolution in the Drosophila embryo","oa":1,"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"intvolume":"       148","ddc":["570"],"date_updated":"2026-08-12T09:59:03Z","language":[{"iso":"eng"}],"article_type":"original","citation":{"chicago":"Vinter, Daisy J., Caroline Hoppe, Thomas Minchington, Catherine Sutcliffe, and Hilary L. Ashe. “Dynamics of Hunchback Translation in Real-Time and at Single-MRNA Resolution in the Drosophila Embryo.” <i>Development</i>. Company of Biologists, 2021. <a href=\"https://doi.org/10.1242/dev.196121\">https://doi.org/10.1242/dev.196121</a>.","short":"D.J. Vinter, C. Hoppe, T. Minchington, C. Sutcliffe, H.L. Ashe, Development 148 (2021).","mla":"Vinter, Daisy J., et al. “Dynamics of Hunchback Translation in Real-Time and at Single-MRNA Resolution in the Drosophila Embryo.” <i>Development</i>, vol. 148, no. 18, dev196121., Company of Biologists, 2021, doi:<a href=\"https://doi.org/10.1242/dev.196121\">10.1242/dev.196121</a>.","ama":"Vinter DJ, Hoppe C, Minchington T, Sutcliffe C, Ashe HL. Dynamics of hunchback translation in real-time and at single-mRNA resolution in the Drosophila embryo. <i>Development</i>. 2021;148(18). doi:<a href=\"https://doi.org/10.1242/dev.196121\">10.1242/dev.196121</a>","ieee":"D. J. Vinter, C. Hoppe, T. Minchington, C. Sutcliffe, and H. L. Ashe, “Dynamics of hunchback translation in real-time and at single-mRNA resolution in the Drosophila embryo,” <i>Development</i>, vol. 148, no. 18. Company of Biologists, 2021.","ista":"Vinter DJ, Hoppe C, Minchington T, Sutcliffe C, Ashe HL. 2021. Dynamics of hunchback translation in real-time and at single-mRNA resolution in the Drosophila embryo. Development. 148(18), dev196121.","apa":"Vinter, D. J., Hoppe, C., Minchington, T., Sutcliffe, C., &#38; Ashe, H. L. (2021). Dynamics of hunchback translation in real-time and at single-mRNA resolution in the Drosophila embryo. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.196121\">https://doi.org/10.1242/dev.196121</a>"},"type":"journal_article","date_created":"2024-04-03T07:26:41Z","scopus_import":"1","publication":"Development","oa_version":"Published Version","has_accepted_license":"1","status":"public","external_id":{"pmid":["33722899 "]},"abstract":[{"text":"The Hunchback (Hb) transcription factor is crucial for anterior-posterior patterning of the Drosophila embryo. The maternal hb mRNA acts as a paradigm for translational regulation due to its repression in the posterior of the embryo. However, little is known about the translatability of zygotically transcribed hb mRNAs. Here, we adapt the SunTag system, developed for imaging translation at single-mRNA resolution in tissue culture cells, to the Drosophila embryo to study the translation dynamics of zygotic hb mRNAs. Using single-molecule imaging in fixed and live embryos, we provide evidence for translational repression of zygotic SunTag-hb mRNAs. Whereas the proportion of SunTag-hb mRNAs translated is initially uniform, translation declines from the anterior over time until it becomes restricted to a posterior band in the expression domain. We discuss how regulated hb mRNA translation may help establish the sharp Hb expression boundary, which is a model for precision and noise during developmental patterning. Overall, our data show how use of the SunTag method on fixed and live embryos is a powerful combination for elucidating spatiotemporal regulation of mRNA translation in Drosophila.","lang":"eng"}],"volume":148,"issue":"18","month":"09","year":"2021","file_date_updated":"2024-04-03T13:58:51Z","publication_status":"published","pmid":1,"author":[{"last_name":"Vinter","first_name":"Daisy J.","full_name":"Vinter, Daisy J."},{"first_name":"Caroline","last_name":"Hoppe","full_name":"Hoppe, Caroline"},{"id":"7d1648cb-19e9-11eb-8e7a-f8c037fb3e3f","full_name":"Minchington, Thomas","last_name":"Minchington","first_name":"Thomas"},{"last_name":"Sutcliffe","first_name":"Catherine","full_name":"Sutcliffe, Catherine"},{"full_name":"Ashe, Hilary L.","first_name":"Hilary L.","last_name":"Ashe"}]},{"intvolume":"        62","ddc":["570"],"date_updated":"2026-08-12T11:15:05Z","type":"journal_article","date_created":"2021-09-12T22:01:23Z","publication":"Investigative Ophthalmology & Visual Science","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","status":"public","external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"abstract":[{"lang":"eng","text":"Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology."}],"language":[{"iso":"eng"}],"article_type":"original","citation":{"chicago":"Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology &#38; Visual Science</i>. Association for Research in Vision and Ophthalmology, 2021. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>.","apa":"Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp, C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology &#38; Visual Science</i>. Association for Research in Vision and Ophthalmology. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>","ama":"Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology &#38; Visual Science</i>. 2021;62(10). doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>","ista":"Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology &#38; Visual Science. 62(10), 14.","ieee":"H. M. Schmitt <i>et al.</i>, “Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression,” <i>Investigative Ophthalmology &#38; Visual Science</i>, vol. 62, no. 10. Association for Research in Vision and Ophthalmology, 2021.","mla":"Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology &#38; Visual Science</i>, vol. 62, no. 10, 14, Association for Research in Vision and Ophthalmology, 2021, doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>.","short":"H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R. Pelzel, R.W. Nickells, Investigative Ophthalmology &#38; Visual Science 62 (2021)."},"year":"2021","file_date_updated":"2022-05-13T07:40:15Z","publication_status":"published","volume":62,"issue":"10","month":"08","author":[{"last_name":"Schmitt","first_name":"Heather M.","full_name":"Schmitt, Heather M."},{"full_name":"Fehrman, Rachel L.","last_name":"Fehrman","first_name":"Rachel L."},{"id":"3838F452-F248-11E8-B48F-1D18A9856A87","full_name":"Maes, Margaret E","last_name":"Maes","first_name":"Margaret E","orcid":"0000-0001-9642-1085"},{"last_name":"Yang","first_name":"Huan","full_name":"Yang, Huan"},{"full_name":"Guo, Lian Wang","last_name":"Guo","first_name":"Lian Wang"},{"last_name":"Schlamp","first_name":"Cassandra L.","full_name":"Schlamp, Cassandra L."},{"full_name":"Pelzel, Heather R.","first_name":"Heather R.","last_name":"Pelzel"},{"full_name":"Nickells, Robert W.","first_name":"Robert W.","last_name":"Nickells"}],"pmid":1,"file":[{"access_level":"open_access","creator":"dernst","relation":"main_file","content_type":"application/pdf","date_created":"2022-05-13T07:40:15Z","file_size":19707796,"file_id":"11369","file_name":"2021_IOVS_Schmitt.pdf","date_updated":"2022-05-13T07:40:15Z","checksum":"c430967746f653aa1ae84ee617f62b73","success":1}],"doi":"10.1167/IOVS.62.10.14","isi":1,"acknowledgement":"The authors thank Joel Dietz for maintaining the mice used in this study, Satoshi Kinoshita and the Translational Research Initiative in Pathology Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed in this study, and Mark Banghart for statistical review of the data analysis. Supported by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809 (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness, Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick A. Davis Research Chair (RWN). ","publisher":"Association for Research in Vision and Ophthalmology","_id":"10000","date_published":"2021-08-16T00:00:00Z","quality_controlled":"1","article_number":"14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","oa":1,"day":"16","department":[{"_id":"SaSi"}],"article_processing_charge":"Yes","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"publication_identifier":{"eissn":["1552-5783"],"issn":["0146-0404"]}},{"publisher":"IEEE","acknowledgement":"M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162, and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. The authors would like to thank the anonymous reviewers for their comments that helped improving the quality of the manuscript.","doi":"10.1109/TWC.2020.3022922","isi":1,"date_published":"2021-01-01T00:00:00Z","_id":"9047","quality_controlled":"1","oa":1,"title":"Sublinear latency for simplified successive cancellation decoding of polar codes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaMo"}],"day":"01","publication_identifier":{"issn":["1536-1276"],"eissn":["1558-2248"]},"article_processing_charge":"No","date_updated":"2026-08-12T11:12:22Z","arxiv":1,"intvolume":"        20","abstract":[{"text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N1−1/μ) , where N is the block length and μ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 or 1.","lang":"eng"}],"external_id":{"arxiv":["1909.04892"],"isi":["000607808800002"]},"status":"public","scopus_import":"1","oa_version":"Preprint","publication":"IEEE Transactions on Wireless Communications","date_created":"2021-01-31T23:01:21Z","corr_author":"1","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1909.04892","open_access":"1"}],"article_type":"original","citation":{"chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John M. Cioffi, and Andrea Goldsmith. “Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/TWC.2020.3022922\">https://doi.org/10.1109/TWC.2020.3022922</a>.","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J. M., &#38; Goldsmith, A. (2021). Sublinear latency for simplified successive cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/TWC.2020.3022922\">https://doi.org/10.1109/TWC.2020.3022922</a>","ista":"Mondelli M, Hashemi SA, Cioffi JM, Goldsmith A. 2021. Sublinear latency for simplified successive cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 20(1), 18–27.","ama":"Mondelli M, Hashemi SA, Cioffi JM, Goldsmith A. Sublinear latency for simplified successive cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. 2021;20(1):18-27. doi:<a href=\"https://doi.org/10.1109/TWC.2020.3022922\">10.1109/TWC.2020.3022922</a>","ieee":"M. Mondelli, S. A. Hashemi, J. M. Cioffi, and A. Goldsmith, “Sublinear latency for simplified successive cancellation decoding of polar codes,” <i>IEEE Transactions on Wireless Communications</i>, vol. 20, no. 1. IEEE, pp. 18–27, 2021.","mla":"Mondelli, Marco, et al. “Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>, vol. 20, no. 1, IEEE, 2021, pp. 18–27, doi:<a href=\"https://doi.org/10.1109/TWC.2020.3022922\">10.1109/TWC.2020.3022922</a>.","short":"M. Mondelli, S.A. Hashemi, J.M. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 20 (2021) 18–27."},"language":[{"iso":"eng"}],"publication_status":"published","year":"2021","month":"01","related_material":{"record":[{"relation":"earlier_version","id":"8536","status":"public"}]},"issue":"1","volume":20,"author":[{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"},{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"last_name":"Cioffi","first_name":"John M.","full_name":"Cioffi, John M."},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"page":"18-27"},{"publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"article_processing_charge":"No","department":[{"_id":"DaAl"}],"day":"28","keyword":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"oa":1,"title":"Exploiting spontaneous transmissions for broadcasting and leader election in radio networks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"13","_id":"15267","date_published":"2021-01-28T00:00:00Z","quality_controlled":"1","publisher":"ACM","doi":"10.1145/3446383","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","full_name":"Davies, Peter","first_name":"Peter","orcid":"0000-0002-5646-9524","last_name":"Davies"}],"month":"01","issue":"2","volume":68,"publication_status":"published","year":"2021","article_type":"original","citation":{"apa":"Czumaj, A., &#38; Davies, P. (2021). Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3446383\">https://doi.org/10.1145/3446383</a>","ieee":"A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting and leader election in radio networks,” <i>Journal of the ACM</i>, vol. 68, no. 2. ACM, 2021.","ama":"Czumaj A, Davies P. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. <i>Journal of the ACM</i>. 2021;68(2). doi:<a href=\"https://doi.org/10.1145/3446383\">10.1145/3446383</a>","ista":"Czumaj A, Davies P. 2021. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. 68(2), 13.","mla":"Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.” <i>Journal of the ACM</i>, vol. 68, no. 2, 13, ACM, 2021, doi:<a href=\"https://doi.org/10.1145/3446383\">10.1145/3446383</a>.","short":"A. Czumaj, P. Davies, Journal of the ACM 68 (2021).","chicago":"Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.” <i>Journal of the ACM</i>. ACM, 2021. <a href=\"https://doi.org/10.1145/3446383\">https://doi.org/10.1145/3446383</a>."},"language":[{"iso":"eng"}],"abstract":[{"text":"We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Ω(D log n/D + log2 n) rounds, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be improved for the model with spontaneous transmissions, providing an O(D log n log log n/log D + logO(1) n)-time broadcasting algorithm. In this article, we give a new and faster algorithm that completes broadcasting in O(D log n/log D + logO(1) n) time, succeeding with high probability. This yields the first optimal O(D)-time broadcasting algorithm whenever n is polynomial in D.\r\n\r\nFurthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have used broadcasting as a subroutine and their complexity has been asymptotically strictly larger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O(D log n/D min {log log n, log n/D} + logO(1) n)-time, succeeding with high probability. Our new algorithm again requires O(D log n/log D + logO(1) n) time, also succeeding with high probability.","lang":"eng"}],"external_id":{"arxiv":["1703.01859"]},"status":"public","oa_version":"Preprint","date_created":"2024-04-03T07:41:46Z","publication":"Journal of the ACM","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1703.01859","open_access":"1"}],"date_updated":"2026-08-12T14:03:54Z","arxiv":1,"intvolume":"        68"},{"abstract":[{"lang":"eng","text":"The choice of the boundary conditions in mechanical problems has to reflect the interaction of the considered material with the surface. Still the assumption of the no-slip condition is preferred in order to avoid boundary terms in the analysis and slipping effects are usually overlooked. Besides the “static slip models”, there are phenomena that are not accurately described by them, e.g. at the moment when the slip changes rapidly, the wall shear stress and the slip can exhibit a sudden overshoot and subsequent relaxation. When these effects become significant, the so-called dynamic slip phenomenon occurs. We develop a mathematical analysis of Navier–Stokes-like problems with a dynamic slip boundary condition, which requires a proper generalization of the Gelfand triplet and the corresponding function space setting."}],"external_id":{"isi":["000722309400001"],"arxiv":["2009.09057"]},"status":"public","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","date_created":"2021-12-26T23:01:27Z","publication":"Mathematical Models and Methods in Applied Sciences","type":"journal_article","article_type":"original","citation":{"chicago":"Abbatiello, Anna, Miroslav Bulíček, and Erika Maringová. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like Problems.” <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0218202521500470\">https://doi.org/10.1142/S0218202521500470</a>.","mla":"Abbatiello, Anna, et al. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like Problems.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 11, World Scientific Publishing, 2021, pp. 2165–212, doi:<a href=\"https://doi.org/10.1142/S0218202521500470\">10.1142/S0218202521500470</a>.","short":"A. Abbatiello, M. Bulíček, E. Maringová, Mathematical Models and Methods in Applied Sciences 31 (2021) 2165–2212.","apa":"Abbatiello, A., Bulíček, M., &#38; Maringová, E. (2021). On the dynamic slip boundary condition for Navier-Stokes-like problems. <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218202521500470\">https://doi.org/10.1142/S0218202521500470</a>","ama":"Abbatiello A, Bulíček M, Maringová E. On the dynamic slip boundary condition for Navier-Stokes-like problems. <i>Mathematical Models and Methods in Applied Sciences</i>. 2021;31(11):2165-2212. doi:<a href=\"https://doi.org/10.1142/S0218202521500470\">10.1142/S0218202521500470</a>","ista":"Abbatiello A, Bulíček M, Maringová E. 2021. On the dynamic slip boundary condition for Navier-Stokes-like problems. Mathematical Models and Methods in Applied Sciences. 31(11), 2165–2212.","ieee":"A. Abbatiello, M. Bulíček, and E. Maringová, “On the dynamic slip boundary condition for Navier-Stokes-like problems,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 11. World Scientific Publishing, pp. 2165–2212, 2021."},"language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:31:30Z","arxiv":1,"ddc":["510"],"intvolume":"        31","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"name":"Dissipation and dispersion in nonlinear partial differential equations","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","grant_number":"W1245"}],"author":[{"full_name":"Abbatiello, Anna","last_name":"Abbatiello","first_name":"Anna"},{"last_name":"Bulíček","first_name":"Miroslav","full_name":"Bulíček, Miroslav"},{"first_name":"Erika","last_name":"Maringová","full_name":"Maringová, Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4"}],"page":"2165-2212","file_date_updated":"2022-05-16T10:55:45Z","publication_status":"published","year":"2021","month":"10","issue":"11","volume":31,"quality_controlled":"1","_id":"10575","date_published":"2021-10-13T00:00:00Z","publisher":"World Scientific Publishing","isi":1,"file":[{"date_created":"2022-05-16T10:55:45Z","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"8c0a9396335f0b70e1f5cbfe450a987a","success":1,"file_name":"2021_MathModelsMethods_Abbatiello.pdf","file_id":"11385","date_updated":"2022-05-16T10:55:45Z","file_size":795483}],"doi":"10.1142/S0218202521500470","acknowledgement":"The research of A. Abbatiello is supported by Einstein Foundation, Berlin. A. Abbatiello is also member of the Italian National Group for the Mathematical Physics (GNFM) of INdAM. M. Bulíček acknowledges the support of the project No. 20-11027X financed by Czech Science Foundation (GACR). M. Bulíček is member of the Jindřich Nečas Center for Mathematical Modelling. E. Maringová acknowledges support from Charles University Research program UNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic and from the Austrian Science Fund (FWF), grants P30000, W1245, and F65.","publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"article_processing_charge":"No","oa":1,"title":"On the dynamic slip boundary condition for Navier-Stokes-like problems","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JuFi"}],"day":"13"},{"_id":"10005","quality_controlled":"1","date_published":"2021-08-25T00:00:00Z","publisher":"World Scientific Publishing","isi":1,"doi":"10.1142/S0218202521500457","acknowledgement":"M. Bulíček and J. Málek acknowledge the support of the project No. 18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers of the Nečas Center for Mathematical Modelling.\r\n","publication_identifier":{"issn":["0218-2025"],"eissn":["1793-6314"]},"article_processing_charge":"No","oa":1,"title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JuFi"}],"keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"day":"25","abstract":[{"lang":"eng","text":"We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first-order divergence operator acting on a flux function, which is related to the spatial gradient of the unknown through an additional implicit equation. This setting, broad enough in terms of applications, significantly expands the paradigm of nonlinear parabolic problems. Formulating four conditions concerning the form of the implicit equation, we first show that these conditions describe a maximal monotone p-coercive graph. We then establish the global-in-time and large-data existence of a (weak) solution and its uniqueness. To this end, we adopt and significantly generalize Minty’s method of monotone mappings. A unified theory, containing several novel tools, is developed in a way to be tractable from the point of view of numerical approximations."}],"status":"public","external_id":{"isi":["000722222900004"],"arxiv":["2009.06917"]},"oa_version":"Preprint","date_created":"2021-09-12T22:01:25Z","scopus_import":"1","publication":"Mathematical Models and Methods in Applied Sciences","main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"type":"journal_article","article_type":"original","citation":{"chicago":"Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>.","apa":"Bulíček, M., Maringová, E., &#38; Málek, J. (2021). On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>","ista":"Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 31(09).","ieee":"M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic type with implicit constitutive equations involving flux,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09. World Scientific Publishing, 2021.","ama":"Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. 2021;31(09). doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>","mla":"Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>.","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021)."},"language":[{"iso":"eng"}],"date_updated":"2026-08-18T07:47:39Z","arxiv":1,"intvolume":"        31","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"author":[{"last_name":"Bulíček","first_name":"Miroslav","full_name":"Bulíček, Miroslav"},{"first_name":"Erika","last_name":"Maringová","full_name":"Maringová, Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4"},{"full_name":"Málek, Josef","last_name":"Málek","first_name":"Josef"}],"publication_status":"published","year":"2021","month":"08","issue":"09","volume":31},{"date_updated":"2026-08-19T09:28:05Z","ddc":["000"],"arxiv":1,"intvolume":"        35","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"status":"public","has_accepted_license":"1","external_id":{"arxiv":["2012.08185"]},"scopus_import":"1","date_created":"2022-01-25T15:15:02Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","oa_version":"Published Version","type":"conference","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496","open_access":"1"}],"corr_author":"1","ec_funded":1,"citation":{"chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i5.16496\">https://doi.org/10.1609/aaai.v35i5.16496</a>.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95, doi:<a href=\"https://doi.org/10.1609/aaai.v35i5.16496\">10.1609/aaai.v35i5.16496</a>.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i5.16496\">https://doi.org/10.1609/aaai.v35i5.16496</a>","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795. doi:<a href=\"https://doi.org/10.1609/aaai.v35i5.16496\">10.1609/aaai.v35i5.16496</a>","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795."},"language":[{"iso":"eng"}],"file_date_updated":"2022-01-26T07:41:16Z","publication_status":"published","year":"2021","month":"05","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"issue":"5A","volume":35,"author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic"}],"alternative_title":["Technical Tracks"],"page":"3787-3795","conference":{"location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"publisher":"AAAI Press","file":[{"file_id":"10684","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","date_updated":"2022-01-26T07:41:16Z","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","success":1,"file_size":137235,"date_created":"2022-01-26T07:41:16Z","content_type":"application/pdf","access_level":"open_access","creator":"mlechner","relation":"main_file"}],"doi":"10.1609/aaai.v35i5.16496","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), 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.\r\n","date_published":"2021-05-28T00:00:00Z","_id":"10665","quality_controlled":"1","oa":1,"title":"Scalable verification of quantized neural networks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"day":"28","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"article_processing_charge":"No"},{"day":"28","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Liquid time-constant networks","article_processing_charge":"No","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"file":[{"file_size":4302669,"date_updated":"2022-01-26T07:36:03Z","file_id":"10678","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","success":1,"checksum":"0f06995fba06dbcfa7ed965fc66027ff","access_level":"open_access","relation":"main_file","creator":"mlechner","content_type":"application/pdf","date_created":"2022-01-26T07:36:03Z"}],"doi":"10.1609/aaai.v35i9.16936","acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","publisher":"AAAI Press","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","location":"Virtual","end_date":"2021-02-09"},"_id":"10671","quality_controlled":"1","date_published":"2021-05-28T00:00:00Z","issue":"9","volume":35,"month":"05","year":"2021","file_date_updated":"2022-01-26T07:36:03Z","publication_status":"published","page":"7657-7666","alternative_title":["Technical Tracks"],"author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"intvolume":"        35","date_updated":"2026-08-19T09:24:30Z","arxiv":1,"ddc":["000"],"citation":{"mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66, doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16936\">10.1609/aaai.v35i9.16936</a>.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i9.16936\">https://doi.org/10.1609/aaai.v35i9.16936</a>","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666. doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16936\">10.1609/aaai.v35i9.16936</a>","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i9.16936\">https://doi.org/10.1609/aaai.v35i9.16936</a>."},"language":[{"iso":"eng"}],"date_created":"2022-01-25T15:48:36Z","oa_version":"Published Version","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"type":"conference","corr_author":"1","abstract":[{"text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.","lang":"eng"}],"external_id":{"arxiv":["2006.04439"]},"has_accepted_license":"1","status":"public"},{"intvolume":"        35","date_updated":"2026-08-19T09:25:06Z","arxiv":1,"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"oa_version":"Preprint","scopus_import":"1","publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","date_created":"2022-06-05T22:01:52Z","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}],"type":"conference","abstract":[{"text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.","lang":"eng"}],"status":"public","external_id":{"arxiv":["1905.11845"]},"ec_funded":1,"citation":{"chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">https://doi.org/10.1609/aaai.v35i9.16999</a>.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16, doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">10.1609/aaai.v35i9.16999</a>.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216. doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">10.1609/aaai.v35i9.16999</a>","ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">https://doi.org/10.1609/aaai.v35i9.16999</a>"},"language":[{"iso":"eng"}],"year":"2021","publication_status":"published","issue":"9B","volume":35,"month":"05","author":[{"full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev","first_name":"Vyacheslav"},{"first_name":"Malcolm","last_name":"Egan","full_name":"Egan, Malcolm"},{"last_name":"Chatterjee","first_name":"Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"page":"8209-8216","conference":{"location":"Virtual, Online","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Conference on Artificial Intelligence"},"acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","doi":"10.1609/aaai.v35i9.16999","publisher":"AAAI Press","date_published":"2021-05-18T00:00:00Z","_id":"11436","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","day":"18","department":[{"_id":"DaAl"}],"article_processing_charge":"No","publication_identifier":{"isbn":["9781713835974"],"eissn":["2374-3468"],"issn":["2159-5399"]}},{"citation":{"chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">https://doi.org/10.1609/aaai.v35i13.17372</a>.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535. doi:<a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">10.1609/aaai.v35i13.17372</a>","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">https://doi.org/10.1609/aaai.v35i13.17372</a>","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35, doi:<a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">10.1609/aaai.v35i13.17372</a>."},"language":[{"iso":"eng"}],"date_created":"2022-01-25T15:47:20Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","oa_version":"Published Version","corr_author":"1","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372","open_access":"1"}],"type":"conference","abstract":[{"lang":"eng","text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR."}],"external_id":{"arxiv":["2012.08863"]},"has_accepted_license":"1","status":"public","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"intvolume":"        35","date_updated":"2026-08-19T09:29:48Z","arxiv":1,"ddc":["000"],"page":"11525-11535","alternative_title":["Technical Tracks"],"author":[{"full_name":"Grunbacher, Sophie","last_name":"Grunbacher","first_name":"Sophie"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Cyranka, Jacek","last_name":"Cyranka","first_name":"Jacek"},{"first_name":"Scott A","last_name":"Smolka","full_name":"Smolka, Scott A"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"issue":"13","volume":35,"month":"05","year":"2021","publication_status":"published","file_date_updated":"2022-01-26T07:38:08Z","quality_controlled":"1","_id":"10669","date_published":"2021-05-28T00:00:00Z","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","doi":"10.1609/aaai.v35i13.17372","file":[{"content_type":"application/pdf","date_created":"2022-01-26T07:38:08Z","access_level":"open_access","relation":"main_file","creator":"mlechner","date_updated":"2022-01-26T07:38:08Z","file_id":"10680","file_name":"17372-Article Text-20866-1-2-20210518.pdf","success":1,"checksum":"468d07041e282a1d46ffdae92f709630","file_size":286906}],"publisher":"AAAI Press","conference":{"location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"article_processing_charge":"No","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"day":"28","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"On the verification of neural ODEs with stochastic guarantees"},{"year":"2021","file_date_updated":"2022-03-28T12:55:12Z","publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","id":"6673","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"5965"},{"status":"public","id":"10435","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10432","status":"public"}]},"month":"12","alternative_title":["ISTA Thesis"],"author":[{"full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731","first_name":"Giorgi","last_name":"Nadiradze"}],"page":"132","OA_place":"publisher","date_updated":"2026-08-19T09:30:23Z","ddc":["000"],"project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"date_created":"2021-12-08T21:52:28Z","oa_version":"Published Version","type":"dissertation","corr_author":"1","abstract":[{"lang":"eng","text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same."}],"status":"public","has_accepted_license":"1","ec_funded":1,"citation":{"mla":"Nadiradze, Giorgi. <i>On Achieving Scalability through Relaxation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>.","short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","apa":"Nadiradze, G. (2021). <i>On achieving scalability through relaxation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","ama":"Nadiradze G. On achieving scalability through relaxation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.","chicago":"Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>."},"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"title":"On achieving scalability through relaxation","day":"09","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:10429","file":[{"access_level":"open_access","creator":"gnadirad","relation":"main_file","date_created":"2021-12-09T17:47:49Z","content_type":"application/pdf","file_size":2370859,"file_name":"Thesis_Final_09_12_2021.pdf","file_id":"10436","date_updated":"2021-12-09T17:47:49Z","success":1,"checksum":"6bf14e9a523387328f016c0689f5e10e"},{"file_name":"Thesis_Final_09_12_2021.zip","file_id":"10437","date_updated":"2022-03-28T12:55:12Z","checksum":"914d6c5ca86bd0add471971a8f4c4341","file_size":2596924,"date_created":"2021-12-09T17:47:49Z","content_type":"application/zip","access_level":"closed","creator":"gnadirad","relation":"source_file"}],"degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","supervisor":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"_id":"10429","date_published":"2021-12-09T00:00:00Z"},{"_id":"10432","date_published":"2021-05-18T00:00:00Z","quality_controlled":"1","doi":"10.1609/aaai.v35i10.17092","acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","conference":{"location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"article_processing_charge":"No","department":[{"_id":"DaAl"}],"day":"18","oa":1,"title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav  Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:9037–45, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">https://doi.org/10.1609/aaai.v35i10.17092</a>.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 10, 2021, pp. 9037–45, doi:<a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">10.1609/aaai.v35i10.17092</a>.","ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.","ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. ; 2021:9037-9045. doi:<a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">10.1609/aaai.v35i10.17092</a>","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 9037–9045). Virtual. <a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">https://doi.org/10.1609/aaai.v35i10.17092</a>"},"ec_funded":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"status":"public","external_id":{"arxiv":["2001.05918"]},"date_created":"2021-12-09T09:21:35Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092"}],"type":"conference","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}],"date_updated":"2026-08-19T09:30:23Z","arxiv":1,"ddc":["000"],"intvolume":"        35","page":"9037-9045","author":[{"last_name":"Nadiradze","orcid":"0000-0001-5634-0731","first_name":"Giorgi","full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia"},{"first_name":"Bapi","orcid":"0000-0002-2742-4028","last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"first_name":"Vyacheslav ","last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav "},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"month":"05","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10429"}]},"issue":"10","volume":35,"publication_status":"published","year":"2021"},{"author":[{"first_name":"Alec L","orcid":"0000-0002-1812-2810","last_name":"Shute","id":"440EB050-F248-11E8-B48F-1D18A9856A87","full_name":"Shute, Alec L"}],"month":"04","related_material":{"record":[{"relation":"dissertation_contains","id":"12072","status":"public"},{"status":"public","id":"17058","relation":"later_version"}]},"publication_status":"draft","year":"2021","language":[{"iso":"eng"}],"citation":{"chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>.","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>arXiv</i>. .","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>","short":"A.L. Shute, ArXiv (n.d.).","mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, 2104.14946, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>."},"supplementarymaterial":"no","status":"public","external_id":{"arxiv":["2104.14946"]},"abstract":[{"lang":"eng","text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms."}],"corr_author":"1","type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.14946"}],"oa_version":"Preprint","date_created":"2022-09-09T10:43:17Z","publication":"arXiv","arxiv":1,"date_updated":"2026-08-19T12:54:58Z","article_processing_charge":"No","department":[{"_id":"TiBr"}],"researchdata_availability":"no","day":"30","title":"On the leading constant in the Manin-type conjecture for Campana points","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"2104.14946","_id":"12077","date_published":"2021-04-30T00:00:00Z","das_tickbox":"0","doi":"10.48550/arXiv.2104.14946","acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper."},{"volume":126,"related_material":{"record":[{"relation":"popular_science","status":"returned","id":"19591"},{"relation":"dissertation_contains","id":"19684","status":"public"}],"link":[{"url":"https://ist.ac.at/en/news/turbulent-flow-simplified/","relation":"press_release","description":"News on IST Homepage"}]},"issue":"24","month":"06","year":"2021","publication_status":"published","author":[{"last_name":"Yalniz","orcid":"0000-0002-8490-9312","first_name":"Gökhan","full_name":"Yalniz, Gökhan","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425"},{"orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","full_name":"Budanur, Nazmi B","first_name":"Nazmi B","orcid":"0000-0003-0423-5010","last_name":"Budanur"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"project":[{"grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"intvolume":"       126","arxiv":1,"date_updated":"2026-09-02T08:16:31Z","language":[{"iso":"eng"}],"citation":{"chicago":"Yalniz, Gökhan, Björn Hof, and Nazmi B Budanur. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>.","ama":"Yalniz G, Hof B, Budanur NB. Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. 2021;126(24). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>","ista":"Yalniz G, Hof B, Budanur NB. 2021. Coarse graining the state space of a turbulent flow using periodic orbits. Physical Review Letters. 126(24), 244502.","ieee":"G. Yalniz, B. Hof, and N. B. Budanur, “Coarse graining the state space of a turbulent flow using periodic orbits,” <i>Physical Review Letters</i>, vol. 126, no. 24. American Physical Society, 2021.","apa":"Yalniz, G., Hof, B., &#38; Budanur, N. B. (2021). Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>","short":"G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021).","mla":"Yalniz, Gökhan, et al. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>, vol. 126, no. 24, 244502, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>."},"article_type":"letter_note","type":"journal_article","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.02584"}],"date_created":"2021-06-16T15:45:36Z","oa_version":"Preprint","scopus_import":"1","publication":"Physical Review Letters","external_id":{"isi":["000663310100008"],"arxiv":["2007.02584"]},"status":"public","abstract":[{"lang":"eng","text":"We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits.\r\n"}],"day":"18","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Coarse graining the state space of a turbulent flow using periodic orbits","oa":1,"article_processing_charge":"No","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"doi":"10.1103/PhysRevLett.126.244502","acknowledgement":"We thank the referees for improving this Letter with their comments. We acknowledge stimulating discussions with\r\nH. Edelsbrunner. This work was supported by Grant No. 662960 from the Simons Foundation (B. H.). The numerical calculations were performed at TUBITAK ULAKBIM High Performance and Grid Computing Center (TRUBA resources) and IST Austria High Performance Computing cluster.","isi":1,"publisher":"American Physical Society","date_published":"2021-06-18T00:00:00Z","_id":"9558","quality_controlled":"1","article_number":"244502"},{"_id":"8602","quality_controlled":"1","date_published":"2021-02-01T00:00:00Z","publisher":"Springer Nature","acknowledgement":"We would like to thank G. Tkacik and all of the members of the Hannezo and Hirashima groups for useful discussions, X. Trepat for help on traction force microscopy and M. Matsuda for use of the lab facility. E.H. acknowledges grants from the Austrian Science Fund (FWF) (P 31639) and the European Research Council (851288). T.H. acknowledges a grant from JST, PRESTO (JPMJPR1949). 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. 665385 (to D.B.), from JSPS KAKENHI grant no. 17J02107 (to N.H.) and from the SPIRITS 2018 of Kyoto University (to E.H. and T.H.).","isi":1,"doi":"10.1038/s41567-020-01037-7","publication_identifier":{"issn":["1745-2473"],"eissn":["1745-2481"]},"article_processing_charge":"No","oa":1,"title":"Theory of mechanochemical patterning and optimal migration in cell monolayers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"EdHa"}],"day":"01","abstract":[{"lang":"eng","text":"Collective cell migration offers a rich field of study for non-equilibrium physics and cellular biology, revealing phenomena such as glassy dynamics, pattern formation and active turbulence. However, how mechanical and chemical signalling are integrated at the cellular level to give rise to such collective behaviours remains unclear. We address this by focusing on the highly conserved phenomenon of spatiotemporal waves of density and extracellular signal-regulated kinase (ERK) activation, which appear both in vitro and in vivo during collective cell migration and wound healing. First, we propose a biophysical theory, backed by mechanical and optogenetic perturbation experiments, showing that patterns can be quantitatively explained by a mechanochemical coupling between active cellular tensions and the mechanosensitive ERK pathway. Next, we demonstrate how this biophysical mechanism can robustly induce long-ranged order and migration in a desired orientation, and we determine the theoretically optimal wavelength and period for inducing maximal migration towards free edges, which fits well with experimentally observed dynamics. We thereby provide a bridge between the biophysical origin of spatiotemporal instabilities and the design principles of robust and efficient long-ranged migration."}],"status":"public","external_id":{"isi":["000573519500002"]},"date_created":"2020-10-04T22:01:37Z","scopus_import":"1","publication":"Nature Physics","oa_version":"Preprint","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.05.15.096479"}],"type":"journal_article","citation":{"ama":"Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. Theory of mechanochemical patterning and optimal migration in cell monolayers. <i>Nature Physics</i>. 2021;17:267-274. doi:<a href=\"https://doi.org/10.1038/s41567-020-01037-7\">10.1038/s41567-020-01037-7</a>","ieee":"D. R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, and E. B. Hannezo, “Theory of mechanochemical patterning and optimal migration in cell monolayers,” <i>Nature Physics</i>, vol. 17. Springer Nature, pp. 267–274, 2021.","ista":"Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. 2021. Theory of mechanochemical patterning and optimal migration in cell monolayers. Nature Physics. 17, 267–274.","apa":"Boocock, D. R., Hino, N., Ruzickova, N., Hirashima, T., &#38; Hannezo, E. B. (2021). Theory of mechanochemical patterning and optimal migration in cell monolayers. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-020-01037-7\">https://doi.org/10.1038/s41567-020-01037-7</a>","short":"D.R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, E.B. Hannezo, Nature Physics 17 (2021) 267–274.","mla":"Boocock, Daniel R., et al. “Theory of Mechanochemical Patterning and Optimal Migration in Cell Monolayers.” <i>Nature Physics</i>, vol. 17, Springer Nature, 2021, pp. 267–74, doi:<a href=\"https://doi.org/10.1038/s41567-020-01037-7\">10.1038/s41567-020-01037-7</a>.","chicago":"Boocock, Daniel R, Naoya Hino, Natalia Ruzickova, Tsuyoshi Hirashima, and Edouard B Hannezo. “Theory of Mechanochemical Patterning and Optimal Migration in Cell Monolayers.” <i>Nature Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41567-020-01037-7\">https://doi.org/10.1038/s41567-020-01037-7</a>."},"article_type":"original","ec_funded":1,"language":[{"iso":"eng"}],"date_updated":"2026-09-03T22:30:06Z","intvolume":"        17","project":[{"grant_number":"P31639","_id":"268294B6-B435-11E9-9278-68D0E5697425","name":"Active mechano-chemical description of the cell cytoskeleton","call_identifier":"FWF"},{"_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Design Principles of Branching Morphogenesis","grant_number":"851288"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"author":[{"id":"453AF628-F248-11E8-B48F-1D18A9856A87","full_name":"Boocock, Daniel R","first_name":"Daniel R","orcid":"0000-0002-1585-2631","last_name":"Boocock"},{"full_name":"Hino, Naoya","last_name":"Hino","first_name":"Naoya"},{"id":"D2761128-D73D-11E9-A1BF-BA0DE6697425","full_name":"Ruzickova, Natalia","last_name":"Ruzickova","first_name":"Natalia"},{"full_name":"Hirashima, Tsuyoshi","first_name":"Tsuyoshi","last_name":"Hirashima"},{"last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"}],"page":"267-274","publication_status":"published","year":"2021","month":"02","related_material":{"link":[{"url":"https://ist.ac.at/en/news/wound-healing-waves/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"status":"public","id":"12964","relation":"dissertation_contains"}]},"volume":17},{"status":"public","external_id":{"isi":["000674930900091"]},"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements."}],"type":"journal_article","oa_version":"Published Version","publication":"ACM Transactions on Graphics","date_created":"2021-08-08T22:01:26Z","scopus_import":"1","language":[{"iso":"eng"}],"ec_funded":1,"citation":{"chicago":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>.","mla":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>.","short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021).","apa":"Hafner, C., &#38; Bickel, B. (2021). The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. Virtual: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>","ieee":"C. Hafner and B. Bickel, “The design space of plane elastic curves,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","ama":"Hafner C, Bickel B. The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>","ista":"Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions on Graphics. 40(4), 126."},"article_type":"original","ddc":["516"],"date_updated":"2026-09-03T22:30:07Z","intvolume":"        40","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"author":[{"first_name":"Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"file_date_updated":"2021-10-18T10:42:22Z","publication_status":"published","year":"2021","month":"07","volume":40,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12897"}],"link":[{"url":"https://ist.ac.at/en/news/designing-with-elastic-structures/","description":"News on IST Website","relation":"press_release"}]},"issue":"4","article_number":"126","_id":"9817","quality_controlled":"1","date_published":"2021-07-19T00:00:00Z","conference":{"name":"SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Virtual","start_date":"2021-08-09","end_date":"2021-08-13"},"publisher":"Association for Computing Machinery","acknowledgement":"We thank the anonymous reviewers for their generous feedback, and Michal Piovarči for his help in producing the supplemental video. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n","doi":"10.1145/3450626.3459800","isi":1,"file":[{"content_type":"application/pdf","date_created":"2021-10-18T10:42:15Z","access_level":"open_access","creator":"chafner","relation":"main_file","file_id":"10150","file_name":"elastic-curves-paper.pdf","date_updated":"2021-10-18T10:42:15Z","checksum":"7e5d08ce46b0451b3102eacd3d00f85f","success":1,"file_size":17064290},{"file_size":547156,"file_name":"elastic-curves-supp.pdf","file_id":"10151","date_updated":"2021-10-18T10:42:22Z","checksum":"0088643478be7c01a703b5b10767348f","access_level":"open_access","creator":"chafner","relation":"supplementary_material","content_type":"application/pdf","date_created":"2021-10-18T10:42:22Z"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"article_processing_charge":"No","title":"The design space of plane elastic curves","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"BeBi"}],"day":"19","keyword":["Computing methodologies","shape modeling","modeling and simulation","theory of computation","computational geometry","mathematics of computing","mathematical optimization"]},{"abstract":[{"lang":"eng","text":"De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency leads to motor coordination deficits as well as ASD-relevant social and cognitive impairments. However, induction of Cul3 haploinsufficiency later in life does not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during a critical developmental window. Here we show that Cul3 is essential to regulate neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice display cortical lamination abnormalities. At the molecular level, we found that Cul3 controls neuronal migration by tightly regulating the amount of Plastin3 (Pls3), a previously unrecognized player of neural migration. Furthermore, we found that Pls3 cell-autonomously regulates cell migration by regulating actin cytoskeleton organization, and its levels are inversely proportional to neural migration speed. Finally, we provide evidence that cellular phenotypes associated with autism-linked gene haploinsufficiency can be rescued by transcriptional activation of the intact allele in vitro, offering a proof of concept for a potential therapeutic approach for ASDs."}],"external_id":{"isi":["000658769900010"]},"status":"public","has_accepted_license":"1","scopus_import":"1","publication":"Nature Communications","date_created":"2021-05-28T11:49:46Z","oa_version":"Published Version","corr_author":"1","type":"journal_article","ec_funded":1,"article_type":"original","citation":{"apa":"Morandell, J., Schwarz, L. A., Basilico, B., Tasciyan, S., Dimchev, G. A., Nicolas, A., … Novarino, G. (2021). Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>","ama":"Morandell J, Schwarz LA, Basilico B, et al. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>","ista":"Morandell J, Schwarz LA, Basilico B, Tasciyan S, Dimchev GA, Nicolas A, Sommer CM, Kreuzinger C, Dotter C, Knaus L, Dobler Z, Cacci E, Schur FK, Danzl JG, Novarino G. 2021. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. 12(1), 3058.","ieee":"J. Morandell <i>et al.</i>, “Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","mla":"Morandell, Jasmin, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>, vol. 12, no. 1, 3058, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>.","short":"J. Morandell, L.A. Schwarz, B. Basilico, S. Tasciyan, G.A. Dimchev, A. Nicolas, C.M. Sommer, C. Kreuzinger, C. Dotter, L. Knaus, Z. Dobler, E. Cacci, F.K. Schur, J.G. Danzl, G. Novarino, Nature Communications 12 (2021).","chicago":"Morandell, Jasmin, Lena A Schwarz, Bernadette Basilico, Saren Tasciyan, Georgi A Dimchev, Armel Nicolas, Christoph M Sommer, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>."},"language":[{"iso":"eng"}],"date_updated":"2026-09-03T22:30:12Z","ddc":["572"],"intvolume":"        12","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"grant_number":"715508","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models","call_identifier":"H2020","_id":"25444568-B435-11E9-9278-68D0E5697425"},{"grant_number":"W1232","call_identifier":"FWF","_id":"2548AE96-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets"},{"grant_number":"F7807","name":"Stem Cell Modulation in Neural Development and Regeneration/ P07-Neural stem cells in autism and epilepsy","_id":"05A0D778-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Optical control of synaptic function via adhesion molecules"}],"acknowledged_ssus":[{"_id":"PreCl"}],"author":[{"last_name":"Morandell","first_name":"Jasmin","full_name":"Morandell, Jasmin","id":"4739D480-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lena A","last_name":"Schwarz","id":"29A8453C-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Lena A"},{"full_name":"Basilico, Bernadette","id":"36035796-5ACA-11E9-A75E-7AF2E5697425","orcid":"0000-0003-1843-3173","first_name":"Bernadette","last_name":"Basilico"},{"full_name":"Tasciyan, Saren","id":"4323B49C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1671-393X","first_name":"Saren","last_name":"Tasciyan"},{"id":"38C393BE-F248-11E8-B48F-1D18A9856A87","full_name":"Dimchev, Georgi A","last_name":"Dimchev","first_name":"Georgi A","orcid":"0000-0001-8370-6161"},{"first_name":"Armel","last_name":"Nicolas","id":"2A103192-F248-11E8-B48F-1D18A9856A87","full_name":"Nicolas, Armel"},{"id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M","last_name":"Sommer","first_name":"Christoph M","orcid":"0000-0003-1216-9105"},{"first_name":"Caroline","last_name":"Kreuzinger","id":"382077BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kreuzinger, Caroline"},{"orcid":"0000-0002-9033-9096","first_name":"Christoph","last_name":"Dotter","full_name":"Dotter, Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Knaus, Lisa","id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87","first_name":"Lisa","last_name":"Knaus"},{"first_name":"Zoe","last_name":"Dobler","id":"D23090A2-9057-11EA-883A-A8396FC7A38F","full_name":"Dobler, Zoe"},{"full_name":"Cacci, Emanuele","last_name":"Cacci","first_name":"Emanuele"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM","last_name":"Schur","first_name":"Florian KM","orcid":"0000-0003-4790-8078"},{"first_name":"Johann G","orcid":"0000-0001-8559-3973","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G"},{"last_name":"Novarino","first_name":"Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia"}],"publication_status":"published","file_date_updated":"2021-05-28T12:39:43Z","year":"2021","month":"05","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/defective-gene-slows-down-brain-cells/"}],"record":[{"id":"19557","status":"public","relation":"dissertation_contains"},{"relation":"earlier_version","status":"public","id":"7800"},{"status":"public","id":"12401","relation":"dissertation_contains"}]},"issue":"1","volume":12,"article_number":"3058","date_published":"2021-05-24T00:00:00Z","_id":"9429","quality_controlled":"1","publisher":"Springer Nature","doi":"10.1038/s41467-021-23123-x","isi":1,"acknowledgement":"We thank A. Coll Manzano, F. Freeman, M. Ladron de Guevara, and A. Ç. Yahya for technical assistance, S. Deixler, A. Lepold, and A. Schlerka for the management of our animal colony, as well as M. Schunn and the Preclinical Facility team for technical assistance. We thank K. Heesom and her team at the University of Bristol Proteomics Facility for the proteomics sample preparation, data generation, and analysis support. We thank Y. B. Simon for kindly providing the plasmid for lentiviral labeling. Further, we thank M. Sixt for his advice regarding cell migration and the fruitful discussions. This work was supported by the ISTPlus postdoctoral fellowship (Grant Agreement No. 754411) to B.B., by the European Union’s Horizon 2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM), and by the Austrian Science Fund (FWF) to G.N. (DK W1232-B24 and SFB F7807-B) and to J.G.D (I3600-B27).","file":[{"date_created":"2021-05-28T12:39:43Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"kschuh","date_updated":"2021-05-28T12:39:43Z","file_id":"9430","file_name":"2021_NatureCommunications_Morandell.pdf","success":1,"checksum":"337e0f7959c35ec959984cacdcb472ba","file_size":9358599}],"publication_identifier":{"eissn":["2041-1723"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","oa":1,"title":"Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"GaNo"},{"_id":"JoDa"},{"_id":"FlSc"},{"_id":"MiSi"},{"_id":"LifeSc"},{"_id":"Bio"}],"day":"24","keyword":["General Biochemistry","Genetics and Molecular Biology"]}]