[{"_id":"10222","quality_controlled":"1","oa_version":"Published Version","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887","name":"Persistent Homology, Algorithms and Stochastic Geometry"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"short":"A. Akopyan, H. Edelsbrunner, A. Nikitenko, Experimental Mathematics (2021) 1–15.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, and Anton Nikitenko. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>. Taylor &#38; Francis, 2021. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>.","apa":"Akopyan, A., Edelsbrunner, H., &#38; Nikitenko, A. (2021). The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10586458.2021.1980459\">https://doi.org/10.1080/10586458.2021.1980459</a>","ama":"Akopyan A, Edelsbrunner H, Nikitenko A. The beauty of random polytopes inscribed in the 2-sphere. <i>Experimental Mathematics</i>. 2021:1-15. doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>","ista":"Akopyan A, Edelsbrunner H, Nikitenko A. 2021. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics., 1–15.","mla":"Akopyan, Arseniy, et al. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” <i>Experimental Mathematics</i>, Taylor &#38; Francis, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1080/10586458.2021.1980459\">10.1080/10586458.2021.1980459</a>.","ieee":"A. Akopyan, H. Edelsbrunner, and A. Nikitenko, “The beauty of random polytopes inscribed in the 2-sphere,” <i>Experimental Mathematics</i>. Taylor &#38; Francis, pp. 1–15, 2021."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1080/10586458.2021.1980459","department":[{"_id":"HeEd"}],"scopus_import":"1","title":"The beauty of random polytopes inscribed in the 2-sphere","date_updated":"2026-07-07T05:33:35Z","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","first_name":"Arseniy"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Anton","orcid":"0000-0002-0659-3201","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton"}],"external_id":{"arxiv":["2007.07783"],"isi":["000710893500001"]},"day":"25","article_type":"original","publication_identifier":{"issn":["1058-6458"],"eissn":["1944-950X"]},"file_date_updated":"2023-08-14T11:55:10Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.\r\nWe are grateful to Dmitry Zaporozhets and Christoph Thäle for valuable comments and for directing us to relevant references. We also thank to Anton Mellit for a useful discussion on Bessel functions.","arxiv":1,"das_tickbox":"1","month":"10","corr_author":"1","status":"public","publication":"Experimental Mathematics","ddc":["510"],"language":[{"iso":"eng"}],"date_created":"2021-11-07T23:01:25Z","abstract":[{"text":"Consider a random set of points on the unit sphere in ℝd, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the case d = 3, for which there are elementary proofs and fascinating formulas for metric properties. In particular, we study the fraction of acute facets, the expected intrinsic volumes, the total edge length, and the distance to a fixed point. Finally we generalize the results to the ellipsoid with homeoid density.","lang":"eng"}],"has_accepted_license":"1","publisher":"Taylor & Francis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-10-25T00:00:00Z","publication_status":"published","year":"2021","article_processing_charge":"Yes (via OA deal)","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":1966019,"checksum":"3514382e3a1eb87fa6c61ad622874415","creator":"dernst","file_name":"2023_ExperimentalMath_Akopyan.pdf","date_created":"2023-08-14T11:55:10Z","relation":"main_file","date_updated":"2023-08-14T11:55:10Z","file_id":"14053","success":1}],"type":"journal_article","isi":1,"ec_funded":1,"oa":1,"page":"1-15"},{"day":"01","article_type":"original","acknowledgement":"H2020 Marie Skłodowska-Curie Actions (642841); European Research Council (715767); Grantová Agentura České Republiky (16-08111S, 16-18964S); Univerzita Karlova v Praze (SVV-2017-260452); Engineering and Physical Sciences Research Council (EP/K023578/1).\r\nWe are grateful to Stratasys Ltd. for access to the voxel-level print interface of the J750\r\nmachine.","publication_identifier":{"eissn":["1094-4087"]},"file_date_updated":"2021-03-22T08:15:28Z","external_id":{"isi":["000624968100103"]},"author":[{"last_name":"Elek","first_name":"Oskar","full_name":"Elek, Oskar"},{"first_name":"Ran","orcid":"0000-0002-3808-281X","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Ran"},{"full_name":"Sumin, Denis","first_name":"Denis","last_name":"Sumin"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"last_name":"Wilkie","first_name":"Alexander","full_name":"Wilkie, Alexander"},{"full_name":"Křivánek, Jaroslav","first_name":"Jaroslav","last_name":"Křivánek"},{"last_name":"Weyrich","first_name":"Tim","full_name":"Weyrich, Tim"}],"title":"Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing","date_updated":"2026-07-07T05:54:53Z","department":[{"_id":"BeBi"}],"scopus_import":"1","volume":29,"project":[{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"doi":"10.1364/OE.406095","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ieee":"O. Elek <i>et al.</i>, “Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing,” <i>Optics Express</i>, vol. 29, no. 5. Optica Publishing Group, pp. 7568–7588, 2021.","mla":"Elek, Oskar, et al. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>, vol. 29, no. 5, Optica Publishing Group, 2021, pp. 7568–88, doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>.","ama":"Elek O, Zhang R, Sumin D, et al. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. 2021;29(5):7568-7588. doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>","ista":"Elek O, Zhang R, Sumin D, Myszkowski K, Bickel B, Wilkie A, Křivánek J, Weyrich T. 2021. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. Optics Express. 29(5), 7568–7588.","apa":"Elek, O., Zhang, R., Sumin, D., Myszkowski, K., Bickel, B., Wilkie, A., … Weyrich, T. (2021). Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>","chicago":"Elek, Oskar, Ran Zhang, Denis Sumin, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, Jaroslav Křivánek, and Tim Weyrich. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>. Optica Publishing Group, 2021. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>.","short":"O. Elek, R. Zhang, D. Sumin, K. Myszkowski, B. Bickel, A. Wilkie, J. Křivánek, T. Weyrich, Optics Express 29 (2021) 7568–7588."},"_id":"9241","quality_controlled":"1","oa_version":"Published Version","page":"7568-7588","isi":1,"ec_funded":1,"type":"journal_article","oa":1,"publication_status":"published","year":"2021","article_processing_charge":"No","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":10873700,"creator":"dernst","checksum":"a9697ad83136c19ad87e46aa2db63cfd","file_name":"2021_OpticsExpress_Elek.pdf","relation":"main_file","date_created":"2021-03-22T08:15:28Z","date_updated":"2021-03-22T08:15:28Z","file_id":"9269","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-03-01T00:00:00Z","abstract":[{"lang":"eng","text":"Volumetric light transport is a pervasive physical phenomenon, and therefore its accurate simulation is important for a broad array of disciplines. While suitable mathematical models for computing the transport are now available, obtaining the necessary material parameters needed to drive such simulations is a challenging task: direct measurements of these parameters from material samples are seldom possible. Building on the inverse scattering paradigm, we present a novel measurement approach which indirectly infers the transport parameters from extrinsic observations of multiple-scattered radiance. The novelty of the proposed approach lies in replacing structured illumination with a structured reflector bonded to the sample, and a robust fitting procedure that largely compensates for potential systematic errors in the calibration of the setup. We show the feasibility of our approach by validating simulations of complex 3D compositions of the measured materials against physical prints, using photo-polymer resins. As presented in this paper, our technique yields colorspace data suitable for accurate appearance reproduction in the area of 3D printing. Beyond that, and without fundamental changes to the basic measurement methodology, it could equally well be used to obtain spectral measurements that are useful for other application areas."}],"has_accepted_license":"1","date_created":"2021-03-14T23:01:33Z","publisher":"Optica Publishing Group","language":[{"iso":"eng"}],"intvolume":"        29","issue":"5","month":"03","ddc":["000"],"status":"public","publication":"Optics Express"},{"language":[{"iso":"eng"}],"OA_type":"green","publisher":"IEEE","date_created":"2022-01-25T15:44:54Z","abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"has_accepted_license":"1","publication":"2021 IEEE International Conference on Robotics and Automation","status":"public","month":"06","ddc":["000"],"das_tickbox":"1","oa":1,"type":"conference","isi":1,"page":"4140-4147","date_published":"2021-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2021","article_processing_charge":"No","doi":"10.1109/ICRA48506.2021.9561036","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. IEEE, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, IEEE, 2021, pp. 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, IEEE, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. IEEE; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China: IEEE. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 4140–4147."},"project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"scopus_import":"1","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"_id":"10666","external_id":{"arxiv":["2103.08187"],"isi":["000765738803040"]},"OA_place":"repository","conference":{"end_date":"2021-06-05","start_date":"2021-05-30","name":"ICRA: International Conference on Robotics and Automation","location":"Xi'an, China"},"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","arxiv":1,"day":"01","publication_identifier":{"eissn":["2577-087X"],"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"]},"acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"title":"Adversarial training is not ready for robot learning","date_updated":"2026-07-07T06:20:35Z","author":[{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}]},{"conference":{"end_date":"2021-07-08","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","location":" Virtual Event, United States","start_date":"2021-07-06"},"external_id":{"arxiv":["2005.07761"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15074"}]},"publication_identifier":{"isbn":["9781450380706"]},"acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","day":"06","arxiv":1,"date_updated":"2026-07-07T06:21:32Z","title":"Efficient load-balancing through distributed token dropping","author":[{"first_name":"Sebastian","last_name":"Brandt","full_name":"Brandt, Sebastian"},{"full_name":"Keller, Barbara","last_name":"Keller","first_name":"Barbara"},{"full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"project":[{"grant_number":"840605","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"doi":"10.1145/3409964.3461785","citation":{"ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>,  Virtual Event, United States, 2021, pp. 129–139.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 129–39, doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 129–139).  Virtual Event, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:129-139. doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 129–39. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 129–139."},"scopus_import":"1","department":[{"_id":"DaAl"}],"_id":"9678","main_file_link":[{"url":"https://arxiv.org/abs/2005.07761","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","ec_funded":1,"type":"conference","oa":1,"page":"129-139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-07-06T00:00:00Z","year":"2021","article_processing_charge":"No","publication_status":"published","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively."}],"date_created":"2021-07-18T22:01:22Z","publisher":"Association for Computing Machinery","das_tickbox":"1","status":"public","month":"07","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures"},{"oa_version":"Published Version","quality_controlled":"1","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"_id":"10667","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"citation":{"ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>."},"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"doi":"10.48550/arXiv.2111.03165","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"title":"Infinite time horizon safety of Bayesian neural networks","date_updated":"2026-07-07T06:49:10Z","arxiv":1,"day":"01","file_date_updated":"2022-01-26T07:39:59Z","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"issn":["1049-5258"]},"external_id":{"arxiv":["2111.03165"]},"conference":{"start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","end_date":"2021-12-10"},"status":"public","ddc":["000"],"month":"12","corr_author":"1","publication":"35th Conference on Neural Information Processing Systems","das_tickbox":"1","publisher":"Neural Information Processing Systems Foundation","abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"has_accepted_license":"1","date_created":"2022-01-25T15:45:58Z","alternative_title":[" Advances in Neural Information Processing Systems"],"language":[{"iso":"eng"}],"file":[{"file_id":"10682","success":1,"date_updated":"2022-01-26T07:39:59Z","date_created":"2022-01-26T07:39:59Z","relation":"main_file","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","creator":"mlechner","file_name":"infinite_time_horizon_safety_o.pdf","file_size":452492,"access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","year":"2021","article_processing_charge":"No","date_published":"2021-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"conference","ec_funded":1},{"das_tickbox":"1","ddc":["000"],"publication":"35th Conference on Neural Information Processing Systems","status":"public","month":"12","date_created":"2022-01-25T15:47:50Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"alternative_title":[" Advances in Neural Information Processing Systems"],"publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"publication_status":"published","year":"2021","article_processing_charge":"No","file":[{"file_id":"10679","success":1,"date_updated":"2022-01-26T07:37:24Z","date_created":"2022-01-26T07:37:24Z","relation":"main_file","creator":"mlechner","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","checksum":"be81f0ade174a8c9b2d4fe09590b2021","file_size":6841228,"access_level":"open_access","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-01T00:00:00Z","type":"conference","oa":1,"_id":"10670","quality_controlled":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation."},"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"author":[{"full_name":"Vorbach, Charles J","first_name":"Charles J","last_name":"Vorbach"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"}],"title":"Causal navigation by continuous-time neural networks","date_updated":"2026-07-07T06:49:46Z","day":"01","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","publication_identifier":{"issn":["1049-5258"]},"file_date_updated":"2022-01-26T07:37:24Z","arxiv":1,"conference":{"end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06"},"external_id":{"arxiv":["2106.08314"]}},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"quality_controlled":"1","oa_version":"Preprint","_id":"9293","doi":"10.1016/j.artint.2021.103499","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>.","short":"K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>, vol. 297, no. 8, 103499, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>.","ieee":"K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” <i>Artificial Intelligence</i>, vol. 297, no. 8. Elsevier, 2021.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M., &#38; Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>","ista":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","ama":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. 2021;297(8). doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>"},"volume":297,"department":[{"_id":"KrCh"}],"scopus_import":"1","date_updated":"2026-07-07T13:36:04Z","title":"Algorithms and conditional lower bounds for planning problems","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"external_id":{"arxiv":["1804.07031"],"isi":["000657537500003"]},"arxiv":1,"related_material":{"record":[{"relation":"earlier_version","id":"35","status":"public"}]},"article_type":"original","publication_identifier":{"issn":["0004-3702"]},"day":"16","publication":"Artificial Intelligence","month":"03","corr_author":"1","status":"public","issue":"8","intvolume":"       297","language":[{"iso":"eng"}],"publisher":"Elsevier","date_created":"2021-03-28T22:01:40Z","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"article_number":"103499","date_published":"2021-03-16T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","year":"2021","publication_status":"published","oa":1,"type":"journal_article","isi":1},{"conference":{"end_date":"2021-06-11","name":"SoCG: Symposium on Computational Geometry","location":"Virtual","start_date":"2021-06-07"},"acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","file_date_updated":"2021-06-02T10:22:33Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-184-9"]},"related_material":{"record":[{"status":"public","id":"12960","relation":"later_version"}]},"day":"02","date_updated":"2026-07-07T13:43:40Z","title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","author":[{"first_name":"Jean-Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.4230/LIPIcs.SoCG.2021.17","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In <i>37th International Symposium on Computational Geometry</i>, 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>.","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in <i>37th International Symposium on Computational Geometry</i>, Virtual, 2021, vol. 189, p. 17:1-17:16.","mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium on Computational Geometry</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>.","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In <i>37th International Symposium on Computational Geometry</i> (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th International Symposium on Computational Geometry</i>. Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>"},"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":189,"scopus_import":"1","department":[{"_id":"HeEd"}],"quality_controlled":"1","oa_version":"Published Version","_id":"9441","oa":1,"type":"conference","ec_funded":1,"page":"17:1-17:16","date_published":"2021-06-02T00:00:00Z","place":"Dagstuhl, Germany","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"file_id":"9442","date_updated":"2021-06-02T10:22:33Z","creator":"mwintrae","file_name":"LIPIcs-SoCG-2021-17.pdf","checksum":"c322aa48d5d35a35877896cc565705b6","relation":"main_file","date_created":"2021-06-02T10:22:33Z","content_type":"application/pdf","access_level":"open_access","file_size":1972902}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","article_processing_charge":"No","year":"2021","publication_status":"published","intvolume":"       189","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"has_accepted_license":"1","date_created":"2021-06-02T10:10:55Z","abstract":[{"lang":"eng","text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. "}],"month":"06","ddc":["005","516","514"],"publication":"37th International Symposium on Computational Geometry","status":"public","das_tickbox":"1"},{"date_updated":"2026-07-07T13:43:27Z","title":"The density fingerprint of a periodic point set","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-1780-2689","last_name":"Heiss","first_name":"Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","full_name":"Heiss, Teresa"},{"full_name":" Kurlin , Vitaliy","last_name":" Kurlin ","first_name":"Vitaliy"},{"full_name":"Smith, Philip","first_name":"Philip","last_name":"Smith"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","first_name":"Mathijs"}],"conference":{"end_date":"2021-06-11","name":"SoCG: Symposium on Computational Geometry","location":"Virtual","start_date":"2021-06-07"},"publication_identifier":{"issn":["1868-8969"]},"related_material":{"record":[{"relation":"dissertation_contains","id":"18667","status":"public"}]},"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.","file_date_updated":"2021-04-22T08:08:14Z","day":"02","oa_version":"Published Version","quality_controlled":"1","_id":"9345","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ieee":"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.","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>","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>.","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."},"doi":"10.4230/LIPIcs.SoCG.2021.32","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"name":"Persistent Homology, Algorithms and Stochastic Geometry","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"},{"name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"volume":189,"department":[{"_id":"HeEd"}],"scopus_import":"1","date_published":"2021-06-02T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2021-04-22T08:08:14Z","file_id":"9346","success":1,"access_level":"open_access","content_type":"application/pdf","file_size":3117435,"checksum":"1787baef1523d6d93753b90d0c109a6d","file_name":"df_socg_final_version.pdf","creator":"mwintrae","date_created":"2021-04-22T08:08:14Z","relation":"main_file"}],"article_processing_charge":"No","year":"2021","publication_status":"published","oa":1,"ec_funded":1,"type":"conference","page":"32:1-32:16","ddc":["004","516"],"status":"public","month":"06","publication":"37th International Symposium on Computational Geometry","das_tickbox":"1","intvolume":"       189","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"date_created":"2021-04-22T08:09:58Z","has_accepted_license":"1","abstract":[{"lang":"eng","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."}]},{"publication_status":"published","article_processing_charge":"No","year":"2021","place":"Cham","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-08-11T00:00:00Z","page":"486-515","isi":1,"type":"conference","ec_funded":1,"oa":1,"cryptoeprintid":1,"month":"08","publication":"41st Annual International Cryptology Conference","status":"public","abstract":[{"lang":"eng","text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth   δ , the loss in security is at most exponential in   δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth  δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in   δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security."}],"date_created":"2021-09-23T14:06:15Z","alternative_title":["LCNS"],"publisher":"Springer Nature","language":[{"iso":"eng"}],"intvolume":"     12826","author":[{"first_name":"Chethan","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"title":"Limits on the Adaptive Security of Yao’s Garbling","date_updated":"2026-07-07T13:57:01Z","day":"11","acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","related_material":{"record":[{"status":"public","id":"10035","relation":"dissertation_contains"}]},"publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-84245-1"],"isbn":["978-3-030-84244-4"],"eissn":["1611-3349"]},"conference":{"start_date":"2021-08-16","name":"CRYPTO: Annual International Cryptology Conference","location":"Virtual","end_date":"2021-08-20"},"external_id":{"cryptoeprintid":["2021/945"],"isi":["000696697800017"]},"_id":"10041","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2021/945","open_access":"1"}],"scopus_import":"1","department":[{"_id":"KrPi"}],"volume":12826,"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"doi":"10.1007/978-3-030-84245-1_17","citation":{"short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Springer Nature, Cham, 2021, pp. 486–515.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual International Cryptology Conference</i>, 12826:486–515. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology Conference</i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference. CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference</i>. Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” <i>41st Annual International Cryptology Conference</i>, vol. 12826, Springer Nature, 2021, pp. 486–515, doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology Conference</i>, Virtual, 2021, vol. 12826, pp. 486–515."}},{"type":"dissertation","ec_funded":1,"oa":1,"page":"276","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2021-09-23T00:00:00Z","article_processing_charge":"No","year":"2021","publication_status":"published","file":[{"date_updated":"2021-10-04T12:22:33Z","success":1,"file_id":"10082","content_type":"application/pdf","access_level":"open_access","file_size":2104726,"file_name":"thesis_pdfa.pdf","checksum":"73a44345c683e81f3e765efbf86fdcc5","creator":"cchlebak","relation":"main_file","date_created":"2021-10-04T12:22:33Z"},{"date_created":"2021-10-05T07:04:37Z","relation":"source_file","file_name":"thesis_final (1).zip","creator":"cchlebak","checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","file_size":9538359,"access_level":"closed","content_type":"application/x-zip-compressed","file_id":"10085","date_updated":"2022-03-10T12:15:18Z"}],"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"alternative_title":["ISTA Thesis"],"has_accepted_license":"1","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])."}],"date_created":"2021-09-23T07:31:44Z","publisher":"Institute of Science and Technology Austria","ddc":["519"],"month":"09","corr_author":"1","status":"public","degree_awarded":"PhD","OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"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","related_material":{"record":[{"id":"10049","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"637"},{"id":"6430","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10044"},{"status":"public","relation":"part_of_dissertation","id":"10048"},{"id":"10041","relation":"part_of_dissertation","status":"public"}]},"file_date_updated":"2022-03-10T12:15:18Z","day":"23","date_updated":"2026-07-07T13:57:00Z","title":"On the adaptive security of graph-based games","author":[{"last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.15479/at:ista:10035","citation":{"short":"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>.","ista":"Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.","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>","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>.","ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021."},"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"_id":"10035","oa_version":"Published Version"},{"page":"16437-16450","type":"conference","oa":1,"publication_status":"published","year":"2021","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-01T00:00:00Z","date_created":"2022-06-19T22:01:59Z","abstract":[{"lang":"eng","text":"Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties,\r\ne.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism."}],"alternative_title":["Advances in Neural Information Processing Systems"],"publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"intvolume":"        20","das_tickbox":"1","corr_author":"1","publication":"35th Conference on Neural Information Processing Systems","status":"public","ddc":["000","570"],"month":"12","day":"01","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"acknowledgement":"We would like to thank Professor Dr. Henning Sprekeler for his valuable suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive feedback on the manuscript. Lukas Braun was supported by the Network of European Neuroscience Schools through their NENS Exchange Grant program, by the European Union through their European Community Action Scheme for the Mobility of University Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust Senior Research Fellowship [214316/Z/18/Z].","conference":{"start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual, Online","end_date":"2021-12-14"},"author":[{"last_name":"Braun","first_name":"Lukas","full_name":"Braun, Lukas"},{"orcid":"0000-0003-3295-6181","last_name":"Vogels","first_name":"Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P"}],"title":"Online learning of neural computations from sparse temporal feedback","date_updated":"2026-07-08T05:45:00Z","department":[{"_id":"TiVo"}],"scopus_import":"1","volume":20,"project":[{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"}],"citation":{"short":"L. Braun, T.P. Vogels, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450.","chicago":"Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” In <i>35th Conference on Neural Information Processing Systems</i>, 20:16437–50. Neural Information Processing Systems Foundation, 2021.","ista":"Braun L, Vogels TP. 2021. Online learning of neural computations from sparse temporal feedback. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 20, 16437–16450.","ama":"Braun L, Vogels TP. Online learning of neural computations from sparse temporal feedback. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450.","apa":"Braun, L., &#38; Vogels, T. P. (2021). Online learning of neural computations from sparse temporal feedback. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing Systems Foundation.","ieee":"L. Braun and T. P. Vogels, “Online learning of neural computations from sparse temporal feedback,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 20, pp. 16437–16450.","mla":"Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 20, Neural Information Processing Systems Foundation, 2021, pp. 16437–50."},"_id":"11453","quality_controlled":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf"}]},{"publication_status":"published","article_processing_charge":"No","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-01T00:00:00Z","page":"2823-2834","type":"conference","ec_funded":1,"oa":1,"das_tickbox":"1","corr_author":"1","status":"public","publication":"35th Conference on Neural Information Processing Systems","ddc":["000"],"month":"12","abstract":[{"text":"We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case.","lang":"eng"}],"date_created":"2022-06-19T22:01:58Z","alternative_title":["Advances in Neural Information Processing Systems"],"publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"intvolume":"         4","author":[{"full_name":"Alimisis, Foivos","first_name":"Foivos","last_name":"Alimisis"},{"first_name":"Peter","last_name":"Davies","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425"},{"first_name":"Bart","last_name":"Vandereycken","full_name":"Vandereycken, Bart"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"}],"title":"Distributed principal component analysis with limited communication","date_updated":"2026-07-08T05:44:33Z","day":"01","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"acknowledgement":"We would like to thank the anonymous reviewers for helpful comments and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful discussions at an early stage of this work. FA is partially supported by the SNSF under research project No. 192363 and conducted part of this work while at IST Austria under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","arxiv":1,"conference":{"location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","end_date":"2021-12-14"},"external_id":{"arxiv":["2110.14391"]},"_id":"11452","quality_controlled":"1","oa_version":"Published Version","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf","open_access":"1"}],"department":[{"_id":"DaAl"}],"scopus_import":"1","volume":4,"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834.","chicago":"Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In <i>35th Conference on Neural Information Processing Systems</i>, 4:2823–34. Neural Information Processing Systems Foundation, 2021.","ista":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 4, 2823–2834.","apa":"Alimisis, F., Davies, P., Vandereycken, B., &#38; Alistarh, D.-A. (2021). Distributed principal component analysis with limited communication. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 4, pp. 2823–2834). Virtual, Online: Neural Information Processing Systems Foundation.","ama":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.","ieee":"F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed principal component analysis with limited communication,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 4, pp. 2823–2834.","mla":"Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34."}},{"external_id":{"arxiv":["1906.06783"]},"OA_place":"repository","arxiv":1,"day":"01","article_type":"original","publication_identifier":{"issn":["0095-8956"]},"title":"Hedetniemi's conjecture is asymptotically false","date_updated":"2026-07-08T07:43:57Z","author":[{"first_name":"Xiaoyu","last_name":"He","full_name":"He, Xiaoyu"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval","first_name":"Yuval","last_name":"Wigderson"}],"citation":{"ieee":"X. He and Y. Wigderson, “Hedetniemi’s conjecture is asymptotically false,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 146. Elsevier, pp. 485–494, 2021.","mla":"He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically False.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 146, Elsevier, 2021, pp. 485–94, doi:<a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">10.1016/j.jctb.2020.03.003</a>.","ista":"He X, Wigderson Y. 2021. Hedetniemi’s conjecture is asymptotically false. Journal of Combinatorial Theory, Series B. 146, 485–494.","ama":"He X, Wigderson Y. Hedetniemi’s conjecture is asymptotically false. <i>Journal of Combinatorial Theory, Series B</i>. 2021;146:485-494. doi:<a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">10.1016/j.jctb.2020.03.003</a>","apa":"He, X., &#38; Wigderson, Y. (2021). Hedetniemi’s conjecture is asymptotically false. <i>Journal of Combinatorial Theory, Series B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">https://doi.org/10.1016/j.jctb.2020.03.003</a>","chicago":"He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically False.” <i>Journal of Combinatorial Theory, Series B</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">https://doi.org/10.1016/j.jctb.2020.03.003</a>.","short":"X. He, Y. Wigderson, Journal of Combinatorial Theory, Series B 146 (2021) 485–494."},"doi":"10.1016/j.jctb.2020.03.003","volume":146,"scopus_import":"1","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.06783"}],"extern":"1","_id":"22156","oa":1,"type":"journal_article","page":"485-494","date_published":"2021-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2021","article_processing_charge":"No","keyword":["Graph coloring","Hedetniemi's conjecture"],"intvolume":"       146","OA_type":"green","language":[{"iso":"eng"}],"publisher":"Elsevier","date_created":"2026-06-29T10:50:09Z","abstract":[{"text":"Extending a recent breakthrough of Shitov, we prove that the chromatic number of the tensor product of two graphs can be a constant factor smaller than the minimum chromatic number of the two graphs. More precisely, we prove that there exists an absolute constant δ>0 such that for all c sufficiently large, there exist graphs G and H with chromatic number at least (1+δ)c for which χ(G×H)≤c.","lang":"eng"}],"month":"01","status":"public","publication":"Journal of Combinatorial Theory, Series B"},{"doi":"10.1063/5.0050235","citation":{"short":"S.S. Szigeti, O. Hosten, S.A. Haine, Applied Physics Letters 118 (2021).","chicago":"Szigeti, Stuart S., Onur Hosten, and Simon A. Haine. “Improving Cold-Atom Sensors with Quantum Entanglement: Prospects and Challenges.” <i>Applied Physics Letters</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0050235\">https://doi.org/10.1063/5.0050235</a>.","ama":"Szigeti SS, Hosten O, Haine SA. Improving cold-atom sensors with quantum entanglement: Prospects and challenges. <i>Applied Physics Letters</i>. 2021;118(14). doi:<a href=\"https://doi.org/10.1063/5.0050235\">10.1063/5.0050235</a>","ista":"Szigeti SS, Hosten O, Haine SA. 2021. Improving cold-atom sensors with quantum entanglement: Prospects and challenges. Applied Physics Letters. 118(14), 140501.","apa":"Szigeti, S. S., Hosten, O., &#38; Haine, S. A. (2021). Improving cold-atom sensors with quantum entanglement: Prospects and challenges. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0050235\">https://doi.org/10.1063/5.0050235</a>","mla":"Szigeti, Stuart S., et al. “Improving Cold-Atom Sensors with Quantum Entanglement: Prospects and Challenges.” <i>Applied Physics Letters</i>, vol. 118, no. 14, 140501, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0050235\">10.1063/5.0050235</a>.","ieee":"S. S. Szigeti, O. Hosten, and S. A. Haine, “Improving cold-atom sensors with quantum entanglement: Prospects and challenges,” <i>Applied Physics Letters</i>, vol. 118, no. 14. AIP Publishing, 2021."},"department":[{"_id":"OnHo"}],"scopus_import":"1","volume":118,"_id":"9331","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.09168"}],"external_id":{"arxiv":["2010.09168"],"isi":["000637702100001"]},"day":"07","article_type":"original","acknowledgement":"We acknowledge fruitful discussions with John Close, Chris Freier, Kyle Hardman, Joseph Hope, and Paul Wigley, and insightful suggestions made by Franck Pereira dos Santos on behalf of the Atom Interferometry and Inertial Sensors team at SYRTE. S.S.S. was supported by an Australian Research Council Discovery Early Career Researcher Award (DECRA), Project No. DE200100495. O.H. was supported by IST Austria.","publication_identifier":{"issn":["0003-6951"]},"arxiv":1,"title":"Improving cold-atom sensors with quantum entanglement: Prospects and challenges","researchdata_availability":"upon request","date_updated":"2026-07-08T08:53:45Z","author":[{"last_name":"Szigeti","first_name":"Stuart S.","full_name":"Szigeti, Stuart S."},{"last_name":"Hosten","orcid":"0000-0002-2031-204X","first_name":"Onur","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Haine, Simon A.","first_name":"Simon A.","last_name":"Haine"}],"dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","language":[{"iso":"eng"}],"intvolume":"       118","date_created":"2021-04-18T22:01:40Z","abstract":[{"text":"Quantum entanglement has been generated and verified in cold-atom experiments and used to make atom-interferometric measurements below the shot-noise limit. However, current state-of-the-art cold-atom devices exploit separable (i.e., unentangled) atomic states. This perspective piece asks the question: can entanglement usefully improve cold-atom sensors, in the sense that it gives new sensing capabilities unachievable with current state-of-the-art devices? We briefly review the state-of-the-art in precision cold-atom sensing, focusing on clocks and inertial sensors, identifying the potential benefits entanglement could bring to these devices, and the challenges that need to be overcome to realize these benefits. We survey demonstrated methods of generating metrologically useful entanglement in cold-atom systems, note their relative strengths and weaknesses, and assess their prospects for near-to-medium term quantum-enhanced cold-atom sensing.","lang":"eng"}],"publisher":"AIP Publishing","supplementarymaterial":"no","das_tickbox":"1","status":"public","month":"04","publication":"Applied Physics Letters","corr_author":"1","issue":"14","type":"journal_article","isi":1,"oa":1,"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_number":"140501","date_published":"2021-04-07T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2021"},{"page":"1-15","type":"journal_article","oa":1,"publication_status":"published","year":"2021","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-01-01T00:00:00Z","date_created":"2026-06-29T10:52:13Z","abstract":[{"text":"Recently, Souza introduced blowup Ramsey numbers as a gener-\r\nalization of bipartite Ramsey numbers. For graphs G and H, say\r\nG r\r\n−→ H if every r-edge-coloring of G contains a monochromatic\r\ncopy of H. Let H[t] denote the t-blowup of H. Then the blowup\r\nRamsey number of G, H, r, and t is defined as the minimum n\r\nsuch that G[n] r\r\n−→ H[t]. Souza proved upper and lower bounds on\r\nn that are exponential in t, and conjectured that the exponential\r\nconstant does not depend on G. We prove that the dependence on\r\nG in the exponential constant is indeed unnecessary, but conjecture\r\nthat some dependence on G is unavoidable.\r\nAn important step in both Souza’s proof and ours is a theorem of\r\nNikiforov, which says that if a graph contains a constant fraction\r\nof the possible copies of H, then it contains a blowup of H of\r\nlogarithmic size. We also provide a new proof of this theorem with\r\na better quantitative dependence.","lang":"eng"}],"publisher":"International Press of Boston","OA_type":"green","language":[{"iso":"eng"}],"intvolume":"        12","issue":"1","mathsc":["05C35","05C55"],"month":"01","status":"public","publication":"Journal of Combinatorics","day":"01","article_type":"original","publication_identifier":{"eissn":["2150-959X"],"issn":["2156-3527"]},"arxiv":1,"OA_place":"repository","external_id":{"arxiv":["1912.08328"]},"author":[{"full_name":"Fox, Jacob","first_name":"Jacob","last_name":"Fox"},{"full_name":"Luo, Sammy","last_name":"Luo","first_name":"Sammy"},{"last_name":"Wigderson","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"}],"title":"Extremal and Ramsey results on graph blowups","date_updated":"2026-07-08T10:41:31Z","scopus_import":"1","volume":12,"citation":{"mla":"Fox, Jacob, et al. “Extremal and Ramsey Results on Graph Blowups.” <i>Journal of Combinatorics</i>, vol. 12, no. 1, International Press of Boston, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.4310/joc.2021.v12.n1.a1\">10.4310/joc.2021.v12.n1.a1</a>.","ieee":"J. Fox, S. Luo, and Y. Wigderson, “Extremal and Ramsey results on graph blowups,” <i>Journal of Combinatorics</i>, vol. 12, no. 1. International Press of Boston, pp. 1–15, 2021.","ista":"Fox J, Luo S, Wigderson Y. 2021. Extremal and Ramsey results on graph blowups. Journal of Combinatorics. 12(1), 1–15.","apa":"Fox, J., Luo, S., &#38; Wigderson, Y. (2021). Extremal and Ramsey results on graph blowups. <i>Journal of Combinatorics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/joc.2021.v12.n1.a1\">https://doi.org/10.4310/joc.2021.v12.n1.a1</a>","ama":"Fox J, Luo S, Wigderson Y. Extremal and Ramsey results on graph blowups. <i>Journal of Combinatorics</i>. 2021;12(1):1-15. doi:<a href=\"https://doi.org/10.4310/joc.2021.v12.n1.a1\">10.4310/joc.2021.v12.n1.a1</a>","chicago":"Fox, Jacob, Sammy Luo, and Yuval Wigderson. “Extremal and Ramsey Results on Graph Blowups.” <i>Journal of Combinatorics</i>. International Press of Boston, 2021. <a href=\"https://doi.org/10.4310/joc.2021.v12.n1.a1\">https://doi.org/10.4310/joc.2021.v12.n1.a1</a>.","short":"J. Fox, S. Luo, Y. Wigderson, Journal of Combinatorics 12 (2021) 1–15."},"doi":"10.4310/joc.2021.v12.n1.a1","_id":"22161","extern":"1","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1912.08328","open_access":"1"}]},{"intvolume":"        17","language":[{"iso":"eng"}],"publisher":"Public Library of Science","abstract":[{"lang":"eng","text":"<jats:p>Extracellular recording is an accessible technique used in animals and humans to study the brain physiology and pathology. As the number of recording channels and their density grows it is natural to ask how much improvement the additional channels bring in and how we can optimally use the new capabilities for monitoring the brain. Here we show that for any given distribution of electrodes we can establish exactly what information about current sources in the brain can be recovered and what information is strictly unobservable. We demonstrate this in the general setting of previously proposed kernel Current Source Density method and illustrate it with simplified examples as well as using evoked potentials from the barrel cortex obtained with a Neuropixels probe and with compatible model data. We show that with conceptual separation of the estimation space from experimental setup one can recover sources not accessible to standard methods.</jats:p>"}],"has_accepted_license":"1","date_created":"2024-06-11T14:43:37Z","month":"05","publication":"PLOS Computational Biology","status":"public","das_tickbox":"1","issue":"5","oa":1,"type":"journal_article","date_published":"2021-05-14T00:00:00Z","article_number":"e1008615","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","year":"2021","publication_status":"published","doi":"10.1371/journal.pcbi.1008615","citation":{"short":"C. Chintaluri, M. Bejtka, W. Średniawa, M. Czerwiński, J.M. Dzik, J. Jędrzejewska-Szmek, K. Kondrakiewicz, E. Kublik, D.K. Wójcik, PLOS Computational Biology 17 (2021).","chicago":"Chintaluri, Chaitanya, Marta Bejtka, Władysław Średniawa, Michał Czerwiński, Jakub M. Dzik, Joanna Jędrzejewska-Szmek, Kacper Kondrakiewicz, Ewa Kublik, and Daniel K. Wójcik. “What We Can and What We Cannot See with Extracellular Multielectrodes.” <i>PLOS Computational Biology</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pcbi.1008615\">https://doi.org/10.1371/journal.pcbi.1008615</a>.","apa":"Chintaluri, C., Bejtka, M., Średniawa, W., Czerwiński, M., Dzik, J. M., Jędrzejewska-Szmek, J., … Wójcik, D. K. (2021). What we can and what we cannot see with extracellular multielectrodes. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1008615\">https://doi.org/10.1371/journal.pcbi.1008615</a>","ama":"Chintaluri C, Bejtka M, Średniawa W, et al. What we can and what we cannot see with extracellular multielectrodes. <i>PLOS Computational Biology</i>. 2021;17(5). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008615\">10.1371/journal.pcbi.1008615</a>","ista":"Chintaluri C, Bejtka M, Średniawa W, Czerwiński M, Dzik JM, Jędrzejewska-Szmek J, Kondrakiewicz K, Kublik E, Wójcik DK. 2021. What we can and what we cannot see with extracellular multielectrodes. PLOS Computational Biology. 17(5), e1008615.","ieee":"C. Chintaluri <i>et al.</i>, “What we can and what we cannot see with extracellular multielectrodes,” <i>PLOS Computational Biology</i>, vol. 17, no. 5. Public Library of Science, 2021.","mla":"Chintaluri, Chaitanya, et al. “What We Can and What We Cannot See with Extracellular Multielectrodes.” <i>PLOS Computational Biology</i>, vol. 17, no. 5, e1008615, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1008615\">10.1371/journal.pcbi.1008615</a>."},"volume":17,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pcbi.1008615"}],"oa_version":"Published Version","quality_controlled":"1","_id":"17132","extern":"1","publication_identifier":{"issn":["1553-7358"]},"article_type":"original","day":"14","date_updated":"2026-07-13T12:31:04Z","title":"What we can and what we cannot see with extracellular multielectrodes","author":[{"id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","full_name":"Chintaluri, Chaitanya","first_name":"Chaitanya","orcid":"0000-0003-4252-1608","last_name":"Chintaluri"},{"full_name":"Bejtka, Marta","last_name":"Bejtka","first_name":"Marta"},{"full_name":"Średniawa, Władysław","last_name":"Średniawa","first_name":"Władysław"},{"first_name":"Michał","last_name":"Czerwiński","full_name":"Czerwiński, Michał"},{"full_name":"Dzik, Jakub M.","last_name":"Dzik","first_name":"Jakub M."},{"full_name":"Jędrzejewska-Szmek, Joanna","first_name":"Joanna","last_name":"Jędrzejewska-Szmek"},{"last_name":"Kondrakiewicz","first_name":"Kacper","full_name":"Kondrakiewicz, Kacper"},{"full_name":"Kublik, Ewa","last_name":"Kublik","first_name":"Ewa"},{"full_name":"Wójcik, Daniel K.","last_name":"Wójcik","first_name":"Daniel K."}]},{"citation":{"apa":"Wigderson, Y. (2021). An improved lower bound on multicolor Ramsey numbers. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/15447\">https://doi.org/10.1090/proc/15447</a>","ama":"Wigderson Y. An improved lower bound on multicolor Ramsey numbers. <i>Proceedings of the American Mathematical Society</i>. 2021;149(6):2371-2374. doi:<a href=\"https://doi.org/10.1090/proc/15447\">10.1090/proc/15447</a>","ista":"Wigderson Y. 2021. An improved lower bound on multicolor Ramsey numbers. Proceedings of the American Mathematical Society. 149(6), 2371–2374.","ieee":"Y. Wigderson, “An improved lower bound on multicolor Ramsey numbers,” <i>Proceedings of the American Mathematical Society</i>, vol. 149, no. 6. American Mathematical Society, pp. 2371–2374, 2021.","mla":"Wigderson, Yuval. “An Improved Lower Bound on Multicolor Ramsey Numbers.” <i>Proceedings of the American Mathematical Society</i>, vol. 149, no. 6, American Mathematical Society, 2021, pp. 2371–74, doi:<a href=\"https://doi.org/10.1090/proc/15447\">10.1090/proc/15447</a>.","short":"Y. Wigderson, Proceedings of the American Mathematical Society 149 (2021) 2371–2374.","chicago":"Wigderson, Yuval. “An Improved Lower Bound on Multicolor Ramsey Numbers.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2021. <a href=\"https://doi.org/10.1090/proc/15447\">https://doi.org/10.1090/proc/15447</a>."},"doi":"10.1090/proc/15447","volume":149,"scopus_import":"1","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2009.12020","open_access":"1"}],"_id":"22169","extern":"1","external_id":{"unknown":["2009.12020"]},"OA_place":"repository","day":"01","article_type":"original","publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"title":"An improved lower bound on multicolor Ramsey numbers","date_updated":"2026-07-14T08:42:59Z","author":[{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval","first_name":"Yuval","last_name":"Wigderson"}],"intvolume":"       149","language":[{"iso":"eng"}],"OA_type":"green","publisher":"American Mathematical Society","abstract":[{"lang":"eng","text":"A recent breakthrough of Conlon and Ferber yielded an exponential improvement on the lower bounds for multicolor diagonal Ramsey numbers. In this note, we modify their construction and obtain improved bounds for more than three colors."}],"date_created":"2026-06-29T10:55:23Z","month":"06","publication":"Proceedings of the American Mathematical Society","status":"public","issue":"6","oa":1,"type":"journal_article","page":"2371-2374","date_published":"2021-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","article_processing_charge":"No","year":"2021"},{"publisher":"American Mathematical Society","abstract":[{"lang":"eng","text":"We show how a number of well-known uncertainty principles for the Fourier transform, such as the Heisenberg uncertainty principle, the Donoho–Stark uncertainty principle, and Meshulam’s nonabelian uncertainty principle, have little to do with the structure of the Fourier transform itself. Rather, all of these results follow from very weak properties of the Fourier transform (shared by numerous linear operators), namely that it is bounded as an operator  L1 → L∞, and that it is unitary. Using a single, simple proof template, and only these (or weaker) properties, we obtain some new proofs and many generalizations of these basic uncertainty principles, to new operators and to new settings, in a completely unified way. Together with our general overview, this paper can also serve as a survey of the many facets of the phenomena known as uncertainty principles."}],"date_created":"2026-06-29T10:57:49Z","intvolume":"        58","language":[{"iso":"eng"}],"OA_type":"green","issue":"2","status":"public","month":"01","publication":"Bulletin of the American Mathematical Society","mathsc":["81S07","43A25","20C15","94A12"],"page":"225-261","oa":1,"type":"journal_article","publication_status":"published","article_processing_charge":"No","year":"2021","date_published":"2021-01-04T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":58,"scopus_import":"1","citation":{"ieee":"A. Wigderson and Y. Wigderson, “The uncertainty principle: Variations on a theme,” <i>Bulletin of the American Mathematical Society</i>, vol. 58, no. 2. American Mathematical Society, pp. 225–261, 2021.","mla":"Wigderson, Avi, and Yuval Wigderson. “The Uncertainty Principle: Variations on a Theme.” <i>Bulletin of the American Mathematical Society</i>, vol. 58, no. 2, American Mathematical Society, 2021, pp. 225–61, doi:<a href=\"https://doi.org/10.1090/bull/1715\">10.1090/bull/1715</a>.","ista":"Wigderson A, Wigderson Y. 2021. The uncertainty principle: Variations on a theme. Bulletin of the American Mathematical Society. 58(2), 225–261.","ama":"Wigderson A, Wigderson Y. The uncertainty principle: Variations on a theme. <i>Bulletin of the American Mathematical Society</i>. 2021;58(2):225-261. doi:<a href=\"https://doi.org/10.1090/bull/1715\">10.1090/bull/1715</a>","apa":"Wigderson, A., &#38; Wigderson, Y. (2021). The uncertainty principle: Variations on a theme. <i>Bulletin of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/bull/1715\">https://doi.org/10.1090/bull/1715</a>","chicago":"Wigderson, Avi, and Yuval Wigderson. “The Uncertainty Principle: Variations on a Theme.” <i>Bulletin of the American Mathematical Society</i>. American Mathematical Society, 2021. <a href=\"https://doi.org/10.1090/bull/1715\">https://doi.org/10.1090/bull/1715</a>.","short":"A. Wigderson, Y. Wigderson, Bulletin of the American Mathematical Society 58 (2021) 225–261."},"doi":"10.1090/bull/1715","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2006.11206","open_access":"1"}],"extern":"1","_id":"22175","arxiv":1,"day":"04","publication_identifier":{"eissn":["1088-9485"],"issn":["0273-0979"]},"article_type":"original","external_id":{"arxiv":["2006.11206"]},"OA_place":"repository","author":[{"full_name":"Wigderson, Avi","last_name":"Wigderson","first_name":"Avi"},{"first_name":"Yuval","last_name":"Wigderson","full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"title":"The uncertainty principle: Variations on a theme","date_updated":"2026-07-14T09:02:39Z"},{"issue":"1","publication":"JACS Au","ddc":["540"],"status":"public","month":"12","publisher":"American Chemical Society","date_created":"2026-06-30T06:30:18Z","pmid":1,"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Phase separation is a ubiquitous process and finds applications in a variety of biological, organic, and inorganic systems. Nature has evolved the ability to control phase separation to both regulate cellular processes and make composite materials with outstanding mechanical and optical properties. Striking examples of the latter are the vibrant blue and green feathers of many bird species, which are thought to result from an exquisite control of the size and spatial correlations of their phase-separated microstructures. By contrast, it is much harder for material scientists to arrest and control phase separation in synthetic materials with such a high level of precision at these length scales. In this Perspective, we briefly review some established methods to control liquid–liquid phase separation processes and then highlight the emergence of a promising arrest method based on phase separation in an elastic polymer network. Finally, we discuss upcoming challenges and opportunities for fabricating microstructured materials via mechanically controlled phase separation."}],"intvolume":"         2","language":[{"iso":"eng"}],"OA_type":"gold","publication_status":"published","article_processing_charge":"No","year":"2021","keyword":["phase separation","arrest","bird feathers","elasticity","polymer networks","microstructured materials"],"date_published":"2021-12-10T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"66-73","oa":1,"type":"journal_article","oa_version":"Published Version","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1021/jacsau.1c00443","open_access":"1"}],"_id":"22207","extern":"1","volume":2,"scopus_import":"1","citation":{"chicago":"Fernández-Rico, Carla, Tianqi Sai, Alba Sicher, Robert W. Style, and Eric R. Dufresne. “Putting the Squeeze on Phase Separation.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00443\">https://doi.org/10.1021/jacsau.1c00443</a>.","short":"C. Fernández-Rico, T. Sai, A. Sicher, R.W. Style, E.R. Dufresne, JACS Au 2 (2021) 66–73.","ieee":"C. Fernández-Rico, T. Sai, A. Sicher, R. W. Style, and E. R. Dufresne, “Putting the squeeze on phase separation,” <i>JACS Au</i>, vol. 2, no. 1. American Chemical Society, pp. 66–73, 2021.","mla":"Fernández-Rico, Carla, et al. “Putting the Squeeze on Phase Separation.” <i>JACS Au</i>, vol. 2, no. 1, American Chemical Society, 2021, pp. 66–73, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00443\">10.1021/jacsau.1c00443</a>.","ista":"Fernández-Rico C, Sai T, Sicher A, Style RW, Dufresne ER. 2021. Putting the squeeze on phase separation. JACS Au. 2(1), 66–73.","apa":"Fernández-Rico, C., Sai, T., Sicher, A., Style, R. W., &#38; Dufresne, E. R. (2021). Putting the squeeze on phase separation. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00443\">https://doi.org/10.1021/jacsau.1c00443</a>","ama":"Fernández-Rico C, Sai T, Sicher A, Style RW, Dufresne ER. Putting the squeeze on phase separation. <i>JACS Au</i>. 2021;2(1):66-73. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00443\">10.1021/jacsau.1c00443</a>"},"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"doi":"10.1021/jacsau.1c00443","author":[{"full_name":"Fernández-Rico, Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","last_name":"Fernández-Rico","first_name":"Carla"},{"last_name":"Sai","first_name":"Tianqi","full_name":"Sai, Tianqi"},{"last_name":"Sicher","first_name":"Alba","full_name":"Sicher, Alba"},{"last_name":"Style","first_name":"Robert W.","full_name":"Style, Robert W."},{"full_name":"Dufresne, Eric R.","last_name":"Dufresne","first_name":"Eric R."}],"title":"Putting the squeeze on phase separation","date_updated":"2026-07-15T05:55:35Z","DOAJ_listed":"1","day":"10","publication_identifier":{"eissn":["2691-3704"]},"article_type":"original","external_id":{"pmid":["35098222"]},"OA_place":"publisher","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"}]