[{"arxiv":1,"date_updated":"2026-07-06T12:24:07Z","publication_status":"published","day":"01","article_processing_charge":"No","ec_funded":1,"_id":"6986","year":"2019","publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"title":"A colimit of traces of reflection groups","author":[{"full_name":"Li, Penghui","last_name":"Li","id":"42A24CCC-F248-11E8-B48F-1D18A9856A87","first_name":"Penghui"}],"publication":"Proceedings of the American Mathematical Society","abstract":[{"text":"Li-Nadler proposed a conjecture about traces of Hecke categories, which implies the semistable part of the Betti geometric Langlands conjecture of Ben-Zvi-Nadler in genus 1. We prove a Weyl group analogue of this conjecture. Our theorem holds in the natural generality of reflection groups in Euclidean or hyperbolic space. As a corollary, we give an expression of the centralizer of a finite order element in a reflection group using homotopy theory. ","lang":"eng"}],"page":"4597-4604","issue":"11","article_type":"original","oa":1,"citation":{"chicago":"Li, Penghui. “A Colimit of Traces of Reflection Groups.” Proceedings of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/proc/14586.","short":"P. Li, Proceedings of the American Mathematical Society 147 (2019) 4597–4604.","ama":"Li P. A colimit of traces of reflection groups. Proceedings of the American Mathematical Society. 2019;147(11):4597-4604. doi:10.1090/proc/14586","apa":"Li, P. (2019). A colimit of traces of reflection groups. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/14586","mla":"Li, Penghui. “A Colimit of Traces of Reflection Groups.” Proceedings of the American Mathematical Society, vol. 147, no. 11, American Mathematical Society, 2019, pp. 4597–604, doi:10.1090/proc/14586.","ista":"Li P. 2019. A colimit of traces of reflection groups. Proceedings of the American Mathematical Society. 147(11), 4597–4604.","ieee":"P. Li, “A colimit of traces of reflection groups,” Proceedings of the American Mathematical Society, vol. 147, no. 11. American Mathematical Society, pp. 4597–4604, 2019."},"das_tickbox":"1","fulldoi":"https://doi.org/10.1090/proc/14586","publisher":"American Mathematical Society","isi":1,"date_created":"2019-11-04T16:10:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1090/proc/14586","scopus_import":"1","project":[{"call_identifier":"FP7","name":"Arithmetic and physics of Higgs moduli spaces","grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"TaHa"}],"status":"public","volume":147,"external_id":{"arxiv":["1810.07039"],"isi":["000488621700004"]},"language":[{"iso":"eng"}],"intvolume":" 147","date_published":"2019-11-01T00:00:00Z","type":"journal_article","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1810.07039","open_access":"1"}],"month":"11"},{"_id":"6050","year":"2019","abstract":[{"text":"We answer a question of David Hilbert: given two circles it is not possible in general to construct their centers using only a straightedge. On the other hand, we give infinitely many families of pairs of circles for which such construction is possible. ","lang":"eng"}],"page":"91-102","publication":"Proceedings of the American Mathematical Society","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"first_name":"Roman","last_name":"Fedorov","full_name":"Fedorov, Roman"}],"title":"Two circles and only a straightedge","date_updated":"2026-07-06T12:23:38Z","arxiv":1,"publication_status":"published","article_processing_charge":"No","day":"01","fulldoi":"https://doi.org/10.1090/proc/14240","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"publisher":"American Mathematical Society","date_created":"2019-02-24T22:59:19Z","citation":{"apa":"Akopyan, A., & Fedorov, R. (2019). Two circles and only a straightedge. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/14240","ama":"Akopyan A, Fedorov R. Two circles and only a straightedge. Proceedings of the American Mathematical Society. 2019;147:91-102. doi:10.1090/proc/14240","mla":"Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.” Proceedings of the American Mathematical Society, vol. 147, American Mathematical Society, 2019, pp. 91–102, doi:10.1090/proc/14240.","ista":"Akopyan A, Fedorov R. 2019. Two circles and only a straightedge. Proceedings of the American Mathematical Society. 147, 91–102.","ieee":"A. Akopyan and R. Fedorov, “Two circles and only a straightedge,” Proceedings of the American Mathematical Society, vol. 147. American Mathematical Society, pp. 91–102, 2019.","chicago":"Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.” Proceedings of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/proc/14240.","short":"A. Akopyan, R. Fedorov, Proceedings of the American Mathematical Society 147 (2019) 91–102."},"das_tickbox":"1","oa":1,"status":"public","department":[{"_id":"HeEd"}],"doi":"10.1090/proc/14240","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.02562"}],"quality_controlled":"1","month":"01","volume":147,"external_id":{"isi":["000450363900008"],"arxiv":["1709.02562"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","intvolume":" 147","type":"journal_article","date_published":"2019-01-01T00:00:00Z"},{"status":"public","has_accepted_license":"1","department":[{"_id":"JoDa"}],"doi":"10.3389/fchem.2018.00655","scopus_import":"1","ddc":["540"],"file":[{"file_size":1766820,"relation":"main_file","file_id":"6039","access_level":"open_access","date_created":"2019-02-18T15:10:34Z","date_updated":"2020-07-14T12:47:17Z","file_name":"2019_frontiers_Lindner.pdf","content_type":"application/pdf","checksum":"7841301d7c53b56ef873791b4b6f7b24","creator":"dernst"}],"quality_controlled":"1","month":"01","external_id":{"isi":["000456718000001"]},"volume":6,"language":[{"iso":"eng"}],"oa_version":"Published Version","intvolume":" 6","type":"journal_article","date_published":"2019-01-24T00:00:00Z","publication_identifier":{"eissn":["2296-2646"]},"_id":"6029","year":"2019","abstract":[{"text":"Protein micropatterning has become an important tool for many biomedical applications as well as in academic research. Current techniques that allow to reduce the feature size of patterns below 1 μm are, however, often costly and require sophisticated equipment. We present here a straightforward and convenient method to generate highly condensed nanopatterns of proteins without the need for clean room facilities or expensive equipment. Our approach is based on nanocontact printing and allows for the fabrication of protein patterns with feature sizes of 80 nm and periodicities down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane) (X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle, different proteins at various scales were printed and the pattern quality was evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy.","lang":"eng"}],"title":"A fast and simple contact printing approach to generate 2D protein nanopatterns","publication":"Frontiers in Chemistry","author":[{"first_name":"Marco","last_name":"Lindner","full_name":"Lindner, Marco"},{"last_name":"Tresztenyak","full_name":"Tresztenyak, Aliz","first_name":"Aliz"},{"full_name":"Fülöp, Gergö","last_name":"Fülöp","first_name":"Gergö"},{"last_name":"Jahr","full_name":"Jahr, Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","first_name":"Wiebke","orcid":"0000-0003-0201-2315"},{"first_name":"Adrian","last_name":"Prinz","full_name":"Prinz, Adrian"},{"last_name":"Prinz","full_name":"Prinz, Iris","first_name":"Iris"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","last_name":"Danzl"},{"full_name":"Schütz, Gerhard J.","last_name":"Schütz","first_name":"Gerhard J."},{"full_name":"Sevcsik, Eva","last_name":"Sevcsik","first_name":"Eva"}],"date_updated":"2026-07-06T13:03:56Z","publication_status":"published","article_processing_charge":"No","day":"24","fulldoi":"https://doi.org/10.3389/fchem.2018.00655","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Frontiers Media","isi":1,"date_created":"2019-02-17T22:59:24Z","citation":{"chicago":"Lindner, Marco, Aliz Tresztenyak, Gergö Fülöp, Wiebke Jahr, Adrian Prinz, Iris Prinz, Johann G Danzl, Gerhard J. Schütz, and Eva Sevcsik. “A Fast and Simple Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in Chemistry. Frontiers Media, 2019. https://doi.org/10.3389/fchem.2018.00655.","short":"M. Lindner, A. Tresztenyak, G. Fülöp, W. Jahr, A. Prinz, I. Prinz, J.G. Danzl, G.J. Schütz, E. Sevcsik, Frontiers in Chemistry 6 (2019).","ista":"Lindner M, Tresztenyak A, Fülöp G, Jahr W, Prinz A, Prinz I, Danzl JG, Schütz GJ, Sevcsik E. 2019. A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 6, 655.","mla":"Lindner, Marco, et al. “A Fast and Simple Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in Chemistry, vol. 6, 655, Frontiers Media, 2019, doi:10.3389/fchem.2018.00655.","apa":"Lindner, M., Tresztenyak, A., Fülöp, G., Jahr, W., Prinz, A., Prinz, I., … Sevcsik, E. (2019). A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. Frontiers Media. https://doi.org/10.3389/fchem.2018.00655","ama":"Lindner M, Tresztenyak A, Fülöp G, et al. A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 2019;6. doi:10.3389/fchem.2018.00655","ieee":"M. Lindner et al., “A fast and simple contact printing approach to generate 2D protein nanopatterns,” Frontiers in Chemistry, vol. 6. Frontiers Media, 2019."},"file_date_updated":"2020-07-14T12:47:17Z","das_tickbox":"1","article_number":"655","oa":1},{"ddc":["530"],"file":[{"file_size":1309966,"relation":"main_file","access_level":"open_access","file_id":"5896","date_created":"2019-01-29T08:32:57Z","date_updated":"2020-07-14T12:47:13Z","file_name":"2019_MolecularPhysics_Li.pdf","content_type":"application/pdf","creator":"dernst","checksum":"178964744b636a6f036372f4f090a657"}],"quality_controlled":"1","month":"01","external_id":{"isi":["000474641400008"]},"language":[{"iso":"eng"}],"oa_version":"Published Version","date_published":"2019-01-18T00:00:00Z","type":"journal_article","has_accepted_license":"1","status":"public","project":[{"name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","call_identifier":"FWF"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"department":[{"_id":"MiLe"}],"doi":"10.1080/00268976.2019.1567852","related_material":{"record":[{"relation":"dissertation_contains","id":"8958","status":"public"}]},"scopus_import":"1","fulldoi":"https://doi.org/10.1080/00268976.2019.1567852","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Taylor & Francis","isi":1,"date_created":"2019-01-27T22:59:10Z","citation":{"ieee":"X. Li, G. Bighin, E. Yakaboylu, and M. Lemeshko, “Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon,” Molecular Physics. Taylor & Francis, 2019.","ista":"Li X, Bighin G, Yakaboylu E, Lemeshko M. 2019. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics.","ama":"Li X, Bighin G, Yakaboylu E, Lemeshko M. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. 2019. doi:10.1080/00268976.2019.1567852","apa":"Li, X., Bighin, G., Yakaboylu, E., & Lemeshko, M. (2019). Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2019.1567852","mla":"Li, Xiang, et al. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics, Taylor & Francis, 2019, doi:10.1080/00268976.2019.1567852.","short":"X. Li, G. Bighin, E. Yakaboylu, M. Lemeshko, Molecular Physics (2019).","chicago":"Li, Xiang, Giacomo Bighin, Enderalp Yakaboylu, and Mikhail Lemeshko. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics. Taylor & Francis, 2019. https://doi.org/10.1080/00268976.2019.1567852."},"das_tickbox":"1","file_date_updated":"2020-07-14T12:47:13Z","oa":1,"publication_identifier":{"issn":["0026-8976"]},"year":"2019","_id":"5886","abstract":[{"text":"Problems involving quantum impurities, in which one or a few particles are interacting with a macroscopic environment, represent a pervasive paradigm, spanning across atomic, molecular, and condensed-matter physics. In this paper we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron–a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon–a quasiparticle formed out of a rotating molecule in a bosonic bath. We benchmark these approaches against established theories, evaluating their accuracy as a function of the impurity-bath coupling.","lang":"eng"}],"author":[{"id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","first_name":"Xiang","last_name":"Li","full_name":"Li, Xiang"},{"last_name":"Bighin","full_name":"Bighin, Giacomo","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777"},{"first_name":"Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","last_name":"Yakaboylu","full_name":"Yakaboylu, Enderalp"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"}],"title":"Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon","publication":"Molecular Physics","date_updated":"2026-07-07T05:31:10Z","ec_funded":1,"publication_status":"published","day":"18","article_processing_charge":"No"},{"publication_status":"published","article_processing_charge":"No","day":"01","date_updated":"2026-07-07T05:33:54Z","title":"Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone","author":[{"last_name":"Andalo","full_name":"Andalo, Christophe","first_name":"Christophe"},{"last_name":"Burrus","full_name":"Burrus, Monique","first_name":"Monique"},{"last_name":"Paute","full_name":"Paute, Sandrine","first_name":"Sandrine"},{"first_name":"Christine","last_name":"Lauzeral","full_name":"Lauzeral, Christine"},{"full_name":"Field, David","last_name":"Field","orcid":"0000-0002-4014-8478","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"}],"publication":"Botany Letters","abstract":[{"text":"Pollinators display a remarkable diversity of foraging strategies with flowering plants, from primarily mutualistic interactions to cheating through nectar robbery. Despite numerous studies on the effect of nectar robbing on components of plant fitness, its contribution to reproductive isolation is unclear. We experimentally tested the impact of different pollinator strategies in a natural hybrid zone between two subspecies of Antirrhinum majus with alternate flower colour guides. On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus (magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral visitors at different time points during the flowering season. Using long-run camera surveys, we quantify the impact of nectar robbing on the number of flowers visited per inflorescence and the flower probing time. We further experimentally tested the effect of nectar robbing on female reproductive success by manipulating the intensity of robbing. While robbing increased over time the number of legitimate visitors tended to decrease concomitantly. We found that the number of flowers pollinated on a focal inflorescence decreased with the number of prior robbing events. However, in the manipulative experiment, fruit set and fruit volume did not vary significantly between low robbing and control treatments. Our findings challenge the idea that robbers have a negative impact on plant fitness through female function. This study also adds to our understanding of the components of pollinator-mediated reproductive isolation and the maintenance of Antirrhinum hybrid zones.","lang":"eng"}],"page":"80-92","_id":"5680","year":"2019","publication_identifier":{"eissn":["2381-8115"],"issn":["2381-8107"]},"citation":{"ista":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 166(1), 80–92.","mla":"Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany Letters, vol. 166, no. 1, Taylor & Francis, 2019, pp. 80–92, doi:10.1080/23818107.2018.1545142.","apa":"Andalo, C., Burrus, M., Paute, S., Lauzeral, C., & Field, D. (2019). Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. Taylor & Francis. https://doi.org/10.1080/23818107.2018.1545142","ama":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 2019;166(1):80-92. doi:10.1080/23818107.2018.1545142","ieee":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone,” Botany Letters, vol. 166, no. 1. Taylor & Francis, pp. 80–92, 2019.","short":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166 (2019) 80–92.","chicago":"Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral, and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany Letters. Taylor & Francis, 2019. https://doi.org/10.1080/23818107.2018.1545142."},"das_tickbox":"1","issue":"1","publisher":"Taylor & Francis","isi":1,"date_created":"2018-12-16T22:59:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1080/23818107.2018.1545142","scopus_import":"1","doi":"10.1080/23818107.2018.1545142","department":[{"_id":"NiBa"}],"status":"public","intvolume":" 166","date_published":"2019-01-01T00:00:00Z","type":"journal_article","oa_version":"None","external_id":{"isi":["000463802800009"]},"volume":166,"language":[{"iso":"eng"}],"month":"01","quality_controlled":"1"},{"_id":"6657","year":"2019","publication_identifier":{"eissn":["1022-2588"]},"title":"An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors","author":[{"first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","last_name":"Danowski","full_name":"Danowski, Patrick"}],"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","page":"59-65","abstract":[{"text":"In this article a model is described how Open Access definitions can be formed on the basis of objective criteria. The common Open Access definitions such as \"gold\" and \"green\" are not exactly defined. This becomes a problem as soon as one begins to measure Open Access, for example if the development of the Open Access share should be monitored. This was discussed in the working group on Open Access Monitoring of the AT2OA project and the present model was developed, which is based on 5 critics with 4 characteristics: location, licence, version, embargo and conditions of the Open Access publication are taken into account. In the meantime, the model has also been tested in practice using R scripts, and the initial results are quite promising.","lang":"eng"}],"date_updated":"2026-07-07T06:28:30Z","day":"17","article_processing_charge":"No","publication_status":"published","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.31263/voebm.v72i1.2276","date_created":"2019-07-21T21:59:15Z","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","issue":"1","oa":1,"file_date_updated":"2020-07-14T12:47:35Z","citation":{"short":"P. Danowski, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 72 (2019) 59–65.","chicago":"Danowski, Patrick. “An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019. https://doi.org/10.31263/voebm.v72i1.2276.","mla":"Danowski, Patrick. “An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol. 72, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019, pp. 59–65, doi:10.31263/voebm.v72i1.2276.","ama":"Danowski P. An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2019;72(1):59-65. doi:10.31263/voebm.v72i1.2276","apa":"Danowski, P. (2019). An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v72i1.2276","ista":"Danowski P. 2019. An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 72(1), 59–65.","ieee":"P. Danowski, “An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 72, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 59–65, 2019."},"corr_author":"1","department":[{"_id":"E-Lib"}],"has_accepted_license":"1","status":"public","related_material":{"record":[{"status":"public","id":"5686","relation":"earlier_version"}]},"doi":"10.31263/voebm.v72i1.2276","scopus_import":"1","quality_controlled":"1","file":[{"checksum":"c0d2695d6d0d34e62ba06fb3f0ebaaed","creator":"apreinsp","content_type":"application/pdf","file_name":"2019_MitteilungenDerVOEB_Danowski.pdf","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-22T08:45:03Z","file_id":"6661","access_level":"open_access","relation":"main_file","file_size":468558}],"ddc":["020"],"month":"05","language":[{"iso":"eng"}],"volume":72,"type":"journal_article","date_published":"2019-05-17T00:00:00Z","intvolume":" 72","oa_version":"Published Version"},{"date_updated":"2026-07-07T13:29:21Z","article_processing_charge":"No","day":"06","publication_status":"published","alternative_title":["LNCS"],"_id":"6822","year":"2019","conference":{"end_date":"2019-09-13","start_date":"2019-09-11","location":"Brussels, Belgium","name":"RP: Reachability Problems"},"publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]},"title":"Bidding games on Markov decision processes","author":[{"last_name":"Avni","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr"}],"publication":"Proceedings of the 13th International Conference of Reachability Problems","page":"1-12","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"oa":1,"file_date_updated":"2020-07-14T12:47:41Z","das_tickbox":"1","citation":{"ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12."},"fulldoi":"https://doi.org/10.1007/978-3-030-30806-3_1","date_created":"2019-08-19T07:58:10Z","publisher":"Springer","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-030-30806-3_1","scopus_import":"1","department":[{"_id":"ToHe"}],"project":[{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"volume":11674,"external_id":{"isi":["001333747500001"]},"date_published":"2019-09-06T00:00:00Z","type":"conference","intvolume":" 11674","oa_version":"Submitted Version","quality_controlled":"1","file":[{"relation":"main_file","file_size":436635,"date_created":"2019-08-19T07:56:40Z","access_level":"open_access","file_id":"6823","file_name":"prob.pdf","date_updated":"2020-07-14T12:47:41Z","creator":"gavni","checksum":"45ebbc709af2b247d28c7c293c01504b","content_type":"application/pdf"}],"ddc":["000"],"month":"09"},{"doi":"10.4230/LIPICS.ITCS.2019.60","scopus_import":"1","status":"public","has_accepted_license":"1","department":[{"_id":"KrPi"}],"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"language":[{"iso":"eng"}],"volume":124,"external_id":{"cryptoeprintid":["2018/627"]},"oa_version":"Published Version","type":"conference","date_published":"2019-01-10T00:00:00Z","intvolume":" 124","file":[{"content_type":"application/pdf","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","creator":"dernst","date_updated":"2020-07-14T12:47:33Z","file_name":"2019_LIPIcs_Pietrzak.pdf","file_id":"6529","access_level":"open_access","date_created":"2019-06-06T14:22:04Z","file_size":558770,"relation":"main_file"}],"ddc":["000"],"quality_controlled":"1","month":"01","date_updated":"2026-07-07T13:31:01Z","ec_funded":1,"article_processing_charge":"No","day":"10","publication_status":"published","publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"year":"2019","_id":"6528","conference":{"location":"San Diego, CA, United States","name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2019-01-10","end_date":"2019-01-12"},"abstract":[{"text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism.","lang":"eng"}],"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"cryptoeprintid":1,"title":"Simple verifiable delay functions","publication":"10th Innovations in Theoretical Computer Science Conference","das_tickbox":"1","file_date_updated":"2020-07-14T12:47:33Z","citation":{"chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124."},"oa":1,"article_number":"60","fulldoi":"https://doi.org/10.4230/LIPICS.ITCS.2019.60","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-06-06T14:12:36Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"date_created":"2020-01-29T16:17:05Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.4230/LIPICS.SOCG.2019.39","oa":1,"article_number":"39","file_date_updated":"2020-07-14T12:47:57Z","das_tickbox":"1","citation":{"ieee":"R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129.","mla":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry, vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.","ama":"Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39","apa":"Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39","ista":"Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.","chicago":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” In 35th International Symposium on Computational Geometry, Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.","short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"publication":"35th International Symposium on Computational Geometry","author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kyncl, Jan","last_name":"Kyncl","first_name":"Jan"}],"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","abstract":[{"text":"The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. ","lang":"eng"}],"alternative_title":["LIPIcs"],"year":"2019","_id":"7401","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Portland, OR, United States","end_date":"2019-06-21","start_date":"2019-06-18"},"publication_identifier":{"isbn":["978-3-95977-104-7"],"issn":["1868-8969"]},"day":"01","article_processing_charge":"No","publication_status":"published","arxiv":1,"date_updated":"2026-07-07T13:41:10Z","month":"06","quality_controlled":"1","file":[{"relation":"main_file","file_size":628347,"date_created":"2020-02-04T09:14:31Z","file_id":"7445","access_level":"open_access","file_name":"2019_LIPIcs_Fulek.pdf","date_updated":"2020-07-14T12:47:57Z","checksum":"aac37b09118cc0ab58cf77129e691f8c","creator":"dernst","content_type":"application/pdf"}],"ddc":["000"],"type":"conference","date_published":"2019-06-01T00:00:00Z","intvolume":" 129","oa_version":"Published Version","language":[{"iso":"eng"}],"external_id":{"arxiv":["1903.08637"]},"volume":129,"department":[{"_id":"UlWa"}],"project":[{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"status":"public","has_accepted_license":"1","corr_author":"1","scopus_import":"1","doi":"10.4230/LIPICS.SOCG.2019.39"},{"isi":1,"publisher":"IMLS","date_created":"2020-02-02T23:01:06Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, IMLS, 2019, pp. 12481–12512.","chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, 2019–June:12481–512. IMLS, 2019.","ieee":"C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In 36th International Conference on Machine Learning (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning. Vol 2019-June. IMLS; 2019:12481-12512.","mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, vol. 2019–June, IMLS, 2019, pp. 12481–512.","ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512."},"das_tickbox":"1","author":[{"last_name":"Yu","full_name":"Yu, Chen","first_name":"Chen"},{"first_name":"Hanlin","full_name":"Tang, Hanlin","last_name":"Tang"},{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"},{"first_name":"Simon","last_name":"Kassing","full_name":"Kassing, Simon"},{"full_name":"Singla, Ankit","last_name":"Singla","first_name":"Ankit"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Zhang, Ce","last_name":"Zhang","first_name":"Ce"},{"first_name":"Ji","last_name":"Liu","full_name":"Liu, Ji"}],"title":"Distributed learning over unreliable networks","publication":"36th International Conference on Machine Learning","abstract":[{"lang":"eng","text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable."}],"page":"12481-12512","_id":"7437","year":"2019","conference":{"location":"Long Beach, CA, United States","name":"ICML: International Conference on Machine Learning","end_date":"2019-06-15","start_date":"2019-06-10"},"publication_identifier":{"isbn":["9781510886988"]},"publication_status":"published","article_processing_charge":"No","day":"01","date_updated":"2026-07-07T13:41:57Z","arxiv":1,"month":"06","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1810.07766","open_access":"1"}],"date_published":"2019-06-01T00:00:00Z","type":"conference","oa_version":"Preprint","volume":"2019-June","external_id":{"isi":["000684034307036"],"arxiv":["1810.07766"]},"language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"status":"public","scopus_import":"1"},{"quality_controlled":"1","ddc":["000"],"file":[{"file_name":"2019_EPiCs_Frehse.pdf","date_updated":"2022-05-17T06:55:49Z","creator":"dernst","checksum":"4b92e333db7b4e2349501a804dfede69","content_type":"application/pdf","relation":"main_file","file_size":346415,"date_created":"2022-05-17T06:55:49Z","access_level":"open_access","file_id":"11391","success":1}],"month":"05","volume":61,"language":[{"iso":"eng"}],"intvolume":" 61","date_published":"2019-05-25T00:00:00Z","type":"conference","oa_version":"Published Version","department":[{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","editor":[{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"first_name":"Matthias","full_name":"Althoff, Matthias","last_name":"Althoff"}],"doi":"10.29007/rjwn","scopus_import":"1","fulldoi":"https://doi.org/10.29007/rjwn","acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","publisher":"EasyChair","date_created":"2022-03-18T12:29:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.","ieee":"G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol. 61, pp. 1–13.","ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse & M. Althoff (Eds.), 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn"},"das_tickbox":"1","file_date_updated":"2022-05-17T06:55:49Z","_id":"10877","year":"2019","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","location":"Montreal, Canada","end_date":"2019-04-15","start_date":"2019-04-15"},"alternative_title":["EPiC Series in Computing"],"publication_identifier":{"issn":["2398-7340"]},"publication":"6th International Workshop on Applied Verification of Continuous and Hybrid Systems","title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"first_name":"Dieky","last_name":"Adzkiya","full_name":"Adzkiya, Dieky"},{"full_name":"Becchi, Anna","last_name":"Becchi","first_name":"Anna"},{"full_name":"Bu, Lei","last_name":"Bu","first_name":"Lei"},{"first_name":"Alessandro","last_name":"Cimatti","full_name":"Cimatti, Alessandro"},{"orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","full_name":"Giacobbe, Mirco"},{"first_name":"Alberto","full_name":"Griggio, Alberto","last_name":"Griggio"},{"first_name":"Sergio","full_name":"Mover, Sergio","last_name":"Mover"},{"last_name":"Mufid","full_name":"Mufid, Muhammad Syifa'ul","first_name":"Muhammad Syifa'ul"},{"full_name":"Riouak, Idriss","last_name":"Riouak","first_name":"Idriss"},{"first_name":"Stefano","last_name":"Tonetta","full_name":"Tonetta, Stefano"},{"last_name":"Zaffanella","full_name":"Zaffanella, Enea","first_name":"Enea"}],"abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date."}],"page":"1-13","date_updated":"2026-07-08T06:37:19Z","publication_status":"published","article_processing_charge":"No","day":"25"},{"fulldoi":"https://doi.org/10.1214/18-AIHP894","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-04-08T14:05:04Z","publisher":"Institut Henri Poincaré","isi":1,"issue":"2","das_tickbox":"1","citation":{"chicago":"Alt, Johannes, László Erdös, Torben H Krüger, and Yuriy Nemish. “Location of the Spectrum of Kronecker Random Matrices.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institut Henri Poincaré, 2019. https://doi.org/10.1214/18-AIHP894.","short":"J. Alt, L. Erdös, T.H. Krüger, Y. Nemish, Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 55 (2019) 661–696.","ista":"Alt J, Erdös L, Krüger TH, Nemish Y. 2019. Location of the spectrum of Kronecker random matrices. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 55(2), 661–696.","ama":"Alt J, Erdös L, Krüger TH, Nemish Y. Location of the spectrum of Kronecker random matrices. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 2019;55(2):661-696. doi:10.1214/18-AIHP894","mla":"Alt, Johannes, et al. “Location of the Spectrum of Kronecker Random Matrices.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, no. 2, Institut Henri Poincaré, 2019, pp. 661–96, doi:10.1214/18-AIHP894.","apa":"Alt, J., Erdös, L., Krüger, T. H., & Nemish, Y. (2019). Location of the spectrum of Kronecker random matrices. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institut Henri Poincaré. https://doi.org/10.1214/18-AIHP894","ieee":"J. Alt, L. Erdös, T. H. Krüger, and Y. Nemish, “Location of the spectrum of Kronecker random matrices,” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, no. 2. Institut Henri Poincaré, pp. 661–696, 2019."},"oa":1,"publication_identifier":{"issn":["0246-0203"]},"year":"2019","_id":"6240","page":"661-696","abstract":[{"text":"For a general class of large non-Hermitian random block matrices X we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization of X as the self-consistent approximation of the pseudospectrum. We demonstrate that the analysis of the matrix Dyson equation from (Probab. Theory Related Fields (2018)) offers a unified treatment of many structured matrix ensembles.","lang":"eng"}],"publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","author":[{"first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","full_name":"Alt, Johannes"},{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0002-4821-3297","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","last_name":"Krüger"},{"first_name":"Yuriy","id":"4D902E6A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7327-856X","last_name":"Nemish","full_name":"Nemish, Yuriy"}],"title":"Location of the spectrum of Kronecker random matrices","date_updated":"2026-07-08T06:17:16Z","arxiv":1,"ec_funded":1,"day":"01","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1706.08343","open_access":"1"}],"month":"05","language":[{"iso":"eng"}],"volume":55,"external_id":{"isi":["000467793600003"],"arxiv":["1706.08343"]},"oa_version":"Preprint","date_published":"2019-05-01T00:00:00Z","type":"journal_article","intvolume":" 55","status":"public","department":[{"_id":"LaEr"}],"project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"}]},"doi":"10.1214/18-AIHP894","scopus_import":"1"},{"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"_id":"6756","year":"2019","abstract":[{"lang":"eng","text":"We study the topology generated by the temperature fluctuations of the cosmic microwave background (CMB) radiation, as quantified by the number of components and holes, formally given by the Betti numbers, in the growing excursion sets. We compare CMB maps observed by the Planck satellite with a thousand simulated maps generated according to the ΛCDM paradigm with Gaussian distributed fluctuations. The comparison is multi-scale, being performed on a sequence of degraded maps with mean pixel separation ranging from 0.05 to 7.33°. The survey of the CMB over 𝕊2 is incomplete due to obfuscation effects by bright point sources and other extended foreground objects like our own galaxy. To deal with such situations, where analysis in the presence of “masks” is of importance, we introduce the concept of relative homology. The parametric χ2-test shows differences between observations and simulations, yielding p-values at percent to less than permil levels roughly between 2 and 7°, with the difference in the number of components and holes peaking at more than 3σ sporadically at these scales. The highest observed deviation between the observations and simulations for b0 and b1 is approximately between 3σ and 4σ at scales of 3–7°. There are reports of mildly unusual behaviour of the Euler characteristic at 3.66° in the literature, computed from independent measurements of the CMB temperature fluctuations by Planck’s predecessor, the Wilkinson Microwave Anisotropy Probe (WMAP) satellite. The mildly anomalous behaviour of the Euler characteristic is phenomenologically related to the strongly anomalous behaviour of components and holes, or the zeroth and first Betti numbers, respectively. Further, since these topological descriptors show consistent anomalous behaviour over independent measurements of Planck and WMAP, instrumental and systematic errors may be an unlikely source. These are also the scales at which the observed maps exhibit low variance compared to the simulations, and approximately the range of scales at which the power spectrum exhibits a dip with respect to the theoretical model. Non-parametric tests show even stronger differences at almost all scales. Crucially, Gaussian simulations based on power-spectrum matching the characteristics of the observed dipped power spectrum are not able to resolve the anomaly. Understanding the origin of the anomalies in the CMB, whether cosmological in nature or arising due to late-time effects, is an extremely challenging task. Regardless, beyond the trivial possibility that this may still be a manifestation of an extreme Gaussian case, these observations, along with the super-horizon scales involved, may motivate the study of primordial non-Gaussianity. Alternative scenarios worth exploring may be models with non-trivial topology, including topological defect models."}],"author":[{"first_name":"Pratyush","last_name":"Pranav","full_name":"Pranav, Pratyush"},{"first_name":"Robert J.","last_name":"Adler","full_name":"Adler, Robert J."},{"first_name":"Thomas","full_name":"Buchert, Thomas","last_name":"Buchert"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Jones","full_name":"Jones, Bernard J.T.","first_name":"Bernard J.T."},{"first_name":"Armin","full_name":"Schwartzman, Armin","last_name":"Schwartzman"},{"first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0009-9111-8429","full_name":"Wagner, Hubert","last_name":"Wagner"},{"last_name":"Van De Weygaert","full_name":"Van De Weygaert, Rien","first_name":"Rien"}],"publication":"Astronomy & Astrophysics","title":"Unexpected topology of the temperature fluctuations in the cosmic microwave background","date_updated":"2026-07-08T06:46:14Z","arxiv":1,"article_processing_charge":"No","day":"17","publication_status":"published","fulldoi":"https://doi.org/10.1051/0004-6361/201834916","acknowledgement":"PP is grateful to Julian Borill from the Planck consortium for providing the data, and for the illuminating discussions and inputs. PP also thanks Hans Kristen Eriksen, Anne Ducout, and Francois R. Bouchet for significantly helpful discussions at various stages. The authors collectively thank the anonymous referee for the invaluable comments and suggestions that have added significant value to the contents of the manuscript. PP and RA acknowledge the support of ERC advanced grant Understanding Random Systems through Algebraic Topology (URSAT) (no: 320422, PI: RA). This work is also part of a project that has received funding for PP and TB from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement ERC advanced grant 740021– Advances in Research on THeories of the dark UniverSe (ARTHUS), PI: TB). HE and HW acknowledge the support by the Office of Naval Research, through grant N62909-18-1-2038, and by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics”, through grant I02979-N35 of the Austrian Science Fund (FWF). PP acknowledges the support and use of resources at the NERSC computing center.","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-08-04T21:59:18Z","publisher":"EDP Sciences","isi":1,"article_type":"original","das_tickbox":"1","file_date_updated":"2020-07-14T12:47:39Z","citation":{"chicago":"Pranav, Pratyush, Robert J. Adler, Thomas Buchert, Herbert Edelsbrunner, Bernard J.T. Jones, Armin Schwartzman, Hubert Wagner, and Rien Van De Weygaert. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy & Astrophysics. EDP Sciences, 2019. https://doi.org/10.1051/0004-6361/201834916.","short":"P. Pranav, R.J. Adler, T. Buchert, H. Edelsbrunner, B.J.T. Jones, A. Schwartzman, H. Wagner, R. Van De Weygaert, Astronomy & Astrophysics 627 (2019).","ista":"Pranav P, Adler RJ, Buchert T, Edelsbrunner H, Jones BJT, Schwartzman A, Wagner H, Van De Weygaert R. 2019. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy & Astrophysics. 627, A163.","ama":"Pranav P, Adler RJ, Buchert T, et al. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy & Astrophysics. 2019;627. doi:10.1051/0004-6361/201834916","mla":"Pranav, Pratyush, et al. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy & Astrophysics, vol. 627, A163, EDP Sciences, 2019, doi:10.1051/0004-6361/201834916.","apa":"Pranav, P., Adler, R. J., Buchert, T., Edelsbrunner, H., Jones, B. J. T., Schwartzman, A., … Van De Weygaert, R. (2019). Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201834916","ieee":"P. Pranav et al., “Unexpected topology of the temperature fluctuations in the cosmic microwave background,” Astronomy & Astrophysics, vol. 627. EDP Sciences, 2019."},"oa":1,"article_number":"A163","has_accepted_license":"1","status":"public","department":[{"_id":"HeEd"}],"OA_place":"publisher","project":[{"_id":"265683E4-B435-11E9-9278-68D0E5697425","grant_number":"M62909-18-1-2038","name":"Toward Computational Information Topology"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"doi":"10.1051/0004-6361/201834916","scopus_import":"1","file":[{"date_updated":"2020-07-14T12:47:39Z","file_name":"2019_AstronomyAstrophysics_Pranav.pdf","content_type":"application/pdf","checksum":"83b9209ed9eefbdcefd89019c5a97805","creator":"dernst","file_size":14420451,"relation":"main_file","file_id":"6766","access_level":"open_access","date_created":"2019-08-05T08:08:59Z"}],"ddc":["520","530"],"OA_type":"hybrid","quality_controlled":"1","month":"07","language":[{"iso":"eng"}],"external_id":{"isi":["000475839300003"],"arxiv":["1812.07678"]},"volume":627,"oa_version":"Published Version","type":"journal_article","date_published":"2019-07-17T00:00:00Z","intvolume":" 627"},{"title":"Soficity and variations on Higman’s group","author":[{"last_name":"Kassabov","full_name":"Kassabov, Martin","first_name":"Martin"},{"first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697","full_name":"Kuperberg, Vivian Zieve","last_name":"Kuperberg"},{"last_name":"Riley","full_name":"Riley, Timothy R.","first_name":"Timothy R."}],"publication":"Journal of Combinatorial Algebra","page":"41-70","abstract":[{"lang":"eng","text":"A group is sofic when every finite subset can be well approximated in a finite symmetric group. No example of a non-sofic group is known. Higman's group, which is a circular amalgamation of four copies of the Baumslag–Solitar group, is a candidate. Here we contribute to the discussion of the problem of its soficity in two ways.\r\nWe construct variations on Higman's group replacing the Baumslag–Solitar group by other groups G. We give an elementary condition on G enjoyed for example by Z≀Z and the integral Heisenberg group, under which the resulting group is sofic.\r\n\r\nWe then use soficity to deduce that there exist permutations of Z/nZ that are seemingly pathological in that they have order dividing four and yet locally they behave like exponential functions over most of their domains. Our approach is based on that of Helfgott and Juschenko, who recently showed the soficity of Higman's group would imply some the existence of some similarly pathological functions. Our results call into question their suggestion that this might be a step towards proving the existence of a non-sofic group."}],"year":"2019","_id":"22205","publication_identifier":{"eissn":["2415-6302"]},"day":"01","article_processing_charge":"No","publication_status":"published","extern":"1","arxiv":1,"date_updated":"2026-07-14T11:54:52Z","date_created":"2026-06-29T13:01:27Z","publisher":"European Mathematical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.4171/jca/26","oa":1,"citation":{"ista":"Kassabov M, Kuperberg VZ, Riley TR. 2019. Soficity and variations on Higman’s group. Journal of Combinatorial Algebra. 3(1), 41–70.","apa":"Kassabov, M., Kuperberg, V. Z., & Riley, T. R. (2019). Soficity and variations on Higman’s group. Journal of Combinatorial Algebra. European Mathematical Society. https://doi.org/10.4171/jca/26","ama":"Kassabov M, Kuperberg VZ, Riley TR. Soficity and variations on Higman’s group. Journal of Combinatorial Algebra. 2019;3(1):41-70. doi:10.4171/jca/26","mla":"Kassabov, Martin, et al. “Soficity and Variations on Higman’s Group.” Journal of Combinatorial Algebra, vol. 3, no. 1, European Mathematical Society, 2019, pp. 41–70, doi:10.4171/jca/26.","ieee":"M. Kassabov, V. Z. Kuperberg, and T. R. Riley, “Soficity and variations on Higman’s group,” Journal of Combinatorial Algebra, vol. 3, no. 1. European Mathematical Society, pp. 41–70, 2019.","short":"M. Kassabov, V.Z. Kuperberg, T.R. Riley, Journal of Combinatorial Algebra 3 (2019) 41–70.","chicago":"Kassabov, Martin, Vivian Zieve Kuperberg, and Timothy R. Riley. “Soficity and Variations on Higman’s Group.” Journal of Combinatorial Algebra. European Mathematical Society, 2019. https://doi.org/10.4171/jca/26."},"article_type":"original","issue":"1","OA_place":"repository","status":"public","scopus_import":"1","doi":"10.4171/jca/26","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.04174"}],"quality_controlled":"1","OA_type":"green","type":"journal_article","date_published":"2019-02-01T00:00:00Z","intvolume":" 3","oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2406.04174"]},"volume":3},{"citation":{"ista":"Fernández-Rico C, Yanagishima T, Curran A, Aarts DGAL, Dullens RPA. 2019. Synthesis of colloidal SU‐8 polymer rods using sonication. Advanced Materials. 31(17), 1807514.","apa":"Fernández-Rico, C., Yanagishima, T., Curran, A., Aarts, D. G. A. L., & Dullens, R. P. A. (2019). Synthesis of colloidal SU‐8 polymer rods using sonication. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201807514","ama":"Fernández-Rico C, Yanagishima T, Curran A, Aarts DGAL, Dullens RPA. Synthesis of colloidal SU‐8 polymer rods using sonication. Advanced Materials. 2019;31(17). doi:10.1002/adma.201807514","mla":"Fernández-Rico, Carla, et al. “Synthesis of Colloidal SU‐8 Polymer Rods Using Sonication.” Advanced Materials, vol. 31, no. 17, 1807514, Wiley, 2019, doi:10.1002/adma.201807514.","ieee":"C. Fernández-Rico, T. Yanagishima, A. Curran, D. G. A. L. Aarts, and R. P. A. Dullens, “Synthesis of colloidal SU‐8 polymer rods using sonication,” Advanced Materials, vol. 31, no. 17. Wiley, 2019.","chicago":"Fernández-Rico, Carla, Taiki Yanagishima, Arran Curran, Dirk G. A. L. Aarts, and Roel P. A. Dullens. “Synthesis of Colloidal SU‐8 Polymer Rods Using Sonication.” Advanced Materials. Wiley, 2019. https://doi.org/10.1002/adma.201807514.","short":"C. Fernández-Rico, T. Yanagishima, A. Curran, D.G.A.L. Aarts, R.P.A. Dullens, Advanced Materials 31 (2019)."},"article_number":"1807514","oa":1,"license":"https://creativecommons.org/licenses/by-nc/4.0/","issue":"17","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","date_created":"2026-06-30T06:30:50Z","fulldoi":"https://doi.org/10.1002/adma.201807514","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"extern":"1","publication_status":"published","article_processing_charge":"No","day":"25","date_updated":"2026-07-15T06:22:53Z","abstract":[{"text":"The bulk synthesis of fluorescent colloidal SU‐8 polymer rods with tunable dimensions is described. The colloidal SU‐8 rods are prepared by shearing an emulsion of SU‐8 polymer droplets and then exposing the resulting non‐Brownian rods to ultrasonic waves, which breaks them into colloidal rods with typical lengths of 3.5–10 µm and diameters of 0.4–1 µm. The rods are stable in both aqueous and apolar solvents, and by varying the composition of apolar solvent mixtures both the difference in refractive index and mass density between particles and solvent can be independently controlled. Consequently, these colloidal SU‐8 rods can be used in both 3D confocal microscopy and optical trapping experiments while carefully tuning the effect of gravity. This is demonstrated by using confocal microscopy to image the liquid crystalline phases and the isotropic–nematic interface formed by the colloidal SU‐8 rods and by optically trapping single rods in water. Finally, the simultaneous confocal imaging and optical manipulation of multiple SU‐8 rods in the isotropic phase is shown.","lang":"eng"}],"author":[{"first_name":"Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","last_name":"Fernández-Rico","full_name":"Fernández-Rico, Carla"},{"last_name":"Yanagishima","full_name":"Yanagishima, Taiki","first_name":"Taiki"},{"last_name":"Curran","full_name":"Curran, Arran","first_name":"Arran"},{"first_name":"Dirk G. A. L.","full_name":"Aarts, Dirk G. A. L.","last_name":"Aarts"},{"full_name":"Dullens, Roel P. A.","last_name":"Dullens","first_name":"Roel P. A."}],"publication":"Advanced Materials","title":"Synthesis of colloidal SU‐8 polymer rods using sonication","publication_identifier":{"issn":["0935-9648"],"eissn":["1521-4095"]},"year":"2019","_id":"22208","oa_version":"Published Version","intvolume":" 31","type":"journal_article","date_published":"2019-04-25T00:00:00Z","volume":31,"external_id":{"pmid":["30869177"]},"language":[{"iso":"eng"}],"month":"04","ddc":["540"],"OA_type":"hybrid","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/adma.201807514"}],"quality_controlled":"1","scopus_import":"1","pmid":1,"doi":"10.1002/adma.201807514","has_accepted_license":"1","status":"public","OA_place":"publisher"},{"_id":"8305","year":"2019","status":"public","abstract":[{"text":"In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1