[{"author":[{"full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409"}],"ddc":["020"],"oa":1,"month":"05","corr_author":"1","doi":"10.31263/voebm.v72i1.2276","article_type":"original","date_published":"2019-05-17T00:00:00Z","date_updated":"2026-07-07T06:28:30Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","publication_status":"published","day":"17","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["1022-2588"]},"citation":{"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.","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.","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.","short":"P. Danowski, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 72 (2019) 59–65.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-07-21T21:59:15Z","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","file":[{"file_id":"6661","file_size":468558,"checksum":"c0d2695d6d0d34e62ba06fb3f0ebaaed","access_level":"open_access","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-22T08:45:03Z","creator":"apreinsp","content_type":"application/pdf","file_name":"2019_MitteilungenDerVOEB_Danowski.pdf","relation":"main_file"}],"status":"public","intvolume":" 72","year":"2019","file_date_updated":"2020-07-14T12:47:35Z","has_accepted_license":"1","volume":72,"issue":"1","page":"59-65","quality_controlled":"1","_id":"6657","article_processing_charge":"No","related_material":{"record":[{"id":"5686","status":"public","relation":"earlier_version"}]},"department":[{"_id":"E-Lib"}],"title":"An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors","abstract":[{"lang":"eng","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."}],"type":"journal_article"},{"file_date_updated":"2020-07-14T12:47:41Z","has_accepted_license":"1","volume":11674,"file":[{"date_updated":"2020-07-14T12:47:41Z","creator":"gavni","date_created":"2019-08-19T07:56:40Z","content_type":"application/pdf","file_name":"prob.pdf","relation":"main_file","checksum":"45ebbc709af2b247d28c7c293c01504b","access_level":"open_access","file_id":"6823","file_size":436635}],"intvolume":" 11674","status":"public","year":"2019","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"isi":1,"title":"Bidding games on Markov decision processes","abstract":[{"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.","lang":"eng"}],"type":"conference","page":"1-12","quality_controlled":"1","_id":"6822","article_processing_charge":"No","external_id":{"isi":["001333747500001"]},"date_published":"2019-09-06T00:00:00Z","date_updated":"2026-07-07T13:29:21Z","oa_version":"Submitted Version","author":[{"first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"}],"oa":1,"ddc":["000"],"month":"09","doi":"10.1007/978-3-030-30806-3_1","citation":{"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.","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.","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.","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","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.","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.","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-08-19T07:58:10Z","das_tickbox":"1","publication":"Proceedings of the 13th International Conference of Reachability Problems","publication_status":"published","publisher":"Springer","conference":{"start_date":"2019-09-11","end_date":"2019-09-13","name":"RP: Reachability Problems","location":"Brussels, Belgium"},"project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"day":"06","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]}},{"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"doi":"10.4230/LIPICS.ITCS.2019.60","oa":1,"ddc":["000"],"month":"01","external_id":{"cryptoeprintid":["2018/627"]},"article_number":"60","date_updated":"2026-07-07T13:31:01Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2019-01-10T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","conference":{"location":"San Diego, CA, United States","start_date":"2019-01-10","name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2019-01-12"},"publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"project":[{"call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"day":"10","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"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.","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","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","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.","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","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.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"das_tickbox":"1","cryptoeprintid":1,"date_created":"2019-06-06T14:12:36Z","publication":"10th Innovations in Theoretical Computer Science Conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"6529","file_size":558770,"access_level":"open_access","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","content_type":"application/pdf","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-06T14:22:04Z","creator":"dernst","relation":"main_file","file_name":"2019_LIPIcs_Pietrzak.pdf"}],"intvolume":" 124","status":"public","year":"2019","ec_funded":1,"file_date_updated":"2020-07-14T12:47:33Z","has_accepted_license":"1","volume":124,"quality_controlled":"1","_id":"6528","article_processing_charge":"No","department":[{"_id":"KrPi"}],"alternative_title":["LIPIcs"],"type":"conference","title":"Simple verifiable delay functions","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"}]},{"article_number":"39","external_id":{"arxiv":["1903.08637"]},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-07-07T13:41:10Z","date_published":"2019-06-01T00:00:00Z","author":[{"full_name":"Fulek, Radoslav","last_name":"Fulek","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774"},{"first_name":"Jan","last_name":"Kyncl","full_name":"Kyncl, Jan"}],"doi":"10.4230/LIPICS.SOCG.2019.39","corr_author":"1","month":"06","oa":1,"ddc":["000"],"citation":{"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.","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","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.","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.","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","short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","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."},"publication":"35th International Symposium on Computational Geometry","das_tickbox":"1","date_created":"2020-01-29T16:17:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2019-06-21","name":"SoCG: Symposium on Computational Geometry","start_date":"2019-06-18","location":"Portland, OR, United States"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-104-7"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"day":"01","project":[{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"file_date_updated":"2020-07-14T12:47:57Z","volume":129,"has_accepted_license":"1","intvolume":" 129","status":"public","file":[{"file_id":"7445","file_size":628347,"access_level":"open_access","checksum":"aac37b09118cc0ab58cf77129e691f8c","content_type":"application/pdf","date_created":"2020-02-04T09:14:31Z","creator":"dernst","date_updated":"2020-07-14T12:47:57Z","relation":"main_file","file_name":"2019_LIPIcs_Fulek.pdf"}],"year":"2019","department":[{"_id":"UlWa"}],"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","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. "}],"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","_id":"7401","quality_controlled":"1","article_processing_charge":"No"},{"volume":"2019-June","year":"2019","status":"public","abstract":[{"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.","lang":"eng"}],"title":"Distributed learning over unreliable networks","type":"conference","isi":1,"department":[{"_id":"DaAl"}],"article_processing_charge":"No","page":"12481-12512","_id":"7437","quality_controlled":"1","date_published":"2019-06-01T00:00:00Z","oa_version":"Preprint","date_updated":"2026-07-07T13:41:57Z","external_id":{"arxiv":["1810.07766"],"isi":["000684034307036"]},"month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.07766"}],"oa":1,"author":[{"full_name":"Yu, Chen","last_name":"Yu","first_name":"Chen"},{"first_name":"Hanlin","full_name":"Tang, Hanlin","last_name":"Tang"},{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"},{"full_name":"Kassing, Simon","last_name":"Kassing","first_name":"Simon"},{"first_name":"Ankit","full_name":"Singla, Ankit","last_name":"Singla"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Ce","last_name":"Zhang","full_name":"Zhang, Ce"},{"last_name":"Liu","full_name":"Liu, Ji","first_name":"Ji"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"36th International Conference on Machine Learning","das_tickbox":"1","date_created":"2020-02-02T23:01:06Z","citation":{"mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, vol. 2019–June, IMLS, 2019, pp. 12481–512.","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.","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.","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.","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.","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.","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."},"language":[{"iso":"eng"}],"scopus_import":"1","day":"01","arxiv":1,"publication_identifier":{"isbn":["9781510886988"]},"conference":{"start_date":"2019-06-10","end_date":"2019-06-15","name":"ICML: International Conference on Machine Learning","location":"Long Beach, CA, United States"},"publication_status":"published","publisher":"IMLS"},{"date_published":"2019-05-25T00:00:00Z","date_updated":"2026-07-08T06:37:19Z","oa_version":"Published Version","oa":1,"ddc":["000"],"month":"05","doi":"10.29007/rjwn","author":[{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"first_name":"Alessandro","full_name":"Abate, Alessandro","last_name":"Abate"},{"first_name":"Dieky","full_name":"Adzkiya, Dieky","last_name":"Adzkiya"},{"first_name":"Anna","last_name":"Becchi","full_name":"Becchi, Anna"},{"first_name":"Lei","full_name":"Bu, Lei","last_name":"Bu"},{"full_name":"Cimatti, Alessandro","last_name":"Cimatti","first_name":"Alessandro"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco"},{"full_name":"Griggio, Alberto","last_name":"Griggio","first_name":"Alberto"},{"first_name":"Sergio","last_name":"Mover","full_name":"Mover, Sergio"},{"full_name":"Mufid, Muhammad Syifa'ul","last_name":"Mufid","first_name":"Muhammad Syifa'ul"},{"last_name":"Riouak","full_name":"Riouak, Idriss","first_name":"Idriss"},{"last_name":"Tonetta","full_name":"Tonetta, Stefano","first_name":"Stefano"},{"first_name":"Enea","full_name":"Zaffanella, Enea","last_name":"Zaffanella"}],"editor":[{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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).","date_created":"2022-03-18T12:29:23Z","das_tickbox":"1","publication":"6th International Workshop on Applied Verification of Continuous and Hybrid Systems","citation":{"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","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.","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.","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.","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","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."},"day":"25","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2398-7340"]},"publication_status":"published","publisher":"EasyChair","conference":{"end_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15","location":"Montreal, Canada"},"has_accepted_license":"1","volume":61,"file_date_updated":"2022-05-17T06:55:49Z","year":"2019","file":[{"file_id":"11391","file_size":346415,"success":1,"access_level":"open_access","checksum":"4b92e333db7b4e2349501a804dfede69","date_created":"2022-05-17T06:55:49Z","date_updated":"2022-05-17T06:55:49Z","creator":"dernst","content_type":"application/pdf","file_name":"2019_EPiCs_Frehse.pdf","relation":"main_file"}],"intvolume":" 61","status":"public","title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","abstract":[{"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.","lang":"eng"}],"type":"conference","alternative_title":["EPiC Series in Computing"],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","page":"1-13","quality_controlled":"1","_id":"10877"},{"date_created":"2019-04-08T14:05:04Z","das_tickbox":"1","publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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","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.","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.","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.","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."},"arxiv":1,"publication_identifier":{"issn":["0246-0203"]},"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publisher":"Institut Henri Poincaré","date_updated":"2026-07-08T06:17:16Z","oa_version":"Preprint","date_published":"2019-05-01T00:00:00Z","external_id":{"isi":["000467793600003"],"arxiv":["1706.08343"]},"doi":"10.1214/18-AIHP894","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1706.08343","open_access":"1"}],"month":"05","author":[{"last_name":"Alt","full_name":"Alt, Johannes","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","first_name":"László"},{"full_name":"Krüger, Torben H","last_name":"Krüger","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297"},{"orcid":"0000-0002-7327-856X","id":"4D902E6A-F248-11E8-B48F-1D18A9856A87","first_name":"Yuriy","last_name":"Nemish","full_name":"Nemish, Yuriy"}],"type":"journal_article","title":"Location of the spectrum of Kronecker random matrices","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"}],"department":[{"_id":"LaEr"}],"isi":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"149","status":"public"}]},"article_processing_charge":"No","quality_controlled":"1","_id":"6240","page":"661-696","issue":"2","volume":55,"year":"2019","ec_funded":1,"intvolume":" 55","status":"public"},{"type":"journal_article","title":"Unexpected topology of the temperature fluctuations in the cosmic microwave background","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"HeEd"}],"isi":1,"OA_type":"hybrid","article_processing_charge":"No","quality_controlled":"1","_id":"6756","volume":627,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:47:39Z","year":"2019","file":[{"relation":"main_file","file_name":"2019_AstronomyAstrophysics_Pranav.pdf","content_type":"application/pdf","date_created":"2019-08-05T08:08:59Z","creator":"dernst","date_updated":"2020-07-14T12:47:39Z","file_size":14420451,"file_id":"6766","access_level":"open_access","checksum":"83b9209ed9eefbdcefd89019c5a97805"}],"intvolume":" 627","status":"public","date_created":"2019-08-04T21:59:18Z","das_tickbox":"1","publication":"Astronomy & Astrophysics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","citation":{"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","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).","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.","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","ieee":"P. Pranav et al., “Unexpected topology of the temperature fluctuations in the cosmic microwave background,” Astronomy & Astrophysics, vol. 627. EDP Sciences, 2019.","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."},"publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"arxiv":1,"project":[{"grant_number":"M62909-18-1-2038","name":"Toward Computational Information Topology","_id":"265683E4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"day":"17","scopus_import":"1","language":[{"iso":"eng"}],"publisher":"EDP Sciences","publication_status":"published","date_updated":"2026-07-08T06:46:14Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_published":"2019-07-17T00:00:00Z","external_id":{"isi":["000475839300003"],"arxiv":["1812.07678"]},"article_number":"A163","doi":"10.1051/0004-6361/201834916","article_type":"original","OA_place":"publisher","ddc":["520","530"],"oa":1,"month":"07","author":[{"last_name":"Pranav","full_name":"Pranav, Pratyush","first_name":"Pratyush"},{"first_name":"Robert J.","full_name":"Adler, Robert J.","last_name":"Adler"},{"full_name":"Buchert, Thomas","last_name":"Buchert","first_name":"Thomas"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Bernard J.T.","last_name":"Jones","full_name":"Jones, Bernard J.T."},{"first_name":"Armin","last_name":"Schwartzman","full_name":"Schwartzman, Armin"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0009-9111-8429","full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert"},{"full_name":"Van De Weygaert, Rien","last_name":"Van De Weygaert","first_name":"Rien"}]},{"type":"journal_article","abstract":[{"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.","lang":"eng"}],"title":"Soficity and variations on Higman’s group","_id":"22205","quality_controlled":"1","page":"41-70","OA_type":"green","article_processing_charge":"No","issue":"1","volume":3,"intvolume":" 3","status":"public","year":"2019","citation":{"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.","ista":"Kassabov M, Kuperberg VZ, Riley TR. 2019. Soficity and variations on Higman’s group. Journal of Combinatorial Algebra. 3(1), 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.","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","short":"M. Kassabov, V.Z. Kuperberg, T.R. Riley, Journal of Combinatorial Algebra 3 (2019) 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"},"extern":"1","publication":"Journal of Combinatorial Algebra","date_created":"2026-06-29T13:01:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"European Mathematical Society","arxiv":1,"publication_identifier":{"eissn":["2415-6302"]},"scopus_import":"1","language":[{"iso":"eng"}],"day":"01","external_id":{"arxiv":["2406.04174"]},"oa_version":"Preprint","date_updated":"2026-07-14T11:54:52Z","date_published":"2019-02-01T00:00:00Z","author":[{"first_name":"Martin","full_name":"Kassabov, Martin","last_name":"Kassabov"},{"full_name":"Kuperberg, Vivian Zieve","last_name":"Kuperberg","first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697"},{"last_name":"Riley","full_name":"Riley, Timothy R.","first_name":"Timothy R."}],"OA_place":"repository","article_type":"original","doi":"10.4171/jca/26","month":"02","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.04174"}]},{"author":[{"id":"492def71-6250-11f0-b278-d41dbd241b62","full_name":"Fernández-Rico, Carla","last_name":"Fernández-Rico","first_name":"Carla"},{"full_name":"Yanagishima, Taiki","last_name":"Yanagishima","first_name":"Taiki"},{"full_name":"Curran, Arran","last_name":"Curran","first_name":"Arran"},{"last_name":"Aarts","full_name":"Aarts, Dirk G. A. L.","first_name":"Dirk G. A. L."},{"first_name":"Roel P. A.","last_name":"Dullens","full_name":"Dullens, Roel P. A."}],"doi":"10.1002/adma.201807514","OA_place":"publisher","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/adma.201807514"}],"ddc":["540"],"oa":1,"month":"04","external_id":{"pmid":["30869177"]},"article_number":"1807514","date_updated":"2026-07-15T06:22:53Z","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"date_published":"2019-04-25T00:00:00Z","publisher":"Wiley","publication_status":"published","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"day":"25","language":[{"iso":"eng"}],"scopus_import":"1","citation":{"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.","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","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.","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).","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"},"date_created":"2026-06-30T06:30:50Z","extern":"1","publication":"Advanced Materials","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","intvolume":" 31","year":"2019","pmid":1,"issue":"17","volume":31,"has_accepted_license":"1","quality_controlled":"1","_id":"22208","OA_type":"hybrid","article_processing_charge":"No","type":"journal_article","title":"Synthesis of colloidal SU‐8 polymer rods using sonication","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"}]},{"OA_type":"green","day":"10","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"submitted","_id":"8305","date_created":"2020-08-26T12:18:00Z","das_tickbox":"1","cryptoeprintid":1,"publication":"Cryptology ePrint Archive","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Bootstrapping consensus without trusted setup: Fully asynchronous distributed key generation","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