[{"doi":"10.4230/LIPIcs.ESA.2020.75","license":"https://creativecommons.org/licenses/by/3.0/","title":"Generalizing CGAL periodic Delaunay triangulations","ec_funded":1,"has_accepted_license":"1","article_number":"75","date_created":"2020-10-25T23:01:18Z","publication":"28th Annual European Symposium on Algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"}],"date_updated":"2023-09-07T13:29:00Z","_id":"8703","type":"conference","volume":173,"status":"public","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"quality_controlled":"1","date_published":"2020-08-26T00:00:00Z","author":[{"last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"},{"last_name":"Rouxel-Labbé","first_name":"Mael","full_name":"Rouxel-Labbé, Mael"},{"last_name":"Teillaud","first_name":"Monique","full_name":"Teillaud, Monique"}],"scopus_import":"1","conference":{"location":"Virtual, Online; Pisa, Italy","start_date":"2020-09-07","name":"ESA: Annual European Symposium on Algorithms","end_date":"2020-09-09"},"language":[{"iso":"eng"}],"intvolume":"       173","publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"citation":{"apa":"Osang, G. F., Rouxel-Labbé, M., &#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in <i>28th Annual European Symposium on Algorithms</i>, Virtual, Online; Pisa, Italy, 2020, vol. 173.","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>.","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>.","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"file":[{"access_level":"open_access","file_id":"8712","relation":"main_file","checksum":"fe0f7c49a99ed870c671b911e10d5496","creator":"cziletti","file_name":"2020_LIPIcs_Osang.pdf","success":1,"content_type":"application/pdf","date_updated":"2020-10-27T14:31:52Z","file_size":733291,"date_created":"2020-10-27T14:31:52Z"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"ddc":["000"],"year":"2020","publication_status":"published","oa":1,"file_date_updated":"2020-10-27T14:31:52Z","article_processing_charge":"No","department":[{"_id":"HeEd"}],"month":"08","day":"26","oa_version":"Published Version","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9056"}]},"abstract":[{"lang":"eng","text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. "}]},{"status":"public","quality_controlled":"1","type":"conference","_id":"8704","date_updated":"2023-08-22T10:40:15Z","conference":{"location":"Paris, France","start_date":"2020-05-31","name":"ICRA: International Conference on Robotics and Automation","end_date":"2020-08-31"},"language":[{"iso":"eng"}],"date_published":"2020-05-01T00:00:00Z","scopus_import":"1","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"external_id":{"isi":["000712319503110"]},"page":"5446-5452","date_created":"2020-10-25T23:01:19Z","publication":"Proceedings - IEEE International Conference on Robotics and Automation","has_accepted_license":"1","doi":"10.1109/ICRA40945.2020.9196608","title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"file_date_updated":"2020-11-06T10:58:49Z","isi":1,"oa_version":"Submitted Version","day":"01","abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"month":"05","department":[{"_id":"ToHe"}],"article_processing_charge":"No","citation":{"ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Paris, France, 2020, pp. 5446–5452.","apa":"Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In <i>Proceedings - IEEE International Conference on Robotics and Automation</i> (pp. 5446–5452). Paris, France: IEEE. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: <i>Proceedings - IEEE International Conference on Robotics and Automation</i>. IEEE; 2020:5446-5452. doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, 5446–52. IEEE, 2020. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>.","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, IEEE, 2020, pp. 5446–52, doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>."},"file":[{"creator":"dernst","relation":"main_file","checksum":"fccf7b986ac78046918a298cc6849a50","file_id":"8733","access_level":"open_access","file_size":1070010,"date_created":"2020-11-06T10:58:49Z","date_updated":"2020-11-06T10:58:49Z","content_type":"application/pdf","success":1,"file_name":"2020_ICRA_Lechner.pdf"}],"publisher":"IEEE","publication_identifier":{"isbn":["9781728173955"],"issn":["10504729"]},"year":"2020","ddc":["000"],"publication_status":"published","oa":1,"alternative_title":["ICRA"]},{"publication_status":"published","oa":1,"ddc":["530"],"year":"2020","publication_identifier":{"issn":["1424-0637"]},"intvolume":"        21","publisher":"Springer Nature","file":[{"relation":"main_file","checksum":"c12c9c1e6f08def245e42f3cb1d83827","creator":"cziletti","access_level":"open_access","file_id":"8711","date_created":"2020-10-27T12:49:04Z","file_size":469831,"success":1,"file_name":"2020_Annales_Mysliwy.pdf","content_type":"application/pdf","date_updated":"2020-10-27T12:49:04Z"}],"citation":{"ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” <i>Annales Henri Poincare</i>, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","apa":"Mysliwy, K., &#38; Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. 2020;21(12):4003-4025. doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>.","mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.","ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025."},"arxiv":1,"article_processing_charge":"Yes (via OA deal)","month":"12","department":[{"_id":"RoSe"}],"abstract":[{"lang":"eng","text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model."}],"related_material":{"record":[{"id":"11473","relation":"dissertation_contains","status":"public"}]},"article_type":"original","issue":"12","day":"01","oa_version":"Published Version","isi":1,"file_date_updated":"2020-10-27T12:49:04Z","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","ec_funded":1,"title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","doi":"10.1007/s00023-020-00969-3","license":"https://creativecommons.org/licenses/by/4.0/","has_accepted_license":"1","date_created":"2020-10-25T23:01:19Z","publication":"Annales Henri Poincare","external_id":{"isi":["000578111800002"],"arxiv":["2003.12371"]},"page":"4003-4025","author":[{"first_name":"Krzysztof","full_name":"Mysliwy, Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87","last_name":"Mysliwy"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"scopus_import":"1","date_published":"2020-12-01T00:00:00Z","language":[{"iso":"eng"}],"volume":21,"_id":"8705","type":"journal_article","date_updated":"2023-09-07T13:43:51Z","quality_controlled":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","quality_controlled":"1","_id":"8706","date_updated":"2021-01-12T08:20:40Z","type":"journal_article","volume":73,"language":[{"iso":"ger"}],"date_published":"2020-07-14T00:00:00Z","scopus_import":"1","author":[{"full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ferus","full_name":"Ferus, Andreas","first_name":"Andreas"},{"last_name":"Hikl","full_name":"Hikl, Anna-Laetitia","first_name":"Anna-Laetitia"},{"last_name":"McNeill","first_name":"Gerda","full_name":"McNeill, Gerda"},{"full_name":"Miniberger, Clemens","first_name":"Clemens","last_name":"Miniberger"},{"first_name":"Steve","full_name":"Reding, Steve","last_name":"Reding"},{"last_name":"Zarka","first_name":"Tobias","full_name":"Zarka, Tobias"},{"last_name":"Zojer","first_name":"Michael","full_name":"Zojer, Michael"}],"page":"278-284","date_created":"2020-10-25T23:01:19Z","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","has_accepted_license":"1","doi":"10.31263/voebm.v73i2.3941","title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-10-27T16:27:25Z","oa_version":"Published Version","day":"14","issue":"2","article_type":"original","abstract":[{"lang":"eng","text":"As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level."},{"lang":"ger","text":"Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler Ebene dienen."}],"department":[{"_id":"E-Lib"}],"month":"07","article_processing_charge":"No","file":[{"creator":"kschuh","checksum":"37443c34d91d5bdbeb38c78b14792537","relation":"main_file","file_id":"8714","access_level":"open_access","file_size":960317,"date_created":"2020-10-27T16:27:25Z","date_updated":"2020-10-27T16:27:25Z","content_type":"application/pdf","file_name":"2020_VOEB_Danowski.pdf","success":1}],"citation":{"ama":"Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2020;73(2):278-284. doi:<a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">10.31263/voebm.v73i2.3941</a>","chicago":"Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. <a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">https://doi.org/10.31263/voebm.v73i2.3941</a>.","mla":"Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 278–84, doi:<a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">10.31263/voebm.v73i2.3941</a>.","short":"P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding, T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 278–284.","ista":"Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T, Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(2), 278–284.","ieee":"P. Danowski <i>et al.</i>, “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 278–284, 2020.","apa":"Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding, S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">https://doi.org/10.31263/voebm.v73i2.3941</a>"},"publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","intvolume":"        73","publication_identifier":{"eissn":["10222588"]},"year":"2020","ddc":["020"],"publication_status":"published","oa":1},{"pmid":1,"isi":1,"day":"19","oa_version":"None","abstract":[{"text":"Dynamic changes in the three-dimensional (3D) organization of chromatin are associated with central biological processes, such as transcription, replication and development. Therefore, the comprehensive identification and quantification of these changes is fundamental to understanding of evolutionary and regulatory mechanisms. Here, we present Comparison of Hi-C Experiments using Structural Similarity (CHESS), an algorithm for the comparison of chromatin contact maps and automatic differential feature extraction. We demonstrate the robustness of CHESS to experimental variability and showcase its biological applications on (1) interspecies comparisons of syntenic regions in human and mouse models; (2) intraspecies identification of conformational changes in Zelda-depleted Drosophila embryos; (3) patient-specific aberrant chromatin conformation in a diffuse large B-cell lymphoma sample; and (4) the systematic identification of chromatin contact differences in high-resolution Capture-C data. In summary, CHESS is a computationally efficient method for the comparison and classification of changes in chromatin contact data.","lang":"eng"}],"article_type":"original","article_processing_charge":"No","month":"10","department":[{"_id":"FyKo"}],"citation":{"apa":"Galan, S., Machnik, N. N., Kruse, K., Díaz, N., Marti-Renom, M. A., &#38; Vaquerizas, J. M. (2020). CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. <i>Nature Genetics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41588-020-00712-y\">https://doi.org/10.1038/s41588-020-00712-y</a>","ieee":"S.  Galan, N. N. Machnik, K. Kruse, N. Díaz, M. A. Marti-Renom, and J. M. Vaquerizas, “CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction,” <i>Nature Genetics</i>, vol. 52. Springer Nature, pp. 1247–1255, 2020.","mla":"Galan, Silvia, et al. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” <i>Nature Genetics</i>, vol. 52, Springer Nature, 2020, pp. 1247–55, doi:<a href=\"https://doi.org/10.1038/s41588-020-00712-y\">10.1038/s41588-020-00712-y</a>.","ama":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. <i>Nature Genetics</i>. 2020;52:1247-1255. doi:<a href=\"https://doi.org/10.1038/s41588-020-00712-y\">10.1038/s41588-020-00712-y</a>","chicago":"Galan, Silvia, Nick N Machnik, Kai Kruse, Noelia Díaz, Marc A Marti-Renom, and Juan M Vaquerizas. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” <i>Nature Genetics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41588-020-00712-y\">https://doi.org/10.1038/s41588-020-00712-y</a>.","ista":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. 2020. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. Nature Genetics. 52, 1247–1255.","short":"S.  Galan, N.N. Machnik, K. Kruse, N. Díaz, M.A. Marti-Renom, J.M. Vaquerizas, Nature Genetics 52 (2020) 1247–1255."},"publisher":"Springer Nature","intvolume":"        52","publication_identifier":{"eissn":["15461718"],"issn":["10614036"]},"year":"2020","publication_status":"published","status":"public","quality_controlled":"1","_id":"8707","date_updated":"2023-08-22T10:37:10Z","type":"journal_article","volume":52,"language":[{"iso":"eng"}],"date_published":"2020-10-19T00:00:00Z","author":[{"last_name":" Galan","full_name":" Galan, Silvia","first_name":"Silvia"},{"last_name":"Machnik","id":"3591A0AA-F248-11E8-B48F-1D18A9856A87","full_name":"Machnik, Nick N","orcid":"0000-0001-6617-9742","first_name":"Nick N"},{"last_name":"Kruse","first_name":"Kai","full_name":"Kruse, Kai"},{"last_name":"Díaz","first_name":"Noelia","full_name":"Díaz, Noelia"},{"last_name":"Marti-Renom","first_name":"Marc A","full_name":"Marti-Renom, Marc A"},{"last_name":"Vaquerizas","first_name":"Juan M","full_name":"Vaquerizas, Juan M"}],"scopus_import":"1","external_id":{"isi":["000579693500004"],"pmid":["33077914"]},"page":"1247-1255","date_created":"2020-10-25T23:01:20Z","publication":"Nature Genetics","doi":"10.1038/s41588-020-00712-y","title":"CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"Work in the Vaquerizas laboratory is funded by the Max Planck Society, the Deutsche Forschungsgemeinschaft (DFG) Priority Programme SPP 2202 ‘Spatial Genome Architecture in Development and Disease’ (project no. 422857230 to J.M.V.), the DFG Clinical Research Unit CRU326 ‘Male Germ Cells: from Genes to Function’ (project no. 329621271 to J.M.V.), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 643062—ZENCODE-ITN to J.M.V.) and the Medical Research Council in the UK. This research was partially funded by the European Union’s H2020 Framework Programme through the European Research Council (grant no. 609989 to M.A.M.-R.). We thank the support of the Spanish Ministerio de Ciencia, Innovación y Universidades through grant no. BFU2017-85926-P to M.A.M.-R. The Centre for Genomic Regulation thanks the support of the Ministerio de Ciencia, Innovación y Universidades to the European Molecular Biology Laboratory partnership, the ‘Centro de Excelencia Severo Ochoa 2013–2017’, agreement no. SEV-2012-0208, the CERCA Programme/Generalitat de Catalunya, Spanish Ministerio de Ciencia, Innovación y Universidades through the Instituto de Salud Carlos III, the Generalitat de Catalunya through the Departament de Salut and Departament d’Empresa i Coneixement and cofinancing by the Spanish Ministerio de Ciencia, Innovación y Universidades with funds from the European Regional Development Fund corresponding to the 2014–2020 Smart Growth Operating Program. S.G. thanks the support from the Company of Biologists (grant no. JCSTF181158) and the European Molecular Biology Organization Short-Term Fellowship programme."},{"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/molecular-compass-for-cell-orientation/","relation":"press_release"}]},"abstract":[{"lang":"eng","text":"Spontaneously arising channels that transport the phytohormone auxin provide positional cues for self-organizing aspects of plant development such as flexible vasculature regeneration or its patterning during leaf venation. The auxin canalization hypothesis proposes a feedback between auxin signaling and transport as the underlying mechanism, but molecular players await discovery. We identified part of the machinery that routes auxin transport. The auxin-regulated receptor CAMEL (Canalization-related Auxin-regulated Malectin-type RLK) together with CANAR (Canalization-related Receptor-like kinase) interact with and phosphorylate PIN auxin transporters. camel and canar mutants are impaired in PIN1 subcellular trafficking and auxin-mediated PIN polarization, which macroscopically manifests as defects in leaf venation and vasculature regeneration after wounding. The CAMEL-CANAR receptor complex is part of the auxin feedback that coordinates polarization of individual cells during auxin canalization."}],"article_type":"original","issue":"6516","day":"30","oa_version":"Published Version","article_processing_charge":"No","month":"10","department":[{"_id":"JiFr"}],"pmid":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"isi":1,"publication_status":"published","oa":1,"year":"2020","main_file_link":[{"url":"https://europepmc.org/article/MED/33122378#free-full-text","open_access":"1"}],"publisher":"American Association for the Advancement of Science","citation":{"chicago":"Hajny, Jakub, Tomas Prat, N Rydza, Lesia Rodriguez Solovey, Shutang Tan, Inge Verstraeten, David Domjan, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>.","ama":"Hajny J, Prat T, Rydza N, et al. Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. 2020;370(6516):550-557. doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>","mla":"Hajny, Jakub, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>, vol. 370, no. 6516, American Association for the Advancement of Science, 2020, pp. 550–57, doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>.","short":"J. Hajny, T. Prat, N. Rydza, L. Rodriguez Solovey, S. Tan, I. Verstraeten, D. Domjan, E. Mazur, E. Smakowska-Luzan, W. Smet, E. Mor, J. Nolf, B. Yang, W. Grunewald, G. Molnar, Y. Belkhadir, B. De Rybel, J. Friml, Science 370 (2020) 550–557.","ista":"Hajny J, Prat T, Rydza N, Rodriguez Solovey L, Tan S, Verstraeten I, Domjan D, Mazur E, Smakowska-Luzan E, Smet W, Mor E, Nolf J, Yang B, Grunewald W, Molnar G, Belkhadir Y, De Rybel B, Friml J. 2020. Receptor kinase module targets PIN-dependent auxin transport during canalization. Science. 370(6516), 550–557.","ieee":"J. Hajny <i>et al.</i>, “Receptor kinase module targets PIN-dependent auxin transport during canalization,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, pp. 550–557, 2020.","apa":"Hajny, J., Prat, T., Rydza, N., Rodriguez Solovey, L., Tan, S., Verstraeten, I., … Friml, J. (2020). Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>"},"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"intvolume":"       370","language":[{"iso":"eng"}],"author":[{"first_name":"Jakub","full_name":"Hajny, Jakub","orcid":"0000-0003-2140-7195","last_name":"Hajny","id":"4800CC20-F248-11E8-B48F-1D18A9856A87"},{"id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","last_name":"Prat","full_name":"Prat, Tomas","first_name":"Tomas"},{"last_name":"Rydza","full_name":"Rydza, N","first_name":"N"},{"first_name":"Lesia","full_name":"Rodriguez Solovey, Lesia","orcid":"0000-0002-7244-7237","last_name":"Rodriguez Solovey","id":"3922B506-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang","first_name":"Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","last_name":"Tan"},{"id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"},{"first_name":"David","orcid":"0000-0003-2267-106X","full_name":"Domjan, David","id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F","last_name":"Domjan"},{"last_name":"Mazur","first_name":"E","full_name":"Mazur, E"},{"first_name":"E","full_name":"Smakowska-Luzan, E","last_name":"Smakowska-Luzan"},{"last_name":"Smet","first_name":"W","full_name":"Smet, W"},{"first_name":"E","full_name":"Mor, E","last_name":"Mor"},{"last_name":"Nolf","full_name":"Nolf, J","first_name":"J"},{"first_name":"B","full_name":"Yang, B","last_name":"Yang"},{"last_name":"Grunewald","full_name":"Grunewald, W","first_name":"W"},{"last_name":"Molnar","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87","first_name":"Gergely","full_name":"Molnar, Gergely"},{"first_name":"Y","full_name":"Belkhadir, Y","last_name":"Belkhadir"},{"last_name":"De Rybel","full_name":"De Rybel, B","first_name":"B"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"scopus_import":"1","date_published":"2020-10-30T00:00:00Z","quality_controlled":"1","status":"public","volume":370,"_id":"8721","date_updated":"2023-09-05T12:02:35Z","type":"journal_article","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425"},{"_id":"2699E3D2-B435-11E9-9278-68D0E5697425","name":"Cell surface receptor complexes for PIN polarity and auxin-mediated development","grant_number":"25239"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We acknowledge M. Glanc and Y. Zhang for providing entryclones; Vienna Biocenter Core Facilities (VBCF) for recombinantprotein production and purification; Vienna Biocenter Massspectrometry Facility, Bioimaging, and Life Science Facilities at IST Austria and Proteomics Core Facility CEITEC for a great assistance.Funding:This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 742985) and Austrian Science Fund (FWF): I 3630-B25 to J.F.and by grants from the Austrian Academy of Science through the Gregor Mendel Institute (Y.B.) and the Austrian Agency for International Cooperation in Education and Research (D.D.); the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001) (W.S.); the Research Foundation–Flanders (FWO;Odysseus II G0D0515N) and a European Research Council grant (ERC; StG TORPEDO; 714055) to B.D.R., B.Y., and E.M.; and the Hertha Firnberg Programme postdoctoral fellowship (T-947) from the FWF Austrian Science Fund to E.S.-L.; J.H. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at IST Austria.","date_created":"2020-11-02T10:04:46Z","publication":"Science","external_id":{"pmid":["33122378"],"isi":["000583031800041"]},"page":"550-557","title":"Receptor kinase module targets PIN-dependent auxin transport during canalization","ec_funded":1,"doi":"10.1126/science.aba3178"},{"date_published":"2020-02-01T00:00:00Z","author":[{"last_name":"Li","full_name":"Li, Shigang","first_name":"Shigang"},{"last_name":"Tal Ben-Nun","full_name":"Tal Ben-Nun, Tal Ben-Nun","first_name":"Tal Ben-Nun"},{"last_name":"Girolamo","first_name":"Salvatore Di","full_name":"Girolamo, Salvatore Di"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Torsten","full_name":"Hoefler, Torsten","last_name":"Hoefler"}],"conference":{"name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming","end_date":"2020-02-26","location":"San Diego, CA, United States","start_date":"2020-02-22"},"language":[{"iso":"eng"}],"_id":"8722","date_updated":"2023-08-22T12:13:48Z","type":"conference","status":"public","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/3332466.3374528","title":"Taming unbalanced training workloads in deep learning with partial collective operations","ec_funded":1,"page":"45-61","external_id":{"arxiv":["1908.04207"],"isi":["000564476500004"]},"publication":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","date_created":"2020-11-05T15:25:30Z","month":"02","department":[{"_id":"DaAl"}],"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","day":"01","abstract":[{"lang":"eng","text":"Load imbalance pervasively exists in distributed deep learning training systems, either caused by the inherent imbalance in learned tasks or by the system itself. Traditional synchronous Stochastic Gradient Descent (SGD)\r\nachieves good accuracy for a wide variety of tasks, but relies on global synchronization to accumulate the gradients at every training step. In this paper, we propose eager-SGD, which relaxes the global synchronization for\r\ndecentralized accumulation. To implement eager-SGD, we propose to use two partial collectives: solo and majority. With solo allreduce, the faster processes contribute their gradients eagerly without waiting for the slower processes, whereas with majority allreduce, at least half of the participants must contribute gradients before continuing, all without using a central parameter server. We theoretically prove the convergence of the algorithms and describe the partial collectives in detail. Experimental results on load-imbalanced environments (CIFAR-10, ImageNet, and UCF101 datasets) show\r\nthat eager-SGD achieves 1.27x speedup over the state-of-the-art synchronous SGD, without losing accuracy."}],"isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1908.04207","open_access":"1"}],"year":"2020","oa":1,"publication_status":"published","citation":{"ista":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 45–61.","short":"S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61.","mla":"Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2020, pp. 45–61, doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>.","chicago":"Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 45–61. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>.","ama":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. Taming unbalanced training workloads in deep learning with partial collective operations. In: <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2020:45-61. doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>","apa":"Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., &#38; Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>","ieee":"S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, San Diego, CA, United States, 2020, pp. 45–61."},"publisher":"Association for Computing Machinery"},{"author":[{"first_name":"Nikola H","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov"},{"full_name":"Frantar, Elias","first_name":"Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"scopus_import":"1","date_published":"2020-07-12T00:00:00Z","language":[{"iso":"eng"}],"conference":{"start_date":"2020-07-12","location":"Online","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning"},"volume":119,"date_updated":"2023-09-07T13:42:08Z","_id":"8724","type":"conference","quality_controlled":"1","status":"public","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"Dan Alistarh is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"On the sample complexity of adversarial multi-source PAC learning","ec_funded":1,"has_accepted_license":"1","date_created":"2020-11-05T15:25:58Z","publication":"Proceedings of the 37th International Conference on Machine Learning","page":"5416-5425","external_id":{"arxiv":["2002.10384"]},"arxiv":1,"article_processing_charge":"No","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"month":"07","related_material":{"link":[{"relation":"supplementary_material","url":"http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf"}],"record":[{"id":"10799","relation":"dissertation_contains","status":"public"}]},"abstract":[{"text":"We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze the situation in which a learning system obtains datasets from multiple sources, some of which might be biased or even adversarially perturbed. It is\r\nknown that in the single-source case, an adversary with the power to corrupt a fixed fraction of the training data can prevent PAC-learnability, that is, even in the limit of infinitely much training data, no learning system can approach the optimal test error. In this work we show that, surprisingly, the same is not true in the multi-source setting, where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources. Our main results are a generalization bound that provides finite-sample guarantees for this learning setting, as well as corresponding lower bounds. Besides establishing PAC-learnability our results also show that in a cooperative learning setting sharing data with other parties has provable benefits, even if some\r\nparticipants are malicious. ","lang":"eng"}],"day":"12","oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2021-02-15T09:00:01Z","oa":1,"publication_status":"published","ddc":["000"],"year":"2020","publication_identifier":{"issn":["2640-3498"]},"intvolume":"       119","publisher":"ML Research Press","citation":{"ista":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.","short":"N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.","mla":"Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, ML Research Press, 2020, pp. 5416–25.","chicago":"Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:5416–25. ML Research Press, 2020.","ama":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ML Research Press; 2020:5416-5425.","apa":"Konstantinov, N. H., Frantar, E., Alistarh, D.-A., &#38; Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 5416–5425). Online: ML Research Press.","ieee":"N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Online, 2020, vol. 119, pp. 5416–5425."},"file":[{"success":1,"file_name":"2020_PMLR_Konstantinov.pdf","date_updated":"2021-02-15T09:00:01Z","content_type":"application/pdf","date_created":"2021-02-15T09:00:01Z","file_size":281286,"file_id":"9120","access_level":"open_access","relation":"main_file","checksum":"cc755d0054bc4b2be778ea7aa7884d2f","creator":"dernst"}]},{"series_title":"LIPIcs","file_date_updated":"2021-03-11T12:33:35Z","abstract":[{"text":"The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n  In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings.","lang":"eng"}],"day":"03","oa_version":"Published Version","arxiv":1,"article_processing_charge":"No","department":[{"_id":"DaAl"}],"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., &#38; Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in <i>34th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In <i>34th International Symposium on Distributed Computing</i>, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>"},"file":[{"file_id":"9237","access_level":"open_access","checksum":"a626a9c47df52b6f6d97edd910dae4ba","relation":"main_file","creator":"dernst","success":1,"file_name":"2020_LIPIcs_Aksenov.pdf","date_updated":"2021-03-11T12:33:35Z","content_type":"application/pdf","date_created":"2021-03-11T12:33:35Z","file_size":740358}],"publication_identifier":{"isbn":["9783959771689"],"issn":["1868-8969"]},"intvolume":"       179","oa":1,"publication_status":"published","ddc":["000"],"year":"2020","quality_controlled":"1","status":"public","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"volume":179,"type":"conference","_id":"8725","date_updated":"2023-02-23T13:41:40Z","language":[{"iso":"eng"}],"conference":{"name":"DISC: Symposium on Distributed Computing","end_date":"2020-10-16","location":"Freiburg, Germany","start_date":"2020-10-12"},"author":[{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexandra","full_name":"Drozdova, Alexandra","last_name":"Drozdova"},{"last_name":"Mohtashami","full_name":"Mohtashami, Amirkeivan","first_name":"Amirkeivan"}],"date_published":"2020-08-03T00:00:00Z","has_accepted_license":"1","publication":"34th International Symposium on Distributed Computing","date_created":"2020-11-05T15:26:17Z","external_id":{"arxiv":["2008.01009"]},"page":"3:1-3:18","title":"The splay-list: A distribution-adaptive concurrent skip-list","ec_funded":1,"doi":"10.4230/LIPIcs.DISC.2020.3","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML."},{"author":[{"last_name":"Gotfryd","first_name":"Dorota","full_name":"Gotfryd, Dorota"},{"id":"8275014E-6063-11E9-9B7F-6338E6697425","last_name":"Paerschke","orcid":"0000-0003-0853-8182","full_name":"Paerschke, Ekaterina","first_name":"Ekaterina"},{"last_name":"Wohlfeld","first_name":"Krzysztof","full_name":"Wohlfeld, Krzysztof"},{"last_name":"Oleś","full_name":"Oleś, Andrzej M.","first_name":"Andrzej M."}],"scopus_import":"1","date_published":"2020-08-26T00:00:00Z","language":[{"iso":"eng"}],"volume":5,"type":"journal_article","_id":"8726","date_updated":"2021-01-12T08:20:46Z","quality_controlled":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","ec_funded":1,"doi":"10.3390/condmat5030053","has_accepted_license":"1","article_number":"53","publication":"Condensed Matter","date_created":"2020-11-06T07:21:00Z","external_id":{"arxiv":["2009.11773"]},"arxiv":1,"article_processing_charge":"No","month":"08","department":[{"_id":"MiLe"}],"abstract":[{"lang":"eng","text":"Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling."}],"article_type":"original","day":"26","issue":"3","oa_version":"Published Version","file_date_updated":"2020-11-06T07:24:40Z","oa":1,"publication_status":"published","ddc":["530"],"year":"2020","publication_identifier":{"issn":["2410-3896"]},"intvolume":"         5","publisher":"MDPI","file":[{"success":1,"file_name":"2020_CondensedMatter_Gotfryd.pdf","content_type":"application/pdf","date_updated":"2020-11-06T07:24:40Z","file_size":768336,"date_created":"2020-11-06T07:24:40Z","file_id":"8727","access_level":"open_access","checksum":"a57a698ff99a11b6665bafd1bac7afbc","relation":"main_file","creator":"dernst"}],"citation":{"ista":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53.","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>, vol. 5, no. 3, 53, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>.","ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. 2020;5(3). doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., &#38; Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. MDPI. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>","ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” <i>Condensed Matter</i>, vol. 5, no. 3. MDPI, 2020."}},{"intvolume":"     12302","publication_identifier":{"isbn":["9783030591519"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783030591526"]},"citation":{"ieee":"A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in <i>Automated Technology for Verification and Analysis</i>, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.","apa":"Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., &#38; Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In <i>Automated Technology for Verification and Analysis</i> (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">https://doi.org/10.1007/978-3-030-59152-6_14</a>","chicago":"Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In <i>Automated Technology for Verification and Analysis</i>, 12302:253–70. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">https://doi.org/10.1007/978-3-030-59152-6_14</a>.","ama":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: <i>Automated Technology for Verification and Analysis</i>. Vol 12302. Springer Nature; 2020:253-270. doi:<a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">10.1007/978-3-030-59152-6_14</a>","mla":"Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” <i>Automated Technology for Verification and Analysis</i>, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">10.1007/978-3-030-59152-6_14</a>.","short":"A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270.","ista":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270."},"file":[{"file_id":"8729","access_level":"open_access","checksum":"ae83f27e5b189d5abc2e7514f1b7e1b5","relation":"main_file","creator":"dernst","success":1,"file_name":"2020_LNCS_ATVA_Asadi_accepted.pdf","content_type":"application/pdf","date_updated":"2020-11-06T07:41:03Z","date_created":"2020-11-06T07:41:03Z","file_size":726648}],"publisher":"Springer Nature","alternative_title":["LNCS"],"ddc":["000"],"year":"2020","publication_status":"published","oa":1,"isi":1,"file_date_updated":"2020-11-06T07:41:03Z","article_processing_charge":"No","month":"10","department":[{"_id":"KrCh"}],"day":"12","oa_version":"Submitted Version","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"abstract":[{"lang":"eng","text":"Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the quantitative problems. For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in   O((n+m)⋅t2)  time, given a tree decomposition of the MC with width t. Our results also imply a bound of   O(κ⋅(n+m)⋅t2)  for each objective on MDPs, where   κ  is the number of strategy-iteration refinements required for the given input and objective. Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms outperform existing well-established methods by one or more orders of magnitude."}],"doi":"10.1007/978-3-030-59152-6_14","title":"Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth","external_id":{"isi":["000723555700014"]},"page":"253-270","has_accepted_license":"1","date_created":"2020-11-06T07:30:05Z","publication":"Automated Technology for Verification and Analysis","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"_id":"8728","date_updated":"2025-06-02T08:53:43Z","type":"conference","volume":12302,"status":"public","quality_controlled":"1","date_published":"2020-10-12T00:00:00Z","author":[{"last_name":"Asadi","first_name":"Ali","full_name":"Asadi, Ali"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mohammadi, Kiarash","first_name":"Kiarash","last_name":"Mohammadi"},{"first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"}],"scopus_import":"1","conference":{"start_date":"2020-10-19","location":"Hanoi, Vietnam","end_date":"2020-10-23","name":"ATVA: Automated Technology for Verification and Analysis"},"language":[{"iso":"eng"}]},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"page":"325-338","date_created":"2020-11-06T08:45:03Z","publication":"Graph-Theoretic Concepts in Computer Science","doi":"10.1007/978-3-030-60440-0_26","ec_funded":1,"title":"Inserting one edge into a simple drawing is hard","conference":{"start_date":"2020-06-24","location":"Leeds, United Kingdom","end_date":"2020-06-26","name":"WG: Workshop on Graph-Theoretic Concepts in Computer Science"},"language":[{"iso":"eng"}],"date_published":"2020-10-09T00:00:00Z","scopus_import":"1","author":[{"last_name":"Arroyo Guevara","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670"},{"first_name":"Fabian","full_name":"Klute, Fabian","last_name":"Klute"},{"full_name":"Parada, Irene","first_name":"Irene","last_name":"Parada"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"first_name":"Birgit","full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber"},{"first_name":"Tilo","full_name":"Wiedera, Tilo","last_name":"Wiedera"}],"status":"public","quality_controlled":"1","date_updated":"2023-09-05T15:09:16Z","_id":"8732","type":"conference","volume":12301,"year":"2020","publication_status":"published","alternative_title":["LNCS"],"citation":{"apa":"Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., &#38; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 12301, pp. 325–338). Leeds, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>","ieee":"A. M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and T. Wiedera, “Inserting one edge into a simple drawing is hard,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Leeds, United Kingdom, 2020, vol. 12301, pp. 325–338.","mla":"Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>.","ama":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Inserting one edge into a simple drawing is hard. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 12301. Springer Nature; 2020:325-338. doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>","chicago":"Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.” In <i>Graph-Theoretic Concepts in Computer Science</i>, 12301:325–38. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>.","ista":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.","short":"A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338."},"publisher":"Springer Nature","intvolume":"     12301","publication_identifier":{"isbn":["9783030604394","9783030604400"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa_version":"None","day":"09","abstract":[{"lang":"eng","text":"A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of   G+e  extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is   NP -complete to decide whether one edge can be inserted into a simple drawing. This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles   A  and a pseudosegment   σ , it can be decided in polynomial time whether there exists a pseudocircle   Φσ  extending   σ  for which   A∪{Φσ}  is again an arrangement of pseudocircles."}],"department":[{"_id":"UlWa"}],"month":"10","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"scopus_import":"1","author":[{"last_name":"Kampjut","id":"37233050-F248-11E8-B48F-1D18A9856A87","first_name":"Domen","full_name":"Kampjut, Domen"},{"first_name":"Leonid A","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2020-10-30T00:00:00Z","quality_controlled":"1","status":"public","volume":370,"type":"journal_article","_id":"8737","date_updated":"2023-08-22T12:35:38Z","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank J. Novacek (CEITEC Brno) and V.-V. Hodirnau (IST Austria) for their help with collecting cryo-EM datasets. We thank the IST Life Science and Electron Microscopy Facilities for providing equipment. This work has been supported by iNEXT,project number 653706, funded by the Horizon 2020 program of the European Union. This article reflects only the authors’view,and the European Commission is not responsible for any use that may be made of the information it contains. CIISB research infrastructure project LM2015043 funded by MEYS CR is gratefully acknowledged for the financial support of the measurements at the CF Cryo-electron Microscopy and Tomography CEITEC MU.This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement no. 665385","publication":"Science","date_created":"2020-11-08T23:01:23Z","has_accepted_license":"1","article_number":"eabc4209","external_id":{"pmid":["32972993"],"isi":["000583031800004"]},"ec_funded":1,"title":"The coupling mechanism of mammalian respiratory complex I","doi":"10.1126/science.abc4209","article_type":"original","abstract":[{"lang":"eng","text":"Mitochondrial complex I couples NADH:ubiquinone oxidoreduction to proton pumping by an unknown mechanism. Here, we present cryo-electron microscopy structures of ovine complex I in five different conditions, including turnover, at resolutions up to 2.3 to 2.5 angstroms. Resolved water molecules allowed us to experimentally define the proton translocation pathways. Quinone binds at three positions along the quinone cavity, as does the inhibitor rotenone that also binds within subunit ND4. Dramatic conformational changes around the quinone cavity couple the redox reaction to proton translocation during open-to-closed state transitions of the enzyme. In the induced deactive state, the open conformation is arrested by the ND6 subunit. We propose a detailed molecular coupling mechanism of complex I, which is an unexpected combination of conformational changes and electrostatic interactions."}],"oa_version":"Submitted Version","day":"30","issue":"6516","month":"10","department":[{"_id":"LeSa"}],"article_processing_charge":"No","pmid":1,"file_date_updated":"2020-11-26T18:47:58Z","isi":1,"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"EM-Fac"}],"publication_status":"published","oa":1,"year":"2020","ddc":["572"],"publisher":"American Association for the Advancement of Science","file":[{"content_type":"application/pdf","date_updated":"2020-11-26T18:47:58Z","file_name":"Full_manuscript_with_SI_opt_red.pdf","success":1,"file_size":7618987,"date_created":"2020-11-26T18:47:58Z","file_id":"8820","access_level":"open_access","creator":"lsazanov","checksum":"658ba90979ca9528a2efdfac8547047a","relation":"main_file"}],"citation":{"ieee":"D. Kampjut and L. A. Sazanov, “The coupling mechanism of mammalian respiratory complex I,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, 2020.","apa":"Kampjut, D., &#38; Sazanov, L. A. (2020). The coupling mechanism of mammalian respiratory complex I. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abc4209\">https://doi.org/10.1126/science.abc4209</a>","chicago":"Kampjut, Domen, and Leonid A Sazanov. “The Coupling Mechanism of Mammalian Respiratory Complex I.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.abc4209\">https://doi.org/10.1126/science.abc4209</a>.","ama":"Kampjut D, Sazanov LA. The coupling mechanism of mammalian respiratory complex I. <i>Science</i>. 2020;370(6516). doi:<a href=\"https://doi.org/10.1126/science.abc4209\">10.1126/science.abc4209</a>","mla":"Kampjut, Domen, and Leonid A. Sazanov. “The Coupling Mechanism of Mammalian Respiratory Complex I.” <i>Science</i>, vol. 370, no. 6516, eabc4209, American Association for the Advancement of Science, 2020, doi:<a href=\"https://doi.org/10.1126/science.abc4209\">10.1126/science.abc4209</a>.","short":"D. Kampjut, L.A. Sazanov, Science 370 (2020).","ista":"Kampjut D, Sazanov LA. 2020. The coupling mechanism of mammalian respiratory complex I. Science. 370(6516), eabc4209."},"publication_identifier":{"eissn":["10959203"]},"intvolume":"       370"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank Michele Nardin and Federico Stella for comments on an earlier version of the manuscript. K Deisseroth for providing the pAAV-CaMKIIα::eNpHR3.0-YFP plasmid through Addgene. E Boyden for providing AAV2/1.CaMKII::ArchT.GFP.WPRE.SV40 plasmid through Penn Vector Core. This work was supported by the Austrian Science Fund (I02072 and I03713) and a Swiss National Science Foundation grant to PS. The authors declare no conflicts of interest.","project":[{"_id":"257D4372-B435-11E9-9278-68D0E5697425","grant_number":"I2072-B27","name":"Interneuron plasticity during spatial learning","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I03713","name":"Interneuro Plasticity During Spatial Learning","_id":"2654F984-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000584369000001"]},"article_number":"61106","has_accepted_license":"1","publication":"eLife","date_created":"2020-11-08T23:01:25Z","doi":"10.7554/eLife.61106","title":"Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior","language":[{"iso":"eng"}],"date_published":"2020-10-05T00:00:00Z","author":[{"orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor","first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","last_name":"Gridchyn"},{"id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","last_name":"Schönenberger","full_name":"Schönenberger, Philipp","first_name":"Philipp"},{"first_name":"Joseph","full_name":"O'Neill, Joseph","id":"426376DC-F248-11E8-B48F-1D18A9856A87","last_name":"O'Neill"},{"last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036"}],"scopus_import":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","_id":"8740","type":"journal_article","date_updated":"2024-02-21T12:43:40Z","volume":9,"ddc":["570"],"year":"2020","oa":1,"publication_status":"published","file":[{"file_size":447669,"date_created":"2020-11-09T09:17:40Z","content_type":"application/pdf","date_updated":"2020-11-09T09:17:40Z","file_name":"2020_eLife_Gridchyn.pdf","success":1,"creator":"dernst","checksum":"6a7b0543c440f4c000a1864e69377d95","relation":"main_file","access_level":"open_access","file_id":"8749"}],"citation":{"apa":"Gridchyn, I., Schönenberger, P., O’Neill, J., &#38; Csicsvari, J. L. (2020). Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.61106\">https://doi.org/10.7554/eLife.61106</a>","ieee":"I. Gridchyn, P. Schönenberger, J. O’Neill, and J. L. Csicsvari, “Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020.","mla":"Gridchyn, Igor, et al. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” <i>ELife</i>, vol. 9, 61106, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/eLife.61106\">10.7554/eLife.61106</a>.","chicago":"Gridchyn, Igor, Philipp Schönenberger, Joseph O’Neill, and Jozsef L Csicsvari. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/eLife.61106\">https://doi.org/10.7554/eLife.61106</a>.","ama":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/eLife.61106\">10.7554/eLife.61106</a>","ista":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. 2020. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 9, 61106.","short":"I. Gridchyn, P. Schönenberger, J. O’Neill, J.L. Csicsvari, ELife 9 (2020)."},"publisher":"eLife Sciences Publications","intvolume":"         9","publication_identifier":{"eissn":["2050084X"]},"day":"05","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In vitro work revealed that excitatory synaptic inputs to hippocampal inhibitory interneurons could undergo Hebbian, associative, or non-associative plasticity. Both behavioral and learning-dependent reorganization of these connections has also been demonstrated by measuring spike transmission probabilities in pyramidal cell-interneuron spike cross-correlations that indicate monosynaptic connections. Here we investigated the activity-dependent modification of these connections during exploratory behavior in rats by optogenetically inhibiting pyramidal cell and interneuron subpopulations. Light application and associated firing alteration of pyramidal and interneuron populations led to lasting changes in pyramidal-interneuron connection weights as indicated by spike transmission changes. Spike transmission alterations were predicted by the light-mediated changes in the number of pre- and postsynaptic spike pairing events and by firing rate changes of interneurons but not pyramidal cells. This work demonstrates the presence of activity-dependent associative and non-associative reorganization of pyramidal-interneuron connections triggered by the optogenetic modification of the firing rate and spike synchrony of cells."}],"related_material":{"record":[{"status":"public","relation":"research_data","id":"8563"}]},"article_type":"original","article_processing_charge":"No","department":[{"_id":"JoCs"}],"month":"10","file_date_updated":"2020-11-09T09:17:40Z","isi":1},{"isi":1,"file_date_updated":"2020-11-09T09:07:11Z","article_processing_charge":"No","department":[{"_id":"MiLe"}],"month":"06","abstract":[{"lang":"eng","text":"In ecology, climate and other fields, (sub)systems have been identified that can transition into a qualitatively different state when a critical threshold or tipping point in a driving process is crossed. An understanding of those tipping elements is of great interest given the increasing influence of humans on the biophysical Earth system. Complex interactions exist between tipping elements, e.g. physical mechanisms connect subsystems of the climate system. Based on earlier work on such coupled nonlinear systems, we systematically assessed the qualitative long-term behaviour of interacting tipping elements. We developed an understanding of the consequences of interactions\r\non the tipping behaviour allowing for tipping cascades to emerge under certain conditions. The (narrative) application of\r\nthese qualitative results to real-world examples of interacting tipping elements indicates that tipping cascades with profound consequences may occur: the interacting Greenland ice sheet and thermohaline ocean circulation might tip before the tipping points of the isolated subsystems are crossed. The eutrophication of the first lake in a lake chain might propagate through the following lakes without a crossing of their individual critical nutrient input levels. The possibility of emerging cascading tipping dynamics calls for the development of a unified theory of interacting tipping elements and the quantitative analysis of interacting real-world tipping elements."}],"article_type":"original","issue":"6","day":"01","oa_version":"Published Version","publication_identifier":{"eissn":["20545703"]},"intvolume":"         7","publisher":"The Royal Society","file":[{"access_level":"open_access","file_id":"8748","creator":"dernst","relation":"main_file","checksum":"5505c445de373bfd836eb4d3b48b1f37","content_type":"application/pdf","date_updated":"2020-11-09T09:07:11Z","success":1,"file_name":"2020_RoyalSocOpenScience_Klose.pdf","file_size":1611485,"date_created":"2020-11-09T09:07:11Z"}],"citation":{"short":"A.K. Klose, V. Karle, R. Winkelmann, J.F. Donges, Royal Society Open Science 7 (2020).","ista":"Klose AK, Karle V, Winkelmann R, Donges JF. 2020. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 7(6), 200599.","chicago":"Klose, Ann Kristin, Volker Karle, Ricarda Winkelmann, and Jonathan F. Donges. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” <i>Royal Society Open Science</i>. The Royal Society, 2020. <a href=\"https://doi.org/10.1098/rsos.200599\">https://doi.org/10.1098/rsos.200599</a>.","ama":"Klose AK, Karle V, Winkelmann R, Donges JF. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. <i>Royal Society Open Science</i>. 2020;7(6). doi:<a href=\"https://doi.org/10.1098/rsos.200599\">10.1098/rsos.200599</a>","mla":"Klose, Ann Kristin, et al. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” <i>Royal Society Open Science</i>, vol. 7, no. 6, 200599, The Royal Society, 2020, doi:<a href=\"https://doi.org/10.1098/rsos.200599\">10.1098/rsos.200599</a>.","ieee":"A. K. Klose, V. Karle, R. Winkelmann, and J. F. Donges, “Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements,” <i>Royal Society Open Science</i>, vol. 7, no. 6. The Royal Society, 2020.","apa":"Klose, A. K., Karle, V., Winkelmann, R., &#38; Donges, J. F. (2020). Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. <i>Royal Society Open Science</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsos.200599\">https://doi.org/10.1098/rsos.200599</a>"},"publication_status":"published","oa":1,"ddc":["530","550"],"year":"2020","volume":7,"_id":"8741","date_updated":"2023-10-18T08:39:17Z","type":"journal_article","quality_controlled":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"last_name":"Klose","full_name":"Klose, Ann Kristin","first_name":"Ann Kristin"},{"full_name":"Karle, Volker","orcid":"0000-0002-6963-0129","first_name":"Volker","last_name":"Karle","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425"},{"last_name":"Winkelmann","full_name":"Winkelmann, Ricarda","first_name":"Ricarda"},{"last_name":"Donges","first_name":"Jonathan F.","full_name":"Donges, Jonathan F."}],"scopus_import":"1","date_published":"2020-06-01T00:00:00Z","language":[{"iso":"eng"}],"title":"Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements","doi":"10.1098/rsos.200599","has_accepted_license":"1","article_number":"200599","date_created":"2020-11-08T23:01:25Z","publication":"Royal Society Open Science","external_id":{"isi":["000545625200001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"V.K. thanks the German National Academic Foundation (Studienstiftung des deutschen Volkes) for financial\r\nsupport. J.F.D. is grateful for financial support by the Stordalen Foundation via the Planetary Boundary Research\r\nNetwork (PB.net), the Earth League’s EarthDoc program and the European Research Council Advanced Grant\r\nproject ERA (Earth Resilience in the Anthropocene). We are thankful for support by the Leibniz Association\r\n(project DominoES).\r\nAcknowledgements. This work has been performed in the context of the copan collaboration and the FutureLab on Earth\r\nResilience in the Anthropocene at the Potsdam Institute for Climate Impact Research. Furthermore, we acknowledge\r\ndiscussions with and helpful comments by N. Wunderling, J. Heitzig and M. Wiedermann."},{"ddc":["570"],"year":"2020","oa":1,"publication_status":"published","intvolume":"        11","publication_identifier":{"issn":["2041-1723"]},"citation":{"apa":"Schulte, L., Mao, J., Reitz, J., Sreeramulu, S., Kudlinzki, D., Hodirnau, V.-V., … Schwalbe, H. (2020). Cysteine oxidation and disulfide formation in the ribosomal exit tunnel. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-19372-x\">https://doi.org/10.1038/s41467-020-19372-x</a>","ieee":"L. Schulte <i>et al.</i>, “Cysteine oxidation and disulfide formation in the ribosomal exit tunnel,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","mla":"Schulte, Linda, et al. “Cysteine Oxidation and Disulfide Formation in the Ribosomal Exit Tunnel.” <i>Nature Communications</i>, vol. 11, 5569, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-19372-x\">10.1038/s41467-020-19372-x</a>.","chicago":"Schulte, Linda, Jiafei Mao, Julian Reitz, Sridhar Sreeramulu, Denis Kudlinzki, Victor-Valentin Hodirnau, Jakob Meier-Credo, et al. “Cysteine Oxidation and Disulfide Formation in the Ribosomal Exit Tunnel.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-19372-x\">https://doi.org/10.1038/s41467-020-19372-x</a>.","ama":"Schulte L, Mao J, Reitz J, et al. Cysteine oxidation and disulfide formation in the ribosomal exit tunnel. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-19372-x\">10.1038/s41467-020-19372-x</a>","ista":"Schulte L, Mao J, Reitz J, Sreeramulu S, Kudlinzki D, Hodirnau V-V, Meier-Credo J, Saxena K, Buhr F, Langer JD, Blackledge M, Frangakis AS, Glaubitz C, Schwalbe H. 2020. Cysteine oxidation and disulfide formation in the ribosomal exit tunnel. Nature Communications. 11, 5569.","short":"L. Schulte, J. Mao, J. Reitz, S. Sreeramulu, D. Kudlinzki, V.-V. Hodirnau, J. Meier-Credo, K. Saxena, F. Buhr, J.D. Langer, M. Blackledge, A.S. Frangakis, C. Glaubitz, H. Schwalbe, Nature Communications 11 (2020)."},"file":[{"date_created":"2020-11-09T07:56:24Z","file_size":1670898,"success":1,"file_name":"2020_NatureComm_Schulte.pdf","date_updated":"2020-11-09T07:56:24Z","content_type":"application/pdf","checksum":"b2688f0347e69e6629bba582077278c5","relation":"main_file","creator":"dernst","file_id":"8745","access_level":"open_access"}],"publisher":"Springer Nature","article_processing_charge":"No","department":[{"_id":"EM-Fac"}],"month":"11","day":"04","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Understanding the conformational sampling of translation-arrested ribosome nascent chain complexes is key to understand co-translational folding. Up to now, coupling of cysteine oxidation, disulfide bond formation and structure formation in nascent chains has remained elusive. Here, we investigate the eye-lens protein γB-crystallin in the ribosomal exit tunnel. Using mass spectrometry, theoretical simulations, dynamic nuclear polarization-enhanced solid-state nuclear magnetic resonance and cryo-electron microscopy, we show that thiol groups of cysteine residues undergo S-glutathionylation and S-nitrosylation and form non-native disulfide bonds. Thus, covalent modification chemistry occurs already prior to nascent chain release as the ribosome exit tunnel provides sufficient space even for disulfide bond formation which can guide protein folding."}],"article_type":"original","isi":1,"file_date_updated":"2020-11-09T07:56:24Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We acknowledge help from Anja Seybert, Margot Frangakis, Diana Grewe, Mikhail Eltsov, Utz Ermel, and Shintaro Aibara. The work was supported by Deutsche Forschungsgemeinschaft in the CLiC graduate school. Work at the Center for Biomolecular Magnetic Resonance (BMRZ) is supported by the German state of Hesse. The work at BMRZ has been supported by the state of Hesse. L.S. has been supported by the DFG graduate college: CLiC.","doi":"10.1038/s41467-020-19372-x","title":"Cysteine oxidation and disulfide formation in the ribosomal exit tunnel","external_id":{"isi":["000592028600001"]},"article_number":"5569","has_accepted_license":"1","date_created":"2020-11-09T07:49:36Z","publication":"Nature Communications","date_published":"2020-11-04T00:00:00Z","author":[{"last_name":"Schulte","full_name":"Schulte, Linda","first_name":"Linda"},{"first_name":"Jiafei","full_name":"Mao, Jiafei","last_name":"Mao"},{"last_name":"Reitz","first_name":"Julian","full_name":"Reitz, Julian"},{"last_name":"Sreeramulu","full_name":"Sreeramulu, Sridhar","first_name":"Sridhar"},{"last_name":"Kudlinzki","first_name":"Denis","full_name":"Kudlinzki, Denis"},{"full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin","last_name":"Hodirnau","id":"3661B498-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meier-Credo","full_name":"Meier-Credo, Jakob","first_name":"Jakob"},{"last_name":"Saxena","full_name":"Saxena, Krishna","first_name":"Krishna"},{"last_name":"Buhr","full_name":"Buhr, Florian","first_name":"Florian"},{"first_name":"Julian D.","full_name":"Langer, Julian D.","last_name":"Langer"},{"first_name":"Martin","full_name":"Blackledge, Martin","last_name":"Blackledge"},{"last_name":"Frangakis","first_name":"Achilleas S.","full_name":"Frangakis, Achilleas S."},{"full_name":"Glaubitz, Clemens","first_name":"Clemens","last_name":"Glaubitz"},{"last_name":"Schwalbe","full_name":"Schwalbe, Harald","first_name":"Harald"}],"scopus_import":"1","language":[{"iso":"eng"}],"_id":"8744","type":"journal_article","date_updated":"2023-08-22T12:36:07Z","volume":11,"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"quality_controlled":"1"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"This work was partly supported by Grants-in-Aid for Scientific Research by Young Scientist A (KAKENHI Wakate-A) No.\r\nJP17H04802, Grants-in-Aid for Scientific Research No. JP19H05602 from the Japan Society for the Promotion of Science, and RIKEN Incentive Research Grant (Shoreikadai) 2016. M.V.K. and M.I. acknowledge financial support from the European Union (EU) via FP7 ERC Starting Grant 2012 (Project NANOSOLID, GA No. 306733) and ETH Zurich via ETH career seed grant (No. SEED-18 16-2). We acknowledge Mrs. T. Kikitsu and Dr. D. Hashizume (RIKEN-CEMS) for access to the transmission electron microscope facility.","title":"Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids","doi":"10.1063/5.0025965","publication":"Applied Physics Letters","date_created":"2020-11-09T08:05:43Z","article_number":"173101","external_id":{"isi":["000591639700001"]},"scopus_import":"1","author":[{"last_name":"Miranti","first_name":"Retno","full_name":"Miranti, Retno"},{"last_name":"Septianto","full_name":"Septianto, Ricky Dwi","first_name":"Ricky Dwi"},{"first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kovalenko","full_name":"Kovalenko, Maksym V.","first_name":"Maksym V."},{"last_name":"Matsushita","full_name":"Matsushita, Nobuhiro","first_name":"Nobuhiro"},{"last_name":"Iwasa","full_name":"Iwasa, Yoshihiro","first_name":"Yoshihiro"},{"first_name":"Satria Zulkarnaen","full_name":"Bisri, Satria Zulkarnaen","last_name":"Bisri"}],"date_published":"2020-10-26T00:00:00Z","language":[{"iso":"eng"}],"volume":117,"type":"journal_article","_id":"8746","date_updated":"2023-09-05T11:57:23Z","quality_controlled":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/5.0025965"}],"oa":1,"publication_status":"published","year":"2020","publication_identifier":{"issn":["0003-6951"],"eissn":["1077-3118"]},"intvolume":"       117","publisher":"AIP Publishing","citation":{"short":"R. Miranti, R.D. Septianto, M. Ibáñez, M.V. Kovalenko, N. Matsushita, Y. Iwasa, S.Z. Bisri, Applied Physics Letters 117 (2020).","ista":"Miranti R, Septianto RD, Ibáñez M, Kovalenko MV, Matsushita N, Iwasa Y, Bisri SZ. 2020. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. Applied Physics Letters. 117(17), 173101.","ama":"Miranti R, Septianto RD, Ibáñez M, et al. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. 2020;117(17). doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>","chicago":"Miranti, Retno, Ricky Dwi Septianto, Maria Ibáñez, Maksym V. Kovalenko, Nobuhiro Matsushita, Yoshihiro Iwasa, and Satria Zulkarnaen Bisri. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>.","mla":"Miranti, Retno, et al. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>, vol. 117, no. 17, 173101, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>.","ieee":"R. Miranti <i>et al.</i>, “Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids,” <i>Applied Physics Letters</i>, vol. 117, no. 17. AIP Publishing, 2020.","apa":"Miranti, R., Septianto, R. D., Ibáñez, M., Kovalenko, M. V., Matsushita, N., Iwasa, Y., &#38; Bisri, S. Z. (2020). Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>"},"department":[{"_id":"MaIb"}],"month":"10","article_processing_charge":"No","article_type":"original","abstract":[{"text":"Research in the field of colloidal semiconductor nanocrystals (NCs) has progressed tremendously, mostly because of their exceptional optoelectronic properties. Core@shell NCs, in which one or more inorganic layers overcoat individual NCs, recently received significant attention due to their remarkable optical characteristics. Reduced Auger recombination, suppressed blinking, and enhanced carrier multiplication are among the merits of core@shell NCs. Despite their importance in device development, the influence of the shell and the surface modification of the core@shell NC assemblies on the charge carrier transport remains a pertinent research objective. Type-II PbTe@PbS core@shell NCs, in which exclusive electron transport was demonstrated, still exhibit instability of their electron \r\n ransport. Here, we demonstrate the enhancement of electron transport and stability in PbTe@PbS core@shell NC assemblies using iodide as a surface passivating ligand. The combination of the PbS shelling and the use of the iodide ligand contributes to the addition of one mobile electron for each core@shell NC. Furthermore, both electron mobility and on/off current modulation ratio values of the core@shell NC field-effect transistor are steady with the usage of iodide. Excellent stability in these exclusively electron-transporting core@shell NCs paves the way for their utilization in electronic devices. ","lang":"eng"}],"oa_version":"Published Version","issue":"17","day":"26","isi":1},{"acknowledgement":"This work was supported by the European Regional Development Funds and by the Spanish Ministerio de Economı´a y\r\nCompetitividad through the project SEHTOP (ENE2016-77798-C4-3-R). Y. Z. and X. H., thank the China Scholarship Council for scholarship support. M. C. has received funding from the European Union’s Horizon 2020 Research and Innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. M. I. acknowledges financial support from IST Austria. Y. L. acknowledges funding from the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie grant agreement no. 754411. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat \r\nAuto`noma de Barcelona Materials Science PhD program.","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1039/D0TC02182B","title":"Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks","ec_funded":1,"page":"14092-14099","external_id":{"isi":["000581559100015"]},"date_created":"2020-11-09T08:37:51Z","publication":"Journal of Materials Chemistry C","date_published":"2020-10-28T00:00:00Z","author":[{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu","full_name":"Liu, Yu","orcid":"0000-0001-7313-6740"},{"last_name":"Calcabrini","full_name":"Calcabrini, Mariano","first_name":"Mariano"},{"first_name":"Congcong","full_name":"Xing, Congcong","last_name":"Xing"},{"first_name":"Xu","full_name":"Han, Xu","last_name":"Han"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"first_name":"Doris","full_name":"Cadavid, Doris","last_name":"Cadavid"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"scopus_import":"1","language":[{"iso":"eng"}],"_id":"8747","type":"journal_article","date_updated":"2023-08-22T12:41:05Z","volume":8,"status":"public","quality_controlled":"1","year":"2020","publication_status":"published","intvolume":"         8","citation":{"apa":"Zhang, Y., Liu, Y., Calcabrini, M., Xing, C., Han, X., Arbiol, J., … Cabot, A. (2020). Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>","ieee":"Y. Zhang <i>et al.</i>, “Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks,” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40. Royal Society of Chemistry, pp. 14092–14099, 2020.","mla":"Zhang, Yu, et al. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40, Royal Society of Chemistry, 2020, pp. 14092–99, doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>.","chicago":"Zhang, Yu, Yu Liu, Mariano Calcabrini, Congcong Xing, Xu Han, Jordi Arbiol, Doris Cadavid, Maria Ibáñez, and Andreu Cabot. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry, 2020. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>.","ama":"Zhang Y, Liu Y, Calcabrini M, et al. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. 2020;8(40):14092-14099. doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>","ista":"Zhang Y, Liu Y, Calcabrini M, Xing C, Han X, Arbiol J, Cadavid D, Ibáñez M, Cabot A. 2020. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. Journal of Materials Chemistry C. 8(40), 14092–14099.","short":"Y. Zhang, Y. Liu, M. Calcabrini, C. Xing, X. Han, J. Arbiol, D. Cadavid, M. Ibáñez, A. Cabot, Journal of Materials Chemistry C 8 (2020) 14092–14099."},"publisher":"Royal Society of Chemistry","article_processing_charge":"No","department":[{"_id":"MaIb"}],"month":"10","issue":"40","day":"28","oa_version":"None","abstract":[{"text":"Appropriately designed nanocomposites allow improving the thermoelectric performance by several mechanisms, including phonon scattering, modulation doping and energy filtering, while additionally promoting better mechanical properties than those of crystalline materials. Here, a strategy for producing Bi2Te3–Cu2xTe nanocomposites based on the consolidation of heterostructured nanoparticles is described and the thermoelectric properties of the obtained materials are investigated. We first detail a two-step solution-based process to produce Bi2Te3–Cu2xTe heteronanostructures, based on the growth of Cu2xTe nanocrystals on the surface of Bi2Te3 nanowires. We characterize the structural and chemical properties of the synthesized nanostructures and of the nanocomposites\r\nproduced by hot-pressing the particles at moderate temperatures. Besides, the transport properties of the nanocomposites are investigated as a function of the amount of Cu introduced. Overall, the presence of Cu decreases the material thermal conductivity through promotion of phonon scattering, modulates the charge carrier concentration through electron spillover, and increases the Seebeck coefficient through filtering of charge carriers at energy barriers. These effects result in an improvement of over 50% of the thermoelectric figure of merit of Bi2Te3.","lang":"eng"}],"article_type":"original","isi":1},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1109/MEMOCODE51338.2020.9314994","ec_funded":1,"title":"Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions","external_id":{"arxiv":["2006.12325"],"isi":["000661920400013"]},"article_number":"9314994","publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","date_created":"2020-11-10T07:04:57Z","date_published":"2020-12-04T00:00:00Z","author":[{"last_name":"Forets","full_name":"Forets, Marcelo","first_name":"Marcelo"},{"last_name":"Freire","full_name":"Freire, Daniel","first_name":"Daniel"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"}],"scopus_import":"1","conference":{"end_date":"2020-12-04","name":"MEMOCODE: Conference on Formal Methods and Models for System Design","start_date":"2020-12-02","location":"Virtual Conference"},"language":[{"iso":"eng"}],"date_updated":"2023-08-22T12:48:18Z","_id":"8750","type":"conference","status":"public","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.12325"}],"year":"2020","oa":1,"publication_status":"published","publication_identifier":{"isbn":["9781728191485"]},"citation":{"apa":"Forets, M., Freire, D., &#38; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. Virtual Conference: IEEE. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>","ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions,” in <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, Virtual Conference, 2020.","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994.","short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020.","mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, 9314994, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>.","chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>.","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In: <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>"},"publisher":"IEEE","article_processing_charge":"No","department":[{"_id":"ToHe"}],"month":"12","arxiv":1,"day":"04","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost."}],"isi":1},{"project":[{"_id":"26927A52-B435-11E9-9278-68D0E5697425","grant_number":"F07105","name":"Integrating superconducting quantum circuits","call_identifier":"FWF"},{"call_identifier":"H2020","grant_number":"732894","name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","grant_number":"862644","name":"Quantum readout techniques and technologies","call_identifier":"H2020"},{"grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"The authors acknowledge the support from I. Prieto and the IST Nanofabrication Facility. This work was supported by IST Austria and a NOMIS foundation research grant and the Austrian Science Fund (FWF) through BeyondC (F71). MP is the recipient of a P¨ottinger scholarship at IST Austria. JMF acknowledges support from the European Union’s Horizon 2020 research and innovation programs under grant agreement No 732894 (FET Proactive HOT), 862644 (FET Open QUARTET), and the European Research Council under grant agreement\r\nnumber 758053 (ERC StG QUNNECT). ","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","article_number":"044055","date_created":"2020-11-15T23:01:17Z","publication":"Physical Review Applied","external_id":{"arxiv":["2007.01644"],"isi":["000582797300003"]},"ec_funded":1,"title":"Surpassing the resistance quantum with a geometric superinductor","doi":"10.1103/PhysRevApplied.14.044055","language":[{"iso":"eng"}],"author":[{"first_name":"Matilda","orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo"},{"first_name":"Andrea","full_name":"Trioni, Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","last_name":"Trioni"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","last_name":"Hassani","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid","first_name":"Farid"},{"full_name":"Zemlicka, Martin","first_name":"Martin","last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"scopus_import":"1","date_published":"2020-10-29T00:00:00Z","quality_controlled":"1","status":"public","volume":14,"type":"journal_article","_id":"8755","date_updated":"2024-08-07T07:11:55Z","publication_status":"published","oa":1,"ddc":["530"],"year":"2020","publisher":"American Physical Society","citation":{"short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, Physical Review Applied 14 (2020).","ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 14(4), 044055.","chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” <i>Physical Review Applied</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">https://doi.org/10.1103/PhysRevApplied.14.044055</a>.","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. <i>Physical Review Applied</i>. 2020;14(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">10.1103/PhysRevApplied.14.044055</a>","mla":"Peruzzo, Matilda, et al. “Surpassing the Resistance Quantum with a Geometric Superinductor.” <i>Physical Review Applied</i>, vol. 14, no. 4, 044055, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">10.1103/PhysRevApplied.14.044055</a>.","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor,” <i>Physical Review Applied</i>, vol. 14, no. 4. American Physical Society, 2020.","apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., &#38; Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">https://doi.org/10.1103/PhysRevApplied.14.044055</a>"},"file":[{"access_level":"open_access","file_id":"9300","checksum":"2a634abe75251ae7628cd54c8a4ce2e8","relation":"main_file","creator":"dernst","success":1,"file_name":"2020_PhysReviewApplied_Peruzzo.pdf","date_updated":"2021-03-29T11:43:20Z","content_type":"application/pdf","date_created":"2021-03-29T11:43:20Z","file_size":2607823}],"publication_identifier":{"eissn":["23317019"]},"intvolume":"        14","abstract":[{"text":"The superconducting circuit community has recently discovered the promising potential of superinductors. These circuit elements have a characteristic impedance exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of ground state charge fluctuations. Applications include the realization of hardware protected qubits for fault tolerant quantum computing, improved coupling to small dipole moment objects and defining a new quantum metrology standard for the ampere. In this work we refute the widespread notion that superinductors can only be implemented based on kinetic inductance, i.e. using disordered superconductors or Josephson junction arrays. We present modeling, fabrication and characterization of 104 planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled tunneling events and offer high reproducibility, linearity and the ability to couple magnetically - properties that significantly broaden the scope of future quantum circuits. ","lang":"eng"}],"related_material":{"record":[{"id":"13070","relation":"research_data","status":"public"},{"status":"public","relation":"dissertation_contains","id":"9920"}]},"article_type":"original","issue":"4","day":"29","oa_version":"Published Version","arxiv":1,"article_processing_charge":"No","month":"10","department":[{"_id":"JoFi"}],"file_date_updated":"2021-03-29T11:43:20Z","acknowledged_ssus":[{"_id":"NanoFab"}],"isi":1}]