[{"ddc":["570"],"publication_identifier":{"issn":["0146-0404"],"eissn":["1552-5783"]},"month":"08","title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","volume":62,"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."}],"type":"journal_article","fulldoi":"https://doi.org/10.1167/IOVS.62.10.14","file":[{"success":1,"date_created":"2022-05-13T07:40:15Z","content_type":"application/pdf","date_updated":"2022-05-13T07:40:15Z","access_level":"open_access","relation":"main_file","file_name":"2021_IOVS_Schmitt.pdf","creator":"dernst","checksum":"c430967746f653aa1ae84ee617f62b73","file_size":19707796,"file_id":"11369"}],"author":[{"first_name":"Heather M.","full_name":"Schmitt, Heather M.","last_name":"Schmitt"},{"first_name":"Rachel L.","full_name":"Fehrman, Rachel L.","last_name":"Fehrman"},{"orcid":"0000-0001-9642-1085","full_name":"Maes, Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","first_name":"Margaret E","last_name":"Maes"},{"full_name":"Yang, Huan","first_name":"Huan","last_name":"Yang"},{"last_name":"Guo","full_name":"Guo, Lian Wang","first_name":"Lian Wang"},{"last_name":"Schlamp","full_name":"Schlamp, Cassandra L.","first_name":"Cassandra L."},{"full_name":"Pelzel, Heather R.","first_name":"Heather R.","last_name":"Pelzel"},{"first_name":"Robert W.","full_name":"Nickells, Robert W.","last_name":"Nickells"}],"date_created":"2021-09-12T22:01:23Z","intvolume":"        62","date_updated":"2026-08-12T11:15:05Z","department":[{"_id":"SaSi"}],"publisher":"Association for Research in Vision and Ophthalmology","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). ","doi":"10.1167/IOVS.62.10.14","isi":1,"publication_status":"published","external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"issue":"10","has_accepted_license":"1","article_number":"14","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","publication":"Investigative Ophthalmology & Visual Science","scopus_import":"1","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"quality_controlled":"1","status":"public","_id":"10000","citation":{"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>.","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.","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>","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).","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.","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>."},"year":"2021","date_published":"2021-08-16T00:00:00Z","pmid":1,"language":[{"iso":"eng"}],"oa":1,"oa_version":"Published Version","article_processing_charge":"Yes","file_date_updated":"2022-05-13T07:40:15Z"},{"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"last_name":"Cioffi","full_name":"Cioffi, John M.","first_name":"John M."},{"first_name":"Andrea","full_name":"Goldsmith, Andrea","last_name":"Goldsmith"}],"date_created":"2021-01-31T23:01:21Z","date_updated":"2026-08-12T11:12:22Z","intvolume":"        20","department":[{"_id":"MaMo"}],"page":"18-27","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.","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04892"}],"doi":"10.1109/TWC.2020.3022922","isi":1,"publication_status":"published","external_id":{"isi":["000607808800002"],"arxiv":["1909.04892"]},"corr_author":"1","issue":"1","arxiv":1,"publication_identifier":{"issn":["1536-1276"],"eissn":["1558-2248"]},"related_material":{"record":[{"relation":"earlier_version","id":"8536","status":"public"}]},"month":"01","title":"Sublinear latency for simplified successive cancellation decoding of polar codes","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"}],"volume":20,"fulldoi":"https://doi.org/10.1109/TWC.2020.3022922","type":"journal_article","date_published":"2021-01-01T00:00:00Z","year":"2021","language":[{"iso":"eng"}],"oa":1,"oa_version":"Preprint","article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"IEEE Transactions on Wireless Communications","article_type":"original","scopus_import":"1","quality_controlled":"1","status":"public","_id":"9047","citation":{"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>.","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>","short":"M. Mondelli, S.A. Hashemi, J.M. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 20 (2021) 18–27.","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>.","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."}},{"issue":"2","external_id":{"arxiv":["1703.01859"]},"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1703.01859"}],"doi":"10.1145/3446383","date_updated":"2026-08-12T14:03:54Z","intvolume":"        68","department":[{"_id":"DaAl"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter","full_name":"Davies, Peter","orcid":"0000-0002-5646-9524"}],"date_created":"2024-04-03T07:41:46Z","publisher":"ACM","fulldoi":"https://doi.org/10.1145/3446383","type":"journal_article","volume":68,"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"}],"publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"keyword":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"title":"Exploiting spontaneous transmissions for broadcasting and leader election in radio networks","month":"01","arxiv":1,"article_processing_charge":"No","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"date_published":"2021-01-28T00:00:00Z","year":"2021","status":"public","quality_controlled":"1","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>","ista":"Czumaj A, Davies P. 2021. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. 68(2), 13.","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>","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>.","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>.","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.","short":"A. Czumaj, P. Davies, Journal of the ACM 68 (2021)."},"_id":"15267","day":"28","publication":"Journal of the ACM","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"13"},{"publisher":"World Scientific Publishing","page":"2165-2212","department":[{"_id":"JuFi"}],"intvolume":"        31","date_updated":"2025-04-15T08:31:30Z","date_created":"2021-12-26T23:01:27Z","author":[{"last_name":"Abbatiello","first_name":"Anna","full_name":"Abbatiello, Anna"},{"first_name":"Miroslav","full_name":"Bulíček, Miroslav","last_name":"Bulíček"},{"last_name":"Maringová","full_name":"Maringová, Erika","first_name":"Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4"}],"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_status":"published","isi":1,"issue":"11","external_id":{"arxiv":["2009.09057"],"isi":["000722309400001"]},"ddc":["510"],"arxiv":1,"title":"On the dynamic slip boundary condition for Navier-Stokes-like problems","month":"10","publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"fulldoi":"https://doi.org/10.1142/S0218202521500470","type":"journal_article","volume":31,"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."}],"file":[{"creator":"dernst","file_id":"11385","file_size":795483,"checksum":"8c0a9396335f0b70e1f5cbfe450a987a","access_level":"open_access","date_created":"2022-05-16T10:55:45Z","success":1,"content_type":"application/pdf","date_updated":"2022-05-16T10:55:45Z","file_name":"2021_MathModelsMethods_Abbatiello.pdf","relation":"main_file"}],"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"},{"call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and dispersion in nonlinear partial differential equations","grant_number":"W1245"}],"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-10-13T00:00:00Z","oa":1,"article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2022-05-16T10:55:45Z","has_accepted_license":"1","day":"13","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication":"Mathematical Models and Methods in Applied Sciences","article_type":"original","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"scopus_import":"1","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>.","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.","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>","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.","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>","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>."},"_id":"10575","status":"public","quality_controlled":"1"},{"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."}],"volume":31,"type":"journal_article","fulldoi":"https://doi.org/10.1142/S0218202521500457","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"arxiv":1,"publication_identifier":{"issn":["0218-2025"],"eissn":["1793-6314"]},"month":"08","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"isi":1,"publication_status":"published","external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"issue":"09","author":[{"last_name":"Bulíček","full_name":"Bulíček, Miroslav","first_name":"Miroslav"},{"last_name":"Maringová","full_name":"Maringová, Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","first_name":"Erika"},{"last_name":"Málek","full_name":"Málek, Josef","first_name":"Josef"}],"date_created":"2021-09-12T22:01:25Z","department":[{"_id":"JuFi"}],"intvolume":"        31","date_updated":"2026-08-18T07:47:39Z","publisher":"World Scientific Publishing","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","main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"doi":"10.1142/S0218202521500457","scopus_import":"1","quality_controlled":"1","status":"public","_id":"10005","citation":{"short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).","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>.","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.","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>.","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>","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)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"25","article_type":"original","publication":"Mathematical Models and Methods in Applied Sciences","oa_version":"Preprint","article_processing_charge":"No","date_published":"2021-08-25T00:00:00Z","year":"2021","language":[{"iso":"eng"}],"oa":1},{"month":"05","title":"Scalable verification of quantized neural networks","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"ddc":["000"],"arxiv":1,"file":[{"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_size":137235,"file_id":"10684","creator":"mlechner","relation":"main_file","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","content_type":"application/pdf","date_updated":"2022-01-26T07:41:16Z","date_created":"2022-01-26T07:41:16Z","success":1,"access_level":"open_access"}],"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"abstract":[{"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.","lang":"eng"}],"volume":35,"fulldoi":"https://doi.org/10.1609/aaai.v35i5.16496","type":"conference","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","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"page":"3787-3795","publisher":"AAAI Press","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2022-01-25T15:15:02Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2026-08-19T09:28:05Z","intvolume":"        35","external_id":{"arxiv":["2012.08185"]},"corr_author":"1","issue":"5A","conference":{"location":"Virtual","end_date":"2021-02-09","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","alternative_title":["Technical Tracks"],"ec_funded":1,"has_accepted_license":"1","_id":"10665","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>.","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.","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>","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.","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>","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>."},"quality_controlled":"1","status":"public","scopus_import":"1","oa":1,"date_published":"2021-05-28T00:00:00Z","year":"2021","language":[{"iso":"eng"}],"file_date_updated":"2022-01-26T07:41:16Z","oa_version":"Published Version","article_processing_charge":"No"},{"file":[{"access_level":"open_access","success":1,"date_created":"2022-01-26T07:36:03Z","content_type":"application/pdf","date_updated":"2022-01-26T07:36:03Z","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","relation":"main_file","creator":"mlechner","file_id":"10678","file_size":4302669,"checksum":"0f06995fba06dbcfa7ed965fc66027ff"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"type":"conference","fulldoi":"https://doi.org/10.1609/aaai.v35i9.16936","abstract":[{"lang":"eng","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."}],"volume":35,"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"title":"Liquid time-constant networks","month":"05","arxiv":1,"ddc":["000"],"issue":"9","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual"},"corr_author":"1","external_id":{"arxiv":["2006.04439"]},"publication_status":"published","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936","open_access":"1"}],"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.","doi":"10.1609/aaai.v35i9.16936","date_updated":"2026-08-19T09:24:30Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"intvolume":"        35","author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"date_created":"2022-01-25T15:48:36Z","publisher":"AAAI Press","page":"7657-7666","status":"public","quality_controlled":"1","citation":{"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>.","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.","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>","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.","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>."},"_id":"10671","alternative_title":["Technical Tracks"],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","has_accepted_license":"1","file_date_updated":"2022-01-26T07:36:03Z","article_processing_charge":"No","oa_version":"Published Version","oa":1,"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-05-28T00:00:00Z"},{"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"}],"volume":35,"type":"conference","fulldoi":"https://doi.org/10.1609/aaai.v35i9.16999","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"arxiv":1,"publication_identifier":{"isbn":["9781713835974"],"eissn":["2374-3468"],"issn":["2159-5399"]},"month":"05","title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","publication_status":"published","external_id":{"arxiv":["1905.11845"]},"issue":"9B","conference":{"start_date":"2021-02-02","end_date":"2021-02-09","location":"Virtual, Online","name":"AAAI: Conference on Artificial Intelligence"},"date_created":"2022-06-05T22:01:52Z","author":[{"full_name":"Kungurtsev, Vyacheslav","first_name":"Vyacheslav","last_name":"Kungurtsev"},{"last_name":"Egan","full_name":"Egan, Malcolm","first_name":"Malcolm"},{"last_name":"Chatterjee","full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"}],"department":[{"_id":"DaAl"}],"date_updated":"2026-08-19T09:25:06Z","intvolume":"        35","page":"8209-8216","publisher":"AAAI Press","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).","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}],"doi":"10.1609/aaai.v35i9.16999","scopus_import":"1","quality_controlled":"1","status":"public","_id":"11436","citation":{"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>","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>","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.","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>.","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.","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."},"ec_funded":1,"publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","oa_version":"Preprint","article_processing_charge":"No","year":"2021","date_published":"2021-05-18T00:00:00Z","language":[{"iso":"eng"}],"oa":1},{"file_date_updated":"2022-01-26T07:38:08Z","article_processing_charge":"No","oa_version":"Published Version","oa":1,"language":[{"iso":"eng"}],"date_published":"2021-05-28T00:00:00Z","year":"2021","citation":{"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>.","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>","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>","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.","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.","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.","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>."},"_id":"10669","status":"public","quality_controlled":"1","day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","alternative_title":["Technical Tracks"],"has_accepted_license":"1","issue":"13","conference":{"end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"corr_author":"1","external_id":{"arxiv":["2012.08863"]},"publication_status":"published","doi":"10.1609/aaai.v35i13.17372","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","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"publisher":"AAAI Press","page":"11525-11535","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2026-08-19T09:29:48Z","intvolume":"        35","date_created":"2022-01-25T15:47:20Z","author":[{"first_name":"Sophie","full_name":"Grunbacher, Sophie","last_name":"Grunbacher"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Cyranka","first_name":"Jacek","full_name":"Cyranka, Jacek"},{"last_name":"Smolka","first_name":"Scott A","full_name":"Smolka, Scott A"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"file":[{"creator":"mlechner","checksum":"468d07041e282a1d46ffdae92f709630","file_id":"10680","file_size":286906,"date_updated":"2022-01-26T07:38:08Z","content_type":"application/pdf","date_created":"2022-01-26T07:38:08Z","success":1,"access_level":"open_access","relation":"main_file","file_name":"17372-Article Text-20866-1-2-20210518.pdf"}],"type":"conference","fulldoi":"https://doi.org/10.1609/aaai.v35i13.17372","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."}],"volume":35,"title":"On the verification of neural ODEs with stochastic guarantees","month":"05","publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"ddc":["000"],"arxiv":1},{"corr_author":"1","OA_place":"publisher","supervisor":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"publication_status":"published","doi":"10.15479/at:ista:10429","author":[{"last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi"}],"date_created":"2021-12-08T21:52:28Z","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"date_updated":"2026-08-19T09:30:23Z","page":"132","publisher":"Institute of Science and Technology Austria","file":[{"access_level":"open_access","success":1,"date_created":"2021-12-09T17:47:49Z","date_updated":"2021-12-09T17:47:49Z","content_type":"application/pdf","file_name":"Thesis_Final_09_12_2021.pdf","relation":"main_file","creator":"gnadirad","file_id":"10436","file_size":2370859,"checksum":"6bf14e9a523387328f016c0689f5e10e"},{"creator":"gnadirad","file_size":2596924,"file_id":"10437","checksum":"914d6c5ca86bd0add471971a8f4c4341","access_level":"closed","date_updated":"2022-03-28T12:55:12Z","content_type":"application/zip","date_created":"2021-12-09T17:47:49Z","file_name":"Thesis_Final_09_12_2021.zip","relation":"source_file"}],"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"abstract":[{"text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same.","lang":"eng"}],"type":"dissertation","fulldoi":"https://doi.org/10.15479/at:ista:10429","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"relation":"part_of_dissertation","id":"6673","status":"public"},{"id":"5965","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10435"},{"relation":"part_of_dissertation","id":"10432","status":"public"}]},"month":"12","title":"On achieving scalability through relaxation","ddc":["000"],"file_date_updated":"2022-03-28T12:55:12Z","oa_version":"Published Version","article_processing_charge":"No","degree_awarded":"PhD","oa":1,"year":"2021","date_published":"2021-12-09T00:00:00Z","language":[{"iso":"eng"}],"status":"public","_id":"10429","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>.","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>","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.","short":"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>.","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021."},"alternative_title":["ISTA Thesis"],"day":"09","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ec_funded":1,"has_accepted_license":"1"},{"related_material":{"record":[{"status":"public","id":"10429","relation":"dissertation_contains"}]},"title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","month":"05","arxiv":1,"ddc":["000"],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"type":"conference","fulldoi":"https://doi.org/10.1609/aaai.v35i10.17092","volume":35,"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."}],"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).","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092"}],"doi":"10.1609/aaai.v35i10.17092","date_updated":"2026-08-19T09:30:23Z","intvolume":"        35","department":[{"_id":"DaAl"}],"date_created":"2021-12-09T09:21:35Z","author":[{"last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi"},{"first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia","last_name":"Markov"},{"last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi","orcid":"0000-0002-2742-4028","full_name":"Chatterjee, Bapi"},{"full_name":"Kungurtsev, Vyacheslav ","first_name":"Vyacheslav ","last_name":"Kungurtsev"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"page":"9037-9045","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual"},"issue":"10","external_id":{"arxiv":["2001.05918"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","day":"18","ec_funded":1,"status":"public","quality_controlled":"1","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>.","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.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. ; 2021:9037-9045. 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.","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>","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>."},"_id":"10432","oa":1,"language":[{"iso":"eng"}],"date_published":"2021-05-18T00:00:00Z","year":"2021","article_processing_charge":"No","oa_version":"Published Version"},{"status":"public","citation":{"short":"A.L. Shute, ArXiv (n.d.).","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>. .","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>.","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>","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","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>"},"_id":"12077","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"30","publication":"arXiv","article_number":"2104.14946","article_processing_charge":"No","das_tickbox":"0","oa_version":"Preprint","researchdata_availability":"no","oa":1,"language":[{"iso":"eng"}],"date_published":"2021-04-30T00:00:00Z","year":"2021","fulldoi":"https://doi.org/10.48550/arXiv.2104.14946","type":"preprint","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."}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12072"},{"status":"public","id":"17058","relation":"later_version"}]},"title":"On the leading constant in the Manin-type conjecture for Campana points","month":"04","arxiv":1,"external_id":{"arxiv":["2104.14946"]},"corr_author":"1","supplementarymaterial":"no","publication_status":"draft","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.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.14946"}],"doi":"10.48550/arXiv.2104.14946","department":[{"_id":"TiBr"}],"date_updated":"2026-08-19T12:54:58Z","date_created":"2022-09-09T10:43:17Z","author":[{"orcid":"0000-0002-1812-2810","full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","first_name":"Alec L","last_name":"Shute"}]},{"project":[{"_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics"}],"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"}],"volume":126,"type":"journal_article","fulldoi":"https://doi.org/10.1103/PhysRevLett.126.244502","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"related_material":{"record":[{"relation":"popular_science","id":"19591","status":"returned"},{"status":"public","id":"19684","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/turbulent-flow-simplified/","relation":"press_release","description":"News on IST Homepage"}]},"month":"06","title":"Coarse graining the state space of a turbulent flow using periodic orbits","arxiv":1,"external_id":{"isi":["000663310100008"],"arxiv":["2007.02584"]},"corr_author":"1","issue":"24","isi":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.02584"}],"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.","doi":"10.1103/PhysRevLett.126.244502","author":[{"full_name":"Yalniz, Gökhan","orcid":"0000-0002-8490-9312","first_name":"Gökhan","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","last_name":"Yalniz"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","last_name":"Hof"},{"last_name":"Budanur","orcid":"0000-0003-0423-5010","full_name":"Budanur, Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","first_name":"Nazmi B"}],"date_created":"2021-06-16T15:45:36Z","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"intvolume":"       126","date_updated":"2026-09-02T08:16:31Z","publisher":"American Physical Society","quality_controlled":"1","status":"public","_id":"9558","citation":{"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.","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>","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>","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>.","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>.","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.","short":"G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021)."},"scopus_import":"1","publication":"Physical Review Letters","article_type":"letter_note","day":"18","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"244502","acknowledged_ssus":[{"_id":"ScienComp"}],"oa_version":"Preprint","article_processing_charge":"No","oa":1,"year":"2021","date_published":"2021-06-18T00:00:00Z","language":[{"iso":"eng"}]},{"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"date_updated":"2026-09-07T14:12:38Z","author":[{"last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen"}],"date_created":"2021-09-23T07:31:44Z","publisher":"Institute of Science and Technology Austria","page":"276","acknowledgement":"I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n","doi":"10.15479/at:ista:10035","supervisor":[{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"OA_place":"publisher","publication_status":"published","corr_author":"1","ddc":["519"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"637","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6430"},{"relation":"part_of_dissertation","id":"10044","status":"public"},{"status":"public","id":"10048","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10041","status":"public"},{"id":"10049","status":"public","relation":"part_of_dissertation"}]},"publication_identifier":{"issn":["2663-337X"]},"title":"On the adaptive security of graph-based games","month":"09","type":"dissertation","fulldoi":"https://doi.org/10.15479/at:ista:10035","abstract":[{"lang":"eng","text":"Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for \"graph-building\" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c])."}],"file":[{"date_updated":"2021-10-04T12:22:33Z","content_type":"application/pdf","date_created":"2021-10-04T12:22:33Z","success":1,"access_level":"open_access","relation":"main_file","file_name":"thesis_pdfa.pdf","creator":"cchlebak","checksum":"73a44345c683e81f3e765efbf86fdcc5","file_id":"10082","file_size":2104726},{"file_id":"10085","file_size":9538359,"checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","creator":"cchlebak","file_name":"thesis_final (1).zip","relation":"source_file","access_level":"closed","date_updated":"2022-03-10T12:15:18Z","content_type":"application/x-zip-compressed","date_created":"2021-10-05T07:04:37Z"}],"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"language":[{"iso":"eng"}],"date_published":"2021-09-23T00:00:00Z","year":"2021","degree_awarded":"PhD","oa":1,"article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2022-03-10T12:15:18Z","has_accepted_license":"1","ec_funded":1,"alternative_title":["ISTA Thesis"],"day":"23","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","citation":{"ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.","chicago":"Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>.","short":"K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.","ama":"Klein K. On the adaptive security of graph-based games. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>","ista":"Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.","apa":"Klein, K. (2021). <i>On the adaptive security of graph-based games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>","mla":"Klein, Karen. <i>On the Adaptive Security of Graph-Based Games</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>."},"_id":"10035"},{"oa_version":"Submitted Version","article_processing_charge":"No","oa":1,"year":"2021","date_published":"2021-05-11T00:00:00Z","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","_id":"9826","citation":{"chicago":"Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:399–421. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>.","ieee":"B. Auerbach <i>et al.</i>, “Inverse-Sybil attacks in automated contact tracing,” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 399–421.","short":"B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 399–421.","ama":"Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:399-421. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>","apa":"Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., &#38; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>","ista":"Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421.","mla":"Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>."},"scopus_import":"1","alternative_title":["LNCS"],"publication":"Topics in Cryptology – CT-RSA 2021","day":"11","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ec_funded":1,"corr_author":"1","conference":{"name":"CT-RSA: Cryptographers’ Track at the RSA Conference","location":"Virtual Event","end_date":"2021-05-20","start_date":"2021-05-17"},"publication_status":"published","acknowledgement":"Guillermo Pascual-Perez and Michelle Yeo were funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie Grant Agreement No. 665385; the remaining contributors to this project have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/670"}],"doi":"10.1007/978-3-030-75539-3_17","author":[{"last_name":"Auerbach","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","first_name":"Benedikt","full_name":"Auerbach, Benedikt","orcid":"0000-0002-7553-6606"},{"first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty"},{"full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","last_name":"Klein"},{"last_name":"Pascual Perez","orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo","first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","last_name":"Walter"},{"first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","last_name":"Yeo"}],"date_created":"2021-08-08T22:01:30Z","intvolume":"     12704","date_updated":"2026-09-07T11:37:54Z","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"page":"399-421","publisher":"Springer Nature","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"volume":12704,"abstract":[{"text":"Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices.\r\n\r\nWe propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks.","lang":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-030-75539-3_17","type":"conference","publication_identifier":{"isbn":["9783030755386"],"eissn":["1611-3349"],"issn":["0302-9743"]},"month":"05","title":"Inverse-Sybil attacks in automated contact tracing"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"02","publication":"37th International Symposium on Computational Geometry","alternative_title":["LIPIcs"],"has_accepted_license":"1","ec_funded":1,"citation":{"mla":"Edelsbrunner, Herbert, et al. “The Density Fingerprint of a Periodic Point Set.” <i>37th International Symposium on Computational Geometry</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">10.4230/LIPIcs.SoCG.2021.32</a>.","apa":"Edelsbrunner, H., Heiss, T.,  Kurlin , V., Smith, P., &#38; Wintraecken, M. (2021). The density fingerprint of a periodic point set. In <i>37th International Symposium on Computational Geometry</i> (Vol. 189, p. 32:1-32:16). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">https://doi.org/10.4230/LIPIcs.SoCG.2021.32</a>","ista":"Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.","ama":"Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. The density fingerprint of a periodic point set. In: <i>37th International Symposium on Computational Geometry</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:32:1-32:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">10.4230/LIPIcs.SoCG.2021.32</a>","short":"H. Edelsbrunner, T. Heiss, V.  Kurlin , P. Smith, M. Wintraecken, in:, 37th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16.","chicago":"Edelsbrunner, Herbert, Teresa Heiss, Vitaliy  Kurlin , Philip Smith, and Mathijs Wintraecken. “The Density Fingerprint of a Periodic Point Set.” In <i>37th International Symposium on Computational Geometry</i>, 189:32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">https://doi.org/10.4230/LIPIcs.SoCG.2021.32</a>.","ieee":"H. Edelsbrunner, T. Heiss, V.  Kurlin , P. Smith, and M. Wintraecken, “The density fingerprint of a periodic point set,” in <i>37th International Symposium on Computational Geometry</i>, Virtual, 2021, vol. 189, p. 32:1-32:16."},"_id":"9345","status":"public","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-06-02T00:00:00Z","file_date_updated":"2021-04-22T08:08:14Z","article_processing_charge":"No","oa_version":"Published Version","das_tickbox":"1","title":"The density fingerprint of a periodic point set","month":"06","related_material":{"record":[{"id":"18667","status":"public","relation":"dissertation_contains"}]},"publication_identifier":{"issn":["1868-8969"]},"ddc":["004","516"],"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry","grant_number":"I4887"},{"name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"file":[{"relation":"main_file","file_name":"df_socg_final_version.pdf","success":1,"date_created":"2021-04-22T08:08:14Z","date_updated":"2021-04-22T08:08:14Z","content_type":"application/pdf","access_level":"open_access","checksum":"1787baef1523d6d93753b90d0c109a6d","file_size":3117435,"file_id":"9346","creator":"mwintrae"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2021.32","type":"conference","abstract":[{"text":"Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functionsthat facilitates the efficient search for new materials and material properties. We prove invarianceunder isometries, continuity, and completeness in the generic case, which are necessary featuresfor the reliable comparison of crystals. The proof of continuity integrates methods from discretegeometry and lattice theory, while the proof of generic completeness combines techniques fromgeometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and relatedinclusion-exclusion formulae. We have implemented the algorithm and describe its application tocrystal structure prediction.","lang":"eng"}],"volume":189,"doi":"10.4230/LIPIcs.SoCG.2021.32","acknowledgement":"The authors thank Janos Pach for insightful discussions on the topic of thispaper, Morteza Saghafian for finding the one-dimensional counterexample mentioned in Section 5,and Larry Andrews for generously sharing his crystallographic perspective.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"32:1-32:16","date_updated":"2026-10-02T11:24:33Z","intvolume":"       189","department":[{"_id":"HeEd"}],"author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","last_name":"Heiss"},{"last_name":" Kurlin ","first_name":"Vitaliy","full_name":" Kurlin , Vitaliy"},{"last_name":"Smith","first_name":"Philip","full_name":"Smith, Philip"},{"last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"date_created":"2021-04-22T08:09:58Z","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2021-06-07","end_date":"2021-06-11","location":"Virtual"},"publication_status":"published"},{"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","_id":"9928","citation":{"short":"M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, PRX Quantum 2 (2021) 040341.","ieee":"M. Peruzzo <i>et al.</i>, “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction,” <i>PRX Quantum</i>, vol. 2, no. 4. American Physical Society, p. 040341, 2021.","chicago":"Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">https://doi.org/10.1103/PRXQuantum.2.040341</a>.","mla":"Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>, vol. 2, no. 4, American Physical Society, 2021, p. 040341, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">10.1103/PRXQuantum.2.040341</a>.","apa":"Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., &#38; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">https://doi.org/10.1103/PRXQuantum.2.040341</a>","ista":"Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2(4), 040341.","ama":"Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. <i>PRX Quantum</i>. 2021;2(4):040341. doi:<a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">10.1103/PRXQuantum.2.040341</a>"},"quality_controlled":"1","status":"public","ec_funded":1,"has_accepted_license":"1","day":"24","article_type":"original","publication":"PRX Quantum","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","article_processing_charge":"No","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"file_date_updated":"2022-01-18T11:29:33Z","date_published":"2021-11-24T00:00:00Z","year":"2021","language":[{"iso":"eng"}],"oa":1,"volume":2,"abstract":[{"text":"There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits.","lang":"eng"}],"fulldoi":"https://doi.org/10.1103/PRXQuantum.2.040341","type":"journal_article","file":[{"creator":"cchlebak","checksum":"36eb41ea43d8ca22b0efab12419e4eb2","file_size":4247422,"file_id":"10641","date_updated":"2022-01-18T11:29:33Z","content_type":"application/pdf","success":1,"date_created":"2022-01-18T11:29:33Z","access_level":"open_access","relation":"main_file","file_name":"2021_PRXQuantum_Peruzzo.pdf"}],"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"2622978C-B435-11E9-9278-68D0E5697425"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105"}],"ddc":["530"],"arxiv":1,"month":"11","title":"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction","keyword":["quantum physics","mesoscale and nanoscale physics"],"publication_identifier":{"eissn":["2691-3399"]},"related_material":{"record":[{"relation":"research_data","status":"public","id":"13057"},{"relation":"dissertation_contains","id":"9920","status":"public"},{"id":"17133","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","isi":1,"external_id":{"isi":["000723015100001"],"arxiv":["2106.05882"]},"corr_author":"1","issue":"4","page":"040341","publisher":"American Physical Society","author":[{"orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","first_name":"Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo"},{"last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","full_name":"Hassani, Farid","orcid":"0000-0001-6937-5773"},{"last_name":"Szep","full_name":"Szep, Gregory","first_name":"Gregory"},{"last_name":"Trioni","full_name":"Trioni, Andrea","first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","last_name":"Redchenko"},{"last_name":"Zemlicka","orcid":"0009-0005-0878-3032","full_name":"Zemlicka, Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","last_name":"Fink"}],"date_created":"2021-08-17T08:14:18Z","date_updated":"2026-10-02T11:28:16Z","intvolume":"         2","department":[{"_id":"JoFi"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"doi":"10.1103/PRXQuantum.2.040341","acknowledgement":"We thank W. Hughes for analytic and numerical modeling during the early stages of this work, J. Koch for discussions and support with the scqubits package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros for equipment support, as well as the MIBA workshop and the Institute of Science and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise, and E. Flurin for discussions. This work was supported by a NOMIS Foundation research grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria. M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria."},{"article_processing_charge":"No","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-09-30T00:00:00Z","status":"public","quality_controlled":"1","citation":{"mla":"Medina Ramos, Raimel A., et al. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>, vol. 104, no. 10, 104205, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>.","ista":"Medina Ramos RA, Vasseur R, Serbyn M. 2021. Entanglement transitions from restricted Boltzmann machines. Physical Review B. 104(10), 104205.","apa":"Medina Ramos, R. A., Vasseur, R., &#38; Serbyn, M. (2021). Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>","ama":"Medina Ramos RA, Vasseur R, Serbyn M. Entanglement transitions from restricted Boltzmann machines. <i>Physical Review B</i>. 2021;104(10). doi:<a href=\"https://doi.org/10.1103/physrevb.104.104205\">10.1103/physrevb.104.104205</a>","short":"R.A. Medina Ramos, R. Vasseur, M. Serbyn, Physical Review B 104 (2021).","ieee":"R. A. Medina Ramos, R. Vasseur, and M. Serbyn, “Entanglement transitions from restricted Boltzmann machines,” <i>Physical Review B</i>, vol. 104, no. 10. American Physical Society, 2021.","chicago":"Medina Ramos, Raimel A, Romain Vasseur, and Maksym Serbyn. “Entanglement Transitions from Restricted Boltzmann Machines.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.104.104205\">https://doi.org/10.1103/physrevb.104.104205</a>."},"_id":"10067","scopus_import":"1","day":"30","article_type":"original","publication":"Physical Review B","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"104205","ec_funded":1,"issue":"10","corr_author":"1","external_id":{"isi":["000704414400002"],"arxiv":["2107.05735"]},"isi":1,"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/2107.05735","open_access":"1"}],"acknowledgement":"We would like to thank S. De Nicola, P. Brighi, and V. Karle for fruitful discussions and valuable feedback on the manuscript. R.M. and M.S. acknowledge support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Grant Agreement No. 850899). R.V. acknowledges support from the US Department of Energy, Office of Science, Basic Energy Sciences, under Early Career Award No. DE-SC0019168, and the Alfred P. Sloan Foundation through a Sloan Research Fellowship.","doi":"10.1103/physrevb.104.104205","intvolume":"       104","department":[{"_id":"MaSe"}],"date_updated":"2026-10-02T11:36:06Z","author":[{"last_name":"Medina Ramos","id":"CE680B90-D85A-11E9-B684-C920E6697425","first_name":"Raimel A","orcid":"0000-0002-5383-2869","full_name":"Medina Ramos, Raimel A"},{"first_name":"Romain","full_name":"Vasseur, Romain","last_name":"Vasseur"},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn"}],"date_created":"2021-10-02T09:03:42Z","publisher":"American Physical Society","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"fulldoi":"https://doi.org/10.1103/physrevb.104.104205","type":"journal_article","abstract":[{"lang":"eng","text":"The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions."}],"volume":104,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"17208"}]},"publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"title":"Entanglement transitions from restricted Boltzmann machines","month":"09","arxiv":1},{"scopus_import":"1","_id":"10545","citation":{"apa":"Medina Ramos, R. A., &#38; Serbyn, M. (2021). Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreva.104.062423\">https://doi.org/10.1103/physreva.104.062423</a>","ista":"Medina Ramos RA, Serbyn M. 2021. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review A. 104(6), 062423.","ama":"Medina Ramos RA, Serbyn M. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/physreva.104.062423\">10.1103/physreva.104.062423</a>","mla":"Medina Ramos, Raimel A., and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” <i>Physical Review A</i>, vol. 104, no. 6, 062423, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physreva.104.062423\">10.1103/physreva.104.062423</a>.","chicago":"Medina Ramos, Raimel A, and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physreva.104.062423\">https://doi.org/10.1103/physreva.104.062423</a>.","ieee":"R. A. Medina Ramos and M. Serbyn, “Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT),” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","short":"R.A. Medina Ramos, M. Serbyn, Physical Review A 104 (2021)."},"quality_controlled":"1","status":"public","ec_funded":1,"article_number":"062423","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication":"Physical Review A","day":"14","article_type":"original","oa_version":"Preprint","article_processing_charge":"No","year":"2021","date_published":"2021-12-14T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"abstract":[{"lang":"eng","text":"Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state. However, when the classical problem is in a so-called clustering phase, the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT model defined on simple hypergraphs. The degeneracy of classical ground state manifold translates into the emergence of an extensive number of Z2 symmetries, which remain intact even in the presence of a quantum transverse magnetic field. We establish a general duality approach that restricts the quantum problem to a given sector of conserved Z2 charges and use it to study how the outcome of the quantum adiabatic algorithm depends on the hypergraph geometry. We show that the tree hypergraph which corresponds to a classically solvable instance of the 3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters a second-order phase transition with a gap vanishing as a power-law in the problem size. The duality developed in this work provides a practical tool for studies of quantum models with classically degenerate energy manifold and reveals potential connections between glasses and gauge theories."}],"volume":104,"fulldoi":"https://doi.org/10.1103/physreva.104.062423","type":"journal_article","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"arxiv":1,"month":"12","title":"Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT)","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"related_material":{"record":[{"id":"17208","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","isi":1,"external_id":{"arxiv":["2106.06344"],"isi":["000753659200004"]},"issue":"6","publisher":"American Physical Society","date_created":"2021-12-14T20:46:07Z","author":[{"last_name":"Medina Ramos","id":"CE680B90-D85A-11E9-B684-C920E6697425","first_name":"Raimel A","full_name":"Medina Ramos, Raimel A","orcid":"0000-0002-5383-2869"},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"}],"date_updated":"2026-10-02T11:36:06Z","intvolume":"       104","department":[{"_id":"MaSe"}],"doi":"10.1103/physreva.104.062423","acknowledgement":"We would like to thank S. De Nicola, A. Michaidilis, T. Gulden, Y. Nez-Fernndez, P. Brighi, and S. Sack for fruitful discussions and valuable feedback on the manuscript. M.S. acknowledges useful discussions with E. Altman, L. Cugliandolo, and C. Laumann. We acknowledge support from the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme Grant Agreement No. 850899.","main_file_link":[{"url":"https://arxiv.org/abs/2106.06344","open_access":"1"}]},{"scopus_import":"1","citation":{"ista":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. 2021. Statistical analysis and optimality of neural systems. Neuron. 109(7), 1227–1241.e5.","apa":"Mlynarski, W. F., Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2021). Statistical analysis and optimality of neural systems. <i>Neuron</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">https://doi.org/10.1016/j.neuron.2021.01.020</a>","ama":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. Statistical analysis and optimality of neural systems. <i>Neuron</i>. 2021;109(7):1227-1241.e5. doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">10.1016/j.neuron.2021.01.020</a>","mla":"Mlynarski, Wiktor F., et al. “Statistical Analysis and Optimality of Neural Systems.” <i>Neuron</i>, vol. 109, no. 7, Cell Press, 2021, p. 1227–1241.e5, doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">10.1016/j.neuron.2021.01.020</a>.","ieee":"W. F. Mlynarski, M. Hledik, T. R. Sokolowski, and G. Tkačik, “Statistical analysis and optimality of neural systems,” <i>Neuron</i>, vol. 109, no. 7. Cell Press, p. 1227–1241.e5, 2021.","chicago":"Mlynarski, Wiktor F, Michal Hledik, Thomas R Sokolowski, and Gašper Tkačik. “Statistical Analysis and Optimality of Neural Systems.” <i>Neuron</i>. Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">https://doi.org/10.1016/j.neuron.2021.01.020</a>.","short":"W.F. Mlynarski, M. Hledik, T.R. Sokolowski, G. Tkačik, Neuron 109 (2021) 1227–1241.e5."},"_id":"7553","status":"public","quality_controlled":"1","ec_funded":1,"publication":"Neuron","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Preprint","language":[{"iso":"eng"}],"pmid":1,"year":"2021","date_published":"2021-04-07T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1016/j.neuron.2021.01.020","type":"journal_article","volume":109,"abstract":[{"text":"Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems.","lang":"eng"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"title":"Statistical analysis and optimality of neural systems","month":"04","related_material":{"link":[{"url":"https://ist.ac.at/en/news/can-evolution-be-predicted/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"relation":"dissertation_contains","status":"public","id":"15020"}]},"publication_status":"published","isi":1,"issue":"7","external_id":{"isi":["000637809600006"],"pmid":["33592180"]},"corr_author":"1","publisher":"Cell Press","page":"1227-1241.e5","intvolume":"       109","department":[{"_id":"GaTk"}],"date_updated":"2026-10-02T11:40:30Z","author":[{"last_name":"Mlynarski","first_name":"Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87","full_name":"Mlynarski, Wiktor F"},{"first_name":"Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87","full_name":"Hledik, Michal","last_name":"Hledik"},{"last_name":"Sokolowski","id":"3E999752-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas R","orcid":"0000-0002-1287-3779","full_name":"Sokolowski, Thomas R"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper"}],"date_created":"2020-02-28T11:00:12Z","doi":"10.1016/j.neuron.2021.01.020","acknowledgement":"The authors thank Dario Ringach for providing the V1 receptive fields and Olivier Marre for providing the retinal receptive fields. W.M. was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411. M.H. was funded in part by Human Frontiers Science grant no. HFSP RGP0032/2018.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/848374"}]}]