[{"project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2020-07-11","name":"ICALP: Automata, Languages and Programming","start_date":"2020-07-08","location":"Saarbrücken, Germany, Virtual"},"day":"29","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Giorgi","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze"},{"last_name":"Sabour","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","full_name":"Sabour, Amirmojtaba"}],"_id":"15077","external_id":{"arxiv":["2003.09297"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","doi":"10.4230/LIPIcs.ICALP.2020.7","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"article_processing_charge":"No","ddc":["000"],"ec_funded":1,"month":"06","has_accepted_license":"1","date_updated":"2025-07-10T11:55:11Z","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01","oa":1,"oa_version":"Published Version","file_date_updated":"2024-03-05T07:25:15Z","quality_controlled":"1","scopus_import":"1","related_material":{"record":[{"status":"public","id":"8286","relation":"later_version"}]},"date_created":"2024-03-05T07:25:37Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"status":"public","volume":168,"citation":{"ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 168, 7.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168.","apa":"Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","type":"conference","corr_author":"1","publication":"47th International Colloquium on Automata, Languages, and Programming","title":"Dynamic averaging load balancing on cycles","file":[{"date_updated":"2024-03-05T07:25:15Z","date_created":"2024-03-05T07:25:15Z","content_type":"application/pdf","file_size":782987,"relation":"main_file","checksum":"e5eb16199f4ccfd77a321977eb3f026f","file_name":"2020_LIPIcs_Alistarh.pdf","creator":"dernst","file_id":"15078","access_level":"open_access","success":1}],"language":[{"iso":"eng"}],"intvolume":" 168","alternative_title":["LIPIcs"],"date_published":"2020-06-29T00:00:00Z","article_number":"7","arxiv":1,"department":[{"_id":"DaAl"}],"license":"https://creativecommons.org/licenses/by/3.0/"},{"title":"Random matrices","publication":"Oberwolfach Reports","language":[{"iso":"eng"}],"year":"2020","type":"journal_article","issue":"4","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Large complex systems tend to develop universal patterns that often represent their essential characteristics. For example, the cumulative effects of independent or weakly dependent random variables often yield the Gaussian universality class via the central limit theorem. For non-commutative random variables, e.g. matrices, the Gaussian behavior is often replaced by another universality class, commonly called random matrix statistics. Nearby eigenvalues are strongly correlated, and, remarkably, their correlation structure is universal, depending only on the symmetry type of the matrix. Even more surprisingly, this feature is not restricted to matrices; in fact Eugene Wigner, the pioneer of the field, discovered in the 1950s that distributions of the gaps between energy levels of complicated quantum systems universally follow the same random matrix statistics. This claim has never been rigorously proved for any realistic physical system but experimental data and extensive numerics leave no doubt as to its correctness. Since then random matrices have proved to be extremely useful phenomenological models in a wide range of applications beyond quantum physics that include number theory, statistics, neuroscience, population dynamics, wireless communication and mathematical finance. The ubiquity of random matrices in natural sciences is still a mystery, but recent years have witnessed a breakthrough in the mathematical description of the statistical structure of their spectrum. Random matrices and closely related areas such as log-gases have become an extremely active research area in probability theory.\r\nThis workshop brought together outstanding researchers from a variety of mathematical backgrounds whose areas of research are linked to random matrices. While there are strong links between their motivations, the techniques used by these researchers span a large swath of mathematics, ranging from purely algebraic techniques to stochastic analysis, classical probability theory, operator algebra, supersymmetry, orthogonal polynomials, etc."}],"volume":16,"doi":"10.4171/owr/2019/56","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Erdös, László, Friedrich Götze, and Alice Guionnet. “Random Matrices.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/56.","ieee":"L. Erdös, F. Götze, and A. Guionnet, “Random matrices,” Oberwolfach Reports, vol. 16, no. 4. European Mathematical Society, pp. 3459–3527, 2020.","apa":"Erdös, L., Götze, F., & Guionnet, A. (2020). Random matrices. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/56","ama":"Erdös L, Götze F, Guionnet A. Random matrices. Oberwolfach Reports. 2020;16(4):3459-3527. doi:10.4171/owr/2019/56","mla":"Erdös, László, et al. “Random Matrices.” Oberwolfach Reports, vol. 16, no. 4, European Mathematical Society, 2020, pp. 3459–527, doi:10.4171/owr/2019/56.","ista":"Erdös L, Götze F, Guionnet A. 2020. Random matrices. Oberwolfach Reports. 16(4), 3459–3527.","short":"L. Erdös, F. Götze, A. Guionnet, Oberwolfach Reports 16 (2020) 3459–3527."},"day":"19","quality_controlled":"1","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"full_name":"Götze, Friedrich","first_name":"Friedrich","last_name":"Götze"},{"last_name":"Guionnet","full_name":"Guionnet, Alice","first_name":"Alice"}],"_id":"15079","publisher":"European Mathematical Society","date_created":"2024-03-05T07:54:44Z","publication_status":"published","oa_version":"None","publication_identifier":{"issn":["1660-8933"]},"article_type":"original","department":[{"_id":"LaEr"}],"date_published":"2020-11-19T00:00:00Z","page":"3459-3527","intvolume":" 16","month":"11","date_updated":"2024-03-12T12:25:18Z"},{"month":"04","date_updated":"2026-06-18T17:45:52Z","date_published":"2020-04-01T00:00:00Z","article_number":"56","acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. 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 734922.","main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"oa":1,"department":[{"_id":"KrCh"},{"_id":"UlWa"}],"oa_version":"Published Version","day":"01","conference":{"name":"EuroCG: European Workshop on Computational Geometry","location":"Würzburg, Germany, Virtual","start_date":"2020-03-16","end_date":"2020-03-18"},"quality_controlled":"1","_id":"15082","author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"full_name":"Obmann, Julia","first_name":"Julia","last_name":"Obmann"},{"last_name":"Patak","id":"B593B804-1035-11EA-B4F1-947645A5BB83","first_name":"Pavel","full_name":"Patak, Pavel"},{"full_name":"Perz, Daniel","first_name":"Daniel","last_name":"Perz"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef"}],"publication_status":"published","date_created":"2024-03-05T08:57:17Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"status":"public","citation":{"ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"type":"conference","year":"2020","title":"Disjoint tree-compatible plane perfect matchings","corr_author":"1","publication":"36th European Workshop on Computational Geometry","language":[{"iso":"eng"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2010.12460","open_access":"1"}],"acknowledgement":"The authors would like to thank Blair Bilodeau, David Fleet, Mufan Li, and Jeffrey Negrea for\r\nhelpful discussions. FF was supported by OGS Scholarship. DA and IM were supported the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (grant agreement No 805223 ScaleML). DMR was supported by an NSERC Discovery\r\nGrant. ARK was supported by NSERC Postdoctoral Fellowship. Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR, and companies sponsoring the Vector Institute.","date_updated":"2025-04-14T07:49:16Z","month":"12","oa_version":"Preprint","oa":1,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Many communication-efficient variants of SGD use gradient quantization schemes. These schemes are often heuristic and fixed over the course of training. We empirically observe that the statistics of gradients of deep models change during the training. Motivated by this observation, we introduce two adaptive quantization schemes, ALQ and AMQ. In both schemes, processors update their compression schemes in parallel by efficiently computing sufficient statistics of a parametric distribution. We improve the validation accuracy by almost 2% on CIFAR-10 and 1% on ImageNet in challenging low-cost communication setups. Our adaptive methods are also significantly more robust to the choice of hyperparameters.\r\n\r\n"}],"external_id":{"arxiv":["2010.12460"]},"_id":"15086","publisher":"Neural Information Processing Systems Foundation","publication_status":"published","author":[{"first_name":"Fartash ","full_name":"Faghri, Fartash ","last_name":"Faghri"},{"last_name":"Tabrizian","full_name":"Tabrizian, Iman ","first_name":"Iman "},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","full_name":"Markov, Ilia","first_name":"Ilia"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Roy, Daniel ","first_name":"Daniel ","last_name":"Roy"},{"first_name":"Ali ","full_name":"Ramezani-Kebrya, Ali ","last_name":"Ramezani-Kebrya"}],"conference":{"end_date":"2020-12-12","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2020-12-06"},"day":"10","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}],"ec_funded":1,"arxiv":1,"date_published":"2020-12-10T00:00:00Z","alternative_title":["NeurIPS"],"intvolume":" 33","publication_identifier":{"isbn":["9781713829546"]},"department":[{"_id":"DaAl"}],"citation":{"ama":"Faghri F, Tabrizian I, Markov I, Alistarh D-A, Roy D, Ramezani-Kebrya A. Adaptive gradient quantization for data-parallel SGD. In: Advances in Neural Information Processing Systems. Vol 33. Neural Information Processing Systems Foundation; 2020.","mla":"Faghri, Fartash, et al. “Adaptive Gradient Quantization for Data-Parallel SGD.” Advances in Neural Information Processing Systems, vol. 33, Neural Information Processing Systems Foundation, 2020.","short":"F. Faghri, I. Tabrizian, I. Markov, D.-A. Alistarh, D. Roy, A. Ramezani-Kebrya, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2020.","ista":"Faghri F, Tabrizian I, Markov I, Alistarh D-A, Roy D, Ramezani-Kebrya A. 2020. Adaptive gradient quantization for data-parallel SGD. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 33.","chicago":"Faghri, Fartash , Iman Tabrizian, Ilia Markov, Dan-Adrian Alistarh, Daniel Roy, and Ali Ramezani-Kebrya. “Adaptive Gradient Quantization for Data-Parallel SGD.” In Advances in Neural Information Processing Systems, Vol. 33. Neural Information Processing Systems Foundation, 2020.","ieee":"F. Faghri, I. Tabrizian, I. Markov, D.-A. Alistarh, D. Roy, and A. Ramezani-Kebrya, “Adaptive gradient quantization for data-parallel SGD,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33.","apa":"Faghri, F., Tabrizian, I., Markov, I., Alistarh, D.-A., Roy, D., & Ramezani-Kebrya, A. (2020). Adaptive gradient quantization for data-parallel SGD. In Advances in Neural Information Processing Systems (Vol. 33). Vancouver, Canada: Neural Information Processing Systems Foundation."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":33,"status":"public","date_created":"2024-03-06T08:35:58Z","quality_controlled":"1","language":[{"iso":"eng"}],"title":"Adaptive gradient quantization for data-parallel SGD","publication":"Advances in Neural Information Processing Systems","type":"conference","year":"2020"},{"keyword":["Instrumentation"],"oa_version":"None","department":[{"_id":"FlSc"},{"_id":"EM-Fac"}],"publication_identifier":{"issn":["1431-9276"],"eissn":["1435-8115"]},"article_type":"original","page":"2518-2519","date_published":"2020-08-01T00:00:00Z","date_updated":"2024-10-09T21:08:43Z","month":"08","intvolume":" 26","language":[{"iso":"eng"}],"corr_author":"1","publication":"Microscopy and Microanalysis","title":"Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration","type":"journal_article","year":"2020","issue":"S2","citation":{"short":"F. Fäßler, G.A. Dimchev, V.-V. Hodirnau, B. Zens, C. Möhl, F. Bradke, F.K. Schur, Microscopy and Microanalysis 26 (2020) 2518–2519.","ista":"Fäßler F, Dimchev GA, Hodirnau V-V, Zens B, Möhl C, Bradke F, Schur FK. 2020. Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration. Microscopy and Microanalysis. 26(S2), 2518–2519.","mla":"Fäßler, Florian, et al. “Cryo-Electron Tomography Workflows for Quantitative Analysis of Actin Networks Involved in Cell Migration.” Microscopy and Microanalysis, vol. 26, no. S2, Oxford University Press, 2020, pp. 2518–19, doi:10.1017/s1431927620021881.","ama":"Fäßler F, Dimchev GA, Hodirnau V-V, et al. Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration. Microscopy and Microanalysis. 2020;26(S2):2518-2519. doi:10.1017/s1431927620021881","apa":"Fäßler, F., Dimchev, G. A., Hodirnau, V.-V., Zens, B., Möhl, C., Bradke, F., & Schur, F. K. (2020). Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration. Microscopy and Microanalysis. Oxford University Press. https://doi.org/10.1017/s1431927620021881","ieee":"F. Fäßler et al., “Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration,” Microscopy and Microanalysis, vol. 26, no. S2. Oxford University Press, pp. 2518–2519, 2020.","chicago":"Fäßler, Florian, Georgi A Dimchev, Victor-Valentin Hodirnau, Bettina Zens, Christoph Möhl, Frank Bradke, and Florian KM Schur. “Cryo-Electron Tomography Workflows for Quantitative Analysis of Actin Networks Involved in Cell Migration.” Microscopy and Microanalysis. Oxford University Press, 2020. https://doi.org/10.1017/s1431927620021881."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","doi":"10.1017/s1431927620021881","article_processing_charge":"No","volume":26,"_id":"15286","publisher":"Oxford University Press","date_created":"2024-04-03T09:40:11Z","author":[{"full_name":"Fäßler, Florian","orcid":"0000-0001-7149-769X","first_name":"Florian","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler"},{"id":"38C393BE-F248-11E8-B48F-1D18A9856A87","last_name":"Dimchev","full_name":"Dimchev, Georgi A","orcid":"0000-0001-8370-6161","first_name":"Georgi A"},{"first_name":"Victor-Valentin","full_name":"Hodirnau, Victor-Valentin","orcid":"0000-0003-3904-947X","id":"3661B498-F248-11E8-B48F-1D18A9856A87","last_name":"Hodirnau"},{"last_name":"Zens","id":"45FD126C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9561-1239","full_name":"Zens, Bettina","first_name":"Bettina"},{"first_name":"Christoph","full_name":"Möhl, Christoph","last_name":"Möhl"},{"last_name":"Bradke","full_name":"Bradke, Frank","first_name":"Frank"},{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur"}],"publication_status":"published","quality_controlled":"1","day":"01"},{"OA_place":"publisher","publication_identifier":{"eissn":["2578-9430"]},"department":[{"_id":"MaDe"}],"article_number":"303","date_published":"2020-09-20T00:00:00Z","DOAJ_listed":"1","intvolume":" 2020","language":[{"iso":"eng"}],"file":[{"date_created":"2025-03-11T08:27:40Z","date_updated":"2025-03-11T08:27:40Z","content_type":"application/pdf","file_size":1486239,"relation":"main_file","file_name":"2020_MicroPublBio_Kazatskaya.pdf","checksum":"14a7cad20775521ce85e0e3c77aa7936","creator":"dernst","file_id":"19383","access_level":"open_access","success":1}],"title":"The URX oxygen-sensing neurons in C. elegans are ciliated","publication":"microPublication Biology","issue":"9","type":"journal_article","year":"2020","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Kazatskaya, L. Yuan, N.P. Amin-Wetzel, A. Philbrook, M. de Bono, P. Sengupta, MicroPublication Biology 2020 (2020).","ista":"Kazatskaya A, Yuan L, Amin-Wetzel NP, Philbrook A, de Bono M, Sengupta P. 2020. The URX oxygen-sensing neurons in C. elegans are ciliated. microPublication Biology. 2020(9), 303.","mla":"Kazatskaya, Anna, et al. “The URX Oxygen-Sensing Neurons in C. Elegans Are Ciliated.” MicroPublication Biology, vol. 2020, no. 9, 303, Caltech Library, 2020, doi:10.17912/MICROPUB.BIOLOGY.000303.","ama":"Kazatskaya A, Yuan L, Amin-Wetzel NP, Philbrook A, de Bono M, Sengupta P. The URX oxygen-sensing neurons in C. elegans are ciliated. microPublication Biology. 2020;2020(9). doi:10.17912/MICROPUB.BIOLOGY.000303","apa":"Kazatskaya, A., Yuan, L., Amin-Wetzel, N. P., Philbrook, A., de Bono, M., & Sengupta, P. (2020). The URX oxygen-sensing neurons in C. elegans are ciliated. MicroPublication Biology. Caltech Library. https://doi.org/10.17912/MICROPUB.BIOLOGY.000303","ieee":"A. Kazatskaya, L. Yuan, N. P. Amin-Wetzel, A. Philbrook, M. de Bono, and P. Sengupta, “The URX oxygen-sensing neurons in C. elegans are ciliated,” microPublication Biology, vol. 2020, no. 9. Caltech Library, 2020.","chicago":"Kazatskaya, Anna, Lisa Yuan, Niko Paresh Amin-Wetzel, Alison Philbrook, Mario de Bono, and Piali Sengupta. “The URX Oxygen-Sensing Neurons in C. Elegans Are Ciliated.” MicroPublication Biology. Caltech Library, 2020. https://doi.org/10.17912/MICROPUB.BIOLOGY.000303."},"volume":2020,"status":"public","date_created":"2025-03-07T08:21:51Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","oa_version":"Published Version","file_date_updated":"2025-03-11T08:27:40Z","article_type":"original","oa":1,"OA_type":"gold","acknowledgement":"We thank Maureen Barr, Martin Harterink, Max Heiman and Inna Nechipurenko for reagents, the Caenorhabditis Genetics Center for strains, and the Sengupta lab for comments and advice.\r\nThis work was funded in part by the NIH (R35 GM122463 – P.S., and F32 DC018453 – A.P.), and the EMBO (ALTF 302-2019 – N.A-W.).","date_updated":"2025-03-11T08:30:41Z","has_accepted_license":"1","month":"09","ddc":["570"],"article_processing_charge":"Yes","doi":"10.17912/MICROPUB.BIOLOGY.000303","_id":"19306","publication_status":"published","external_id":{"pmid":["33005885"]},"publisher":"Caltech Library","author":[{"last_name":"Kazatskaya","first_name":"Anna","full_name":"Kazatskaya, Anna"},{"last_name":"Yuan","first_name":"Lisa","full_name":"Yuan, Lisa"},{"last_name":"Amin-Wetzel","id":"E95D3014-9D8C-11E9-9C80-D2F8E5697425","first_name":"Niko Paresh","full_name":"Amin-Wetzel, Niko Paresh"},{"full_name":"Philbrook, Alison","first_name":"Alison","last_name":"Philbrook"},{"first_name":"Mario","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono"},{"first_name":"Piali","full_name":"Sengupta, Piali","last_name":"Sengupta"}],"day":"20"},{"article_type":"original","oa":1,"oa_version":"Submitted Version","file_date_updated":"2020-10-08T08:34:53Z","month":"06","has_accepted_license":"1","date_updated":"2025-07-10T11:52:55Z","acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","ddc":["006"],"day":"01","_id":"5681","publication_status":"published","external_id":{"pmid":["30507534"],"isi":["000532295600014"]},"author":[{"full_name":"Hikaru, Ibayashi","first_name":"Ibayashi","last_name":"Hikaru"},{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"},{"first_name":"Nils","full_name":"Thuerey, Nils","last_name":"Thuerey"},{"full_name":"Igarashi, Takeo","first_name":"Takeo","last_name":"Igarashi"},{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"}],"publisher":"IEEE","doi":"10.1109/TVCG.2018.2883628","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms."}],"isi":1,"department":[{"_id":"ChWo"}],"publication_identifier":{"issn":["1077-2626"],"eissn":["1941-0506"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"intvolume":" 26","date_published":"2020-06-01T00:00:00Z","page":"2288-2302","pmid":1,"type":"journal_article","issue":"6","year":"2020","publication":"IEEE Transactions on Visualization and Computer Graphics","title":"Simulating liquids on dynamically warping grids","file":[{"success":1,"file_id":"8626","access_level":"open_access","creator":"wojtan","file_name":"preprint.pdf","checksum":"8d4c55443a0ee335bb5bb652de503042","file_size":21910098,"relation":"main_file","content_type":"application/pdf","date_created":"2020-10-08T08:34:53Z","date_updated":"2020-10-08T08:34:53Z"}],"language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","date_created":"2018-12-16T22:59:21Z","status":"public","volume":26,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302.","ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:10.1109/TVCG.2018.2883628.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 2020;26(6):2288-2302. doi:10.1109/TVCG.2018.2883628","apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2020). Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2018.2883628","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics. IEEE, 2020. https://doi.org/10.1109/TVCG.2018.2883628."}},{"isi":1,"department":[{"_id":"LaEr"}],"publication_identifier":{"issn":["0091-1798"]},"intvolume":" 48","page":"963-1001","arxiv":1,"date_published":"2020-03-01T00:00:00Z","type":"journal_article","year":"2020","issue":"2","language":[{"iso":"eng"}],"publication":"Annals of Probability","title":"Correlated random matrices: Band rigidity and edge universality","date_created":"2019-03-28T09:20:08Z","scopus_import":"1","quality_controlled":"1","related_material":{"record":[{"id":"6179","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"149","status":"public"}]},"citation":{"apa":"Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379","ieee":"J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” Annals of Probability, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.","chicago":"Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.","short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","ista":"Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.","mla":"Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.","ama":"Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","volume":48,"oa":1,"article_type":"original","oa_version":"Preprint","date_updated":"2026-04-08T14:11:36Z","month":"03","main_file_link":[{"url":"https://arxiv.org/abs/1804.07744","open_access":"1"}],"ec_funded":1,"publication_status":"published","_id":"6184","external_id":{"isi":["000528269100013"],"arxiv":["1804.07744"]},"author":[{"first_name":"Johannes","full_name":"Alt, Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","first_name":"Dominik J"}],"publisher":"Institute of Mathematical Statistics","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804"}],"day":"01","doi":"10.1214/19-AOP1379","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models."}]},{"arxiv":1,"page":"1203-1278","date_published":"2020-09-01T00:00:00Z","intvolume":" 378","isi":1,"department":[{"_id":"LaEr"}],"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"citation":{"chicago":"Erdös, László, Torben H Krüger, and Dominik J Schröder. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03657-4.","apa":"Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03657-4","ieee":"L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality for random matrices I: Local law and the complex Hermitian case,” Communications in Mathematical Physics, vol. 378. Springer Nature, pp. 1203–1278, 2020.","mla":"Erdös, László, et al. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” Communications in Mathematical Physics, vol. 378, Springer Nature, 2020, pp. 1203–78, doi:10.1007/s00220-019-03657-4.","ama":"Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. 2020;378:1203-1278. doi:10.1007/s00220-019-03657-4","ista":"Erdös L, Krüger TH, Schröder DJ. 2020. Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. 378, 1203–1278.","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 1203–1278."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","volume":378,"date_created":"2019-03-28T10:21:15Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","quality_controlled":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6179"}]},"file":[{"creator":"dernst","success":1,"file_id":"8771","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-11-18T11:14:37Z","date_created":"2020-11-18T11:14:37Z","checksum":"c3a683e2afdcea27afa6880b01e53dc2","file_name":"2020_CommMathPhysics_Erdoes.pdf","relation":"main_file","file_size":2904574}],"language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","type":"journal_article","year":"2020","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to Johannes Alt for numerous discussions on the Dyson equation and for his invaluable help in adjusting [10] to the needs of the present work.","has_accepted_license":"1","date_updated":"2026-04-08T13:55:03Z","month":"09","oa_version":"Published Version","file_date_updated":"2020-11-18T11:14:37Z","article_type":"original","oa":1,"doi":"10.1007/s00220-019-03657-4","article_processing_charge":"Yes (via OA deal)","abstract":[{"lang":"eng","text":"For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969)."}],"external_id":{"isi":["000529483000001"],"arxiv":["1809.03971"]},"_id":"6185","publication_status":"published","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger"},{"last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J"}],"publisher":"Springer Nature","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"day":"01","ec_funded":1,"ddc":["530","510"]},{"pmid":1,"year":"2020","issue":"2","type":"journal_article","title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","publication":"Journal of Statistical Physics","corr_author":"1","language":[{"iso":"eng"}],"file":[{"file_name":"2019_JourStatistPhysics_Carlen.pdf","checksum":"7b04befbdc0d4982c0ee945d25d19872","file_size":905538,"relation":"main_file","content_type":"application/pdf","date_created":"2019-12-23T12:03:09Z","date_updated":"2020-07-14T12:47:28Z","file_id":"7209","access_level":"open_access","creator":"dernst"}],"related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"quality_controlled":"1","scopus_import":"1","date_created":"2019-04-30T07:34:18Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":178,"status":"public","citation":{"short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 2020;178(2):319-378. doi:10.1007/s10955-019-02434-w","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w.","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems,” Journal of Statistical Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","apa":"Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"department":[{"_id":"JaMa"}],"isi":1,"intvolume":" 178","date_published":"2020-01-01T00:00:00Z","arxiv":1,"page":"319-378","ddc":["500"],"ec_funded":1,"day":"01","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"name":"Taming Complexity in Partial Differential Systems","_id":"260482E2-B435-11E9-9278-68D0E5697425","grant_number":"F06504","call_identifier":"FWF"}],"external_id":{"isi":["000498933300001"],"pmid":["33223567"],"arxiv":["1811.04572"]},"_id":"6358","publisher":"Springer Nature","author":[{"full_name":"Carlen, Eric A.","first_name":"Eric A.","last_name":"Carlen"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan"}],"publication_status":"published","article_processing_charge":"Yes (via OA deal)","abstract":[{"lang":"eng","text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates."}],"doi":"10.1007/s10955-019-02434-w","oa":1,"article_type":"original","oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:28Z","month":"01","date_updated":"2025-06-12T07:27:20Z","has_accepted_license":"1"},{"oa":1,"article_type":"original","oa_version":"Published Version","file_date_updated":"2020-09-21T13:15:02Z","has_accepted_license":"1","date_updated":"2023-10-16T09:22:50Z","month":"07","ddc":["510"],"external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"_id":"6359","publisher":"Institute of Mathematical Statistics","publication_status":"published","author":[{"last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos","first_name":"Konstantinos"},{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","first_name":"Mate","full_name":"Gerencser, Mate"}],"day":"16","doi":"10.1214/20-EJP479","article_processing_charge":"No","abstract":[{"text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.","lang":"eng"}],"isi":1,"department":[{"_id":"JaMa"}],"publication_identifier":{"eissn":["1083-6489"]},"intvolume":" 25","arxiv":1,"date_published":"2020-07-16T00:00:00Z","article_number":"82","year":"2020","type":"journal_article","file":[{"creator":"dernst","file_id":"8549","access_level":"open_access","success":1,"date_created":"2020-09-21T13:15:02Z","date_updated":"2020-09-21T13:15:02Z","content_type":"application/pdf","relation":"main_file","file_size":273042,"file_name":"2020_EJournProbab_Dareiotis.pdf","checksum":"8e7c42e72596f6889d786e8e8b89994f"}],"language":[{"iso":"eng"}],"publication":"Electronic Journal of Probability","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","date_created":"2019-04-30T07:40:17Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP479.","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020.","apa":"Dareiotis, K., & Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP479","ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP479","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP479.","ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","volume":25},{"publisher":"Cambridge University Press","_id":"19986","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","full_name":"Novotný, Petr","first_name":"Petr"}],"publication_status":"published","project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"}],"day":"18","doi":"10.1017/9781108770750.008","article_processing_charge":"No","abstract":[{"lang":"eng","text":"For non-probabilistic programs, a key question in static analysis is termination, which asks whether a given program terminates under a given initial condition. In the presence of probabilistic behaviour, there are two fundamental extensions of the termination question: (a) the almost-sure termination question, which asks whether the termination probability is 1; and (b) the bounded-time termination question, which asks whether the expected termination time is bounded. There are many active research directions to address these two questions; one important such direction is the use of martingale theory for termination analysis. In this chapter, we survey the main techniques of the martingale-based approach to the termination analysis of probabilistic programs."}],"ddc":["000"],"has_accepted_license":"1","date_updated":"2025-09-23T12:10:25Z","month":"11","acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN\r\nGrant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Hongfei Fu\r\nis supported by the National Natural Science Foundation of China (NSFC) Grant\r\nNo. 61802254. Petr Novotný is supported by the Czech Science Foundation grant\r\nNo. GJ19-15134Y.","oa":1,"file_date_updated":"2025-09-23T12:03:09Z","oa_version":"Published Version","date_created":"2025-07-10T13:28:51Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","citation":{"ista":"Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258.","short":"K. Chatterjee, H. Fu, P. Novotný, in:, Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–258.","mla":"Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs with Martingales.” Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008.","ama":"Chatterjee K, Fu H, Novotný P. Termination Analysis of Probabilistic Programs with Martingales. In: Foundations of Probabilistic Programming. Cambridge University Press; 2020:221-258. doi:10.1017/9781108770750.008","apa":"Chatterjee, K., Fu, H., & Novotný, P. (2020). Termination Analysis of Probabilistic Programs with Martingales. In Foundations of Probabilistic Programming (pp. 221–258). Cambridge University Press. https://doi.org/10.1017/9781108770750.008","ieee":"K. Chatterjee, H. Fu, and P. Novotný, “Termination Analysis of Probabilistic Programs with Martingales,” in Foundations of Probabilistic Programming, Cambridge University Press, 2020, pp. 221–258.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Petr Novotný. “Termination Analysis of Probabilistic Programs with Martingales.” In Foundations of Probabilistic Programming, 221–58. Cambridge University Press, 2020. https://doi.org/10.1017/9781108770750.008."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"book_chapter","year":"2020","file":[{"success":1,"file_id":"20380","access_level":"open_access","creator":"dernst","checksum":"28ece115e8d2d9263e253a598e7caef2","file_name":"2020_ProbProgramming_Chatterjee.pdf","file_size":316681,"relation":"main_file","content_type":"application/pdf","date_updated":"2025-09-23T12:03:09Z","date_created":"2025-09-23T12:03:09Z"}],"language":[{"iso":"eng"}],"corr_author":"1","publication":"Foundations of Probabilistic Programming","title":"Termination Analysis of Probabilistic Programs with Martingales","page":"221-258","date_published":"2020-11-18T00:00:00Z","publication_identifier":{"eisbn":["9781108770750"],"isbn":["9781108488518"]},"department":[{"_id":"KrCh"}],"OA_place":"publisher"},{"type":"preprint","year":"2020","publication":"arXiv","ec_funded":1,"title":"The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions","language":[{"iso":"eng"}],"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"day":"11","related_material":{"record":[{"id":"10007","status":"public","relation":"dissertation_contains"}]},"date_created":"2021-09-13T12:17:11Z","_id":"10012","publication_status":"draft","author":[{"last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","first_name":"Julian L"},{"first_name":"Sebastian","orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Laux, Tim","first_name":"Tim","last_name":"Laux"},{"last_name":"Simon","full_name":"Simon, Thilo","first_name":"Thilo"}],"external_id":{"arxiv":["2003.05478"]},"status":"public","doi":"10.48550/arXiv.2003.05478","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a \"gradient flow calibration\" ensures that the route of steepest descent in the energy landscape is unique and stable."}],"citation":{"chicago":"Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2003.05478.","apa":"Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv. https://doi.org/10.48550/arXiv.2003.05478","ieee":"J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions,” arXiv. .","mla":"Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, 2003.05478, doi:10.48550/arXiv.2003.05478.","ama":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv. doi:10.48550/arXiv.2003.05478","short":"J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).","ista":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv, 2003.05478."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"department":[{"_id":"JuFi"}],"oa_version":"Preprint","month":"03","date_updated":"2026-04-08T07:01:01Z","date_published":"2020-03-11T00:00:00Z","acknowledgement":"Parts of the paper were written during the visit of the authors to the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the framework of the trimester program “Evolution of Interfaces”. The support and the hospitality of HIM are gratefully acknowledged. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385.","article_number":"2003.05478","main_file_link":[{"url":"https://arxiv.org/abs/2003.05478","open_access":"1"}],"arxiv":1},{"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.10962"}],"acknowledgement":"This work is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.","date_updated":"2026-04-08T07:00:03Z","month":"08","ec_funded":1,"doi":"10.48550/arXiv.2008.10962","abstract":[{"text":"We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["2008.10962"]},"_id":"10022","publication_status":"draft","author":[{"last_name":"Forkert","id":"35C79D68-F248-11E8-B48F-1D18A9856A87","full_name":"Forkert, Dominik L","first_name":"Dominik L"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan"},{"last_name":"Portinale","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo","first_name":"Lorenzo"}],"project":[{"name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"day":"25","department":[{"_id":"JaMa"}],"arxiv":1,"article_number":"2008.10962","date_published":"2020-08-25T00:00:00Z","language":[{"iso":"eng"}],"corr_author":"1","publication":"arXiv","title":"Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","year":"2020","type":"preprint","citation":{"short":"D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).","ista":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.","mla":"Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, 2008.10962, doi:10.48550/arXiv.2008.10962.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv. doi:10.48550/arXiv.2008.10962","apa":"Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv. https://doi.org/10.48550/arXiv.2008.10962","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” arXiv. .","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2008.10962."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_created":"2021-09-17T10:57:27Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"11739"},{"relation":"dissertation_contains","status":"public","id":"10030"}]}},{"abstract":[{"lang":"eng","text":"We discus noise channels in coherent electro-optic up-conversion between microwave and optical fields, in particular due to optical heating. We also report on a novel configuration, which promises to be flexible and highly efficient."}],"article_processing_charge":"No","doi":"10.1364/QUANTUM.2020.QTu8A.1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. New designs and noise channels in electro-optic microwave to optical up-conversion. In: OSA Quantum 2.0 Conference. Optica Publishing Group; 2020. doi:10.1364/QUANTUM.2020.QTu8A.1","mla":"Lambert, Nicholas J., et al. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” OSA Quantum 2.0 Conference, QTu8A.1, Optica Publishing Group, 2020, doi:10.1364/QUANTUM.2020.QTu8A.1.","short":"N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA Quantum 2.0 Conference, Optica Publishing Group, 2020.","ista":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. 2020. New designs and noise channels in electro-optic microwave to optical up-conversion. OSA Quantum 2.0 Conference. OSA: Optical Society of America, OSA Technical Digest, , QTu8A.1.","chicago":"Lambert, Nicholas J., Sonia Mobassem, Alfredo R Rueda Sanchez, and Harald G.L. Schwefel. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” In OSA Quantum 2.0 Conference. Optica Publishing Group, 2020. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1.","ieee":"N. J. Lambert, S. Mobassem, A. R. Rueda Sanchez, and H. G. L. Schwefel, “New designs and noise channels in electro-optic microwave to optical up-conversion,” in OSA Quantum 2.0 Conference, Washington, DC, United States, 2020.","apa":"Lambert, N. J., Mobassem, S., Rueda Sanchez, A. R., & Schwefel, H. G. L. (2020). New designs and noise channels in electro-optic microwave to optical up-conversion. In OSA Quantum 2.0 Conference. Washington, DC, United States: Optica Publishing Group. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1"},"day":"01","conference":{"start_date":"2020-09-14","location":"Washington, DC, United States","name":"OSA: Optical Society of America","end_date":"2020-09-17"},"scopus_import":"1","quality_controlled":"1","publisher":"Optica Publishing Group","_id":"10328","date_created":"2021-11-21T23:01:31Z","author":[{"last_name":"Lambert","full_name":"Lambert, Nicholas J.","first_name":"Nicholas J."},{"last_name":"Mobassem","full_name":"Mobassem, Sonia","first_name":"Sonia"},{"full_name":"Rueda Sanchez, Alfredo R","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","last_name":"Rueda Sanchez"},{"last_name":"Schwefel","full_name":"Schwefel, Harald G.L.","first_name":"Harald G.L."}],"publication_status":"published","title":"New designs and noise channels in electro-optic microwave to optical up-conversion","publication":"OSA Quantum 2.0 Conference","language":[{"iso":"eng"}],"year":"2020","type":"conference","article_number":"QTu8A.1","date_published":"2020-01-01T00:00:00Z","alternative_title":["OSA Technical Digest"],"month":"01","date_updated":"2023-10-18T08:32:34Z","oa_version":"None","publication_identifier":{"isbn":["9-781-5575-2820-9"]},"department":[{"_id":"JoFi"}]},{"article_processing_charge":"No","abstract":[{"lang":"eng","text":"In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364","mla":"Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.","short":"E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767.","ista":"Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1751–1767.","chicago":"Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 1751–1767. Association for Computing Machinery, 2020. https://doi.org/10.1145/3372297.3423364.","ieee":"E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual, United States, 2020, pp. 1751–1767.","apa":"Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 1751–1767). Virtual, United States: Association for Computing Machinery. https://doi.org/10.1145/3372297.3423364"},"scopus_import":"1","quality_controlled":"1","date_created":"2021-12-16T13:23:27Z","publication_identifier":{"isbn":["978-1-4503-7089-9"]},"department":[{"_id":"ElKo"}],"isi":1,"date_published":"2020-10-30T00:00:00Z","page":"1751–1767"},{"ipn":"10581613","year":"2020","type":"patent","title":"Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods","ipc":" H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236","day":"03","related_material":{"link":[{"url":"https://patents.google.com/patent/US20180359096A1/en","relation":"earlier_version"}]},"_id":"10557","author":[{"first_name":"Bryan","full_name":"Ford, Bryan","last_name":"Ford"},{"full_name":"Gasse, Linus","first_name":"Linus","last_name":"Gasse"},{"first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"},{"last_name":"Jovanovic","full_name":"Jovanovic, Philipp","first_name":"Philipp"}],"date_created":"2021-12-16T13:28:59Z","extern":"1","status":"public","abstract":[{"lang":"eng","text":"Data storage and retrieval systems, methods, and computer-readable media utilize a cryptographically verifiable data structure that facilitates verification of a transaction in a decentralized peer-to-peer environment using multi-hop backwards and forwards links. Backward links are cryptographic hashes of past records. Forward links are cryptographic signatures of future records that are added retroactively to records once the target block has been appended to the data structure."}],"article_processing_charge":"No","publication_date":"2020-03-03","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Ford, Bryan, Linus Gasse, Eleftherios Kokoris Kogias, and Philipp Jovanovic. “Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods,” 2020.","apa":"Ford, B., Gasse, L., Kokoris Kogias, E., & Jovanovic, P. (2020). Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.","ieee":"B. Ford, L. Gasse, E. Kokoris Kogias, and P. Jovanovic, “Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.” 2020.","mla":"Ford, Bryan, et al. Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods. 2020.","ama":"Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods. 2020.","ista":"Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. 2020. Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.","short":"B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020)."},"oa":1,"department":[{"_id":"ElKo"}],"applicant":["Ecole Polytechnique Federale de Lausanne"],"oa_version":"Published Version","month":"03","date_updated":"2021-12-21T10:04:50Z","date_published":"2020-03-03T00:00:00Z","main_file_link":[{"url":"https://patents.google.com/patent/US10581613B2/en","open_access":"1"}],"application_date":"2017-06-09"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations."},"quality_controlled":"1","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"date_created":"2022-01-25T15:50:00Z","title":"Learning representations for binary-classification without backpropagation","corr_author":"1","publication":"8th International Conference on Learning Representations","language":[{"iso":"eng"}],"file":[{"file_id":"10677","access_level":"open_access","success":1,"creator":"mlechner","relation":"main_file","file_size":249431,"file_name":"iclr_2020.pdf","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","date_created":"2022-01-26T07:35:17Z","date_updated":"2022-01-26T07:35:17Z","content_type":"application/pdf"}],"type":"conference","year":"2020","date_published":"2020-03-11T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity."}],"conference":{"end_date":"2020-05-01","name":"ICLR: International Conference on Learning Representations","location":"Virtual ; Addis Ababa, Ethiopia","start_date":"2020-04-26"},"day":"11","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"_id":"10672","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias"}],"publication_status":"published","publisher":"ICLR","ddc":["000"],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"month":"03","date_updated":"2025-04-15T06:25:56Z","has_accepted_license":"1","file_date_updated":"2022-01-26T07:35:17Z","oa_version":"Published Version","oa":1},{"ddc":["000"],"abstract":[{"lang":"eng","text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level."}],"article_processing_charge":"No","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"}],"conference":{"start_date":"2020-07-12","location":"Virtual","name":"ML: Machine Learning","end_date":"2020-07-18"},"author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"_id":"10673","publication_status":"published","oa_version":"Published Version","file_date_updated":"2022-01-26T11:08:51Z","oa":1,"acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"has_accepted_license":"1","date_updated":"2025-04-15T06:25:56Z","publication":"Proceedings of the 37th International Conference on Machine Learning","title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","file":[{"relation":"main_file","file_size":2329798,"checksum":"c9a4a29161777fc1a89ef451c040e3b1","file_name":"2020_PMLR_Hasani.pdf","date_updated":"2022-01-26T11:08:51Z","date_created":"2022-01-26T11:08:51Z","content_type":"application/pdf","access_level":"open_access","file_id":"10691","success":1,"creator":"cchlebak"}],"language":[{"iso":"eng"}],"year":"2020","type":"conference","status":"public","citation":{"short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","scopus_import":"1","quality_controlled":"1","series_title":"PMLR","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"date_created":"2022-01-25T15:50:34Z","publication_identifier":{"issn":["2640-3498"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"alternative_title":["PMLR"],"date_published":"2020-01-01T00:00:00Z","page":"4082-4093"},{"abstract":[{"lang":"eng","text":"The first wafer-scale growth of site-controlled Ge/Si nanowires is reported by Georgios Katsaros, Jian-Jun Zhang, and co-workers in article number 1906523. They are highly uniform and their position, distance, length, and even square- or L-shaped structures can all be precisely controlled. The electrically tunable spin-orbit coupling demonstrated by transport measurements and the charge sensing between quantum dots in closely spaced wires open a path toward scalable qubit devices using nanowires on silicon."}],"article_processing_charge":"No","doi":"10.1002/adma.202070122","day":"23","_id":"17444","publication_status":"published","publisher":"Wiley","author":[{"full_name":"Gao, Fei","first_name":"Fei","last_name":"Gao"},{"last_name":"Wang","full_name":"Wang, Jian‐Huan","first_name":"Jian‐Huan"},{"last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes","first_name":"Hannes"},{"first_name":"Hao","full_name":"Hu, Hao","last_name":"Hu"},{"first_name":"Marko J.","full_name":"Rančić, Marko J.","last_name":"Rančić"},{"last_name":"Zhang","first_name":"Jie‐Yin","full_name":"Zhang, Jie‐Yin"},{"last_name":"Wang","full_name":"Wang, Ting","first_name":"Ting"},{"last_name":"Yao","full_name":"Yao, Yuan","first_name":"Yuan"},{"full_name":"Wang, Gui‐Lei","first_name":"Gui‐Lei","last_name":"Wang"},{"full_name":"Kukucka, Josip","first_name":"Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada","first_name":"Lada"},{"full_name":"Kloeffel, Christoph","first_name":"Christoph","last_name":"Kloeffel"},{"first_name":"Daniel","full_name":"Loss, Daniel","last_name":"Loss"},{"last_name":"Liu","full_name":"Liu, Feng","first_name":"Feng"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"},{"full_name":"Zhang, Jian‐Jun","first_name":"Jian‐Jun","last_name":"Zhang"}],"ddc":["530"],"main_file_link":[{"url":"https://doi.org/10.1002/adma.202070122","open_access":"1"}],"month":"04","date_updated":"2026-06-18T17:54:47Z","oa_version":"Published Version","oa":1,"volume":32,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Gao, Fei, Jian‐Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie‐Yin Zhang, Ting Wang, et al. Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020). Advanced Materials. Vol. 32. Wiley, 2020. https://doi.org/10.1002/adma.202070122.","ieee":"F. Gao et al., Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020), vol. 32, no. 16. Wiley, 2020.","apa":"Gao, F., Wang, J., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J., … Zhang, J. (2020). Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020). Advanced Materials (Vol. 32). Wiley. https://doi.org/10.1002/adma.202070122","ama":"Gao F, Wang J, Watzinger H, et al. Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020). Vol 32. Wiley; 2020. doi:10.1002/adma.202070122","mla":"Gao, Fei, et al. “Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020).” Advanced Materials, vol. 32, no. 16, 2070122, Wiley, 2020, doi:10.1002/adma.202070122.","ista":"Gao F, Wang J, Watzinger H, Hu H, Rančić MJ, Zhang J, Wang T, Yao Y, Wang G, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J. 2020. Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020), Wiley,p.","short":"F. Gao, J. Wang, H. Watzinger, H. Hu, M.J. Rančić, J. Zhang, T. Wang, Y. Yao, G. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros, J. Zhang, Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020), Wiley, 2020."},"related_material":{"record":[{"id":"7541","status":"public","relation":"other"}]},"quality_controlled":"1","date_created":"2024-08-20T08:22:42Z","title":"Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020)","publication":"Advanced Materials","language":[{"iso":"eng"}],"type":"other_academic_publication","year":"2020","issue":"16","article_number":"2070122","date_published":"2020-04-23T00:00:00Z","intvolume":" 32","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"department":[{"_id":"GeKa"}]}]