[{"_id":"6415","page":"63-68","date_created":"2019-05-13T07:58:36Z","scopus_import":"1","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Ant invasions are often harmful to native species communities. Their pathogens and host disease defense mechanisms may be one component of their devastating success. First, they can introduce harmful diseases to their competitors in the introduced range, to which they themselves are tolerant. Second, their supercolonial social structure of huge multi-queen nest networks means that they will harbor a broad pathogen spectrum and high pathogen load while remaining resilient, unlike the smaller, territorial colonies of the native species. Thus, it is likely that invasive ants act as a disease reservoir, promoting their competitive advantage and invasive success."}],"publication":"Current Opinion in Insect Science","month":"06","status":"public","publication_status":"published","isi":1,"intvolume":"        33","quality_controlled":"1","date_updated":"2025-07-10T11:53:22Z","author":[{"orcid":"0000-0002-2193-3868","last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"day":"01","doi":"10.1016/j.cois.2019.03.011","year":"2019","publication_identifier":{"issn":["2214-5745"],"eissn":["2214-5753"]},"type":"journal_article","oa_version":"None","date_published":"2019-06-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000477666000012"]},"title":"Pathogens and disease defense of invasive ants","citation":{"mla":"Cremer, Sylvia. “Pathogens and Disease Defense of Invasive Ants.” <i>Current Opinion in Insect Science</i>, vol. 33, Elsevier, 2019, pp. 63–68, doi:<a href=\"https://doi.org/10.1016/j.cois.2019.03.011\">10.1016/j.cois.2019.03.011</a>.","ista":"Cremer S. 2019. Pathogens and disease defense of invasive ants. Current Opinion in Insect Science. 33, 63–68.","short":"S. Cremer, Current Opinion in Insect Science 33 (2019) 63–68.","ieee":"S. Cremer, “Pathogens and disease defense of invasive ants,” <i>Current Opinion in Insect Science</i>, vol. 33. Elsevier, pp. 63–68, 2019.","chicago":"Cremer, Sylvia. “Pathogens and Disease Defense of Invasive Ants.” <i>Current Opinion in Insect Science</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.cois.2019.03.011\">https://doi.org/10.1016/j.cois.2019.03.011</a>.","ama":"Cremer S. Pathogens and disease defense of invasive ants. <i>Current Opinion in Insect Science</i>. 2019;33:63-68. doi:<a href=\"https://doi.org/10.1016/j.cois.2019.03.011\">10.1016/j.cois.2019.03.011</a>","apa":"Cremer, S. (2019). Pathogens and disease defense of invasive ants. <i>Current Opinion in Insect Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cois.2019.03.011\">https://doi.org/10.1016/j.cois.2019.03.011</a>"},"volume":33},{"publication_status":"published","issue":"4","intvolume":"        11","author":[{"orcid":"0000-0001-8871-4961","last_name":"Huylmans","full_name":"Huylmans, Ann K","first_name":"Ann K","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","last_name":"Toups","orcid":"0000-0002-9752-7380","full_name":"Toups, Melissa A"},{"last_name":"Macon","full_name":"Macon, Ariana","first_name":"Ariana","id":"2A0848E2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gammerdinger, William J","last_name":"Gammerdinger","orcid":"0000-0001-9638-1220","id":"3A7E01BC-F248-11E8-B48F-1D18A9856A87","first_name":"William J"},{"orcid":"0000-0002-4579-8306","last_name":"Vicoso","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"file":[{"checksum":"7d0ede297b6741f3dc89cd59017c7642","file_id":"6446","file_size":1256303,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2019_GBE_Huylmans.pdf","creator":"dernst","date_created":"2019-05-14T08:29:38Z","date_updated":"2020-07-14T12:47:29Z"}],"doi":"10.1093/gbe/evz053","oa_version":"Published Version","external_id":{"isi":["000476569800003"]},"related_material":{"record":[{"id":"6060","status":"public","relation":"popular_science"}]},"scopus_import":"1","date_created":"2019-05-13T07:58:38Z","page":"1033-1044","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"6418","publisher":"Oxford University Press","abstract":[{"lang":"eng","text":"Males and females of Artemia franciscana, a crustacean commonly used in the aquarium trade, are highly dimorphic. Sex is determined by a pair of ZW chromosomes, but the nature and extent of differentiation of these chromosomes is unknown. Here, we characterize the Z chromosome by detecting genomic regions that show lower genomic coverage in female than in male samples, and regions that harbor an excess of female-specific SNPs. We detect many Z-specific genes, which no longer have homologs on the W, but also Z-linked genes that appear to have diverged very recently from their existing W-linked homolog. We assess patterns of male and female expression in two tissues with extensive morphological dimorphism, gonads, and heads. In agreement with their morphology, sex-biased expression is common in both tissues. Interestingly, the Z chromosome is not enriched for sex-biased genes, and seems to in fact have a mechanism of dosage compensation that leads to equal expression in males and in females. Both of these patterns are contrary to most ZW systems studied so far, making A. franciscana an excellent model for investigating the interplay between the evolution of sexual dimorphism and dosage compensation, as well as Z chromosome evolution in general."}],"ec_funded":1,"oa":1,"status":"public","month":"04","publication":"Genome biology and evolution","isi":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"ddc":["570"],"quality_controlled":"1","day":"01","date_updated":"2025-04-14T07:41:21Z","file_date_updated":"2020-07-14T12:47:29Z","year":"2019","publication_identifier":{"eissn":["1759-6653"]},"type":"journal_article","language":[{"iso":"eng"}],"date_published":"2019-04-01T00:00:00Z","department":[{"_id":"BeVi"}],"has_accepted_license":"1","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Huylmans, Ann K., et al. “Sex-Biased Gene Expression and Dosage Compensation on the Artemia Franciscana Z-Chromosome.” <i>Genome Biology and Evolution</i>, vol. 11, no. 4, Oxford University Press, 2019, pp. 1033–44, doi:<a href=\"https://doi.org/10.1093/gbe/evz053\">10.1093/gbe/evz053</a>.","ista":"Huylmans AK, Toups MA, Macon A, Gammerdinger WJ, Vicoso B. 2019. Sex-biased gene expression and dosage compensation on the Artemia franciscana Z-chromosome. Genome biology and evolution. 11(4), 1033–1044.","short":"A.K. Huylmans, M.A. Toups, A. Macon, W.J. Gammerdinger, B. Vicoso, Genome Biology and Evolution 11 (2019) 1033–1044.","apa":"Huylmans, A. K., Toups, M. A., Macon, A., Gammerdinger, W. J., &#38; Vicoso, B. (2019). Sex-biased gene expression and dosage compensation on the Artemia franciscana Z-chromosome. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evz053\">https://doi.org/10.1093/gbe/evz053</a>","chicago":"Huylmans, Ann K, Melissa A Toups, Ariana Macon, William J Gammerdinger, and Beatriz Vicoso. “Sex-Biased Gene Expression and Dosage Compensation on the Artemia Franciscana Z-Chromosome.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2019. <a href=\"https://doi.org/10.1093/gbe/evz053\">https://doi.org/10.1093/gbe/evz053</a>.","ieee":"A. K. Huylmans, M. A. Toups, A. Macon, W. J. Gammerdinger, and B. Vicoso, “Sex-biased gene expression and dosage compensation on the Artemia franciscana Z-chromosome,” <i>Genome biology and evolution</i>, vol. 11, no. 4. Oxford University Press, pp. 1033–1044, 2019.","ama":"Huylmans AK, Toups MA, Macon A, Gammerdinger WJ, Vicoso B. Sex-biased gene expression and dosage compensation on the Artemia franciscana Z-chromosome. <i>Genome biology and evolution</i>. 2019;11(4):1033-1044. doi:<a href=\"https://doi.org/10.1093/gbe/evz053\">10.1093/gbe/evz053</a>"},"title":"Sex-biased gene expression and dosage compensation on the Artemia franciscana Z-chromosome","volume":11,"project":[{"call_identifier":"H2020","_id":"250BDE62-B435-11E9-9278-68D0E5697425","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","grant_number":"715257"}]},{"publication_identifier":{"eisbn":["9783030041618"],"eissn":["2523-305X"],"issn":["2523-3041"],"isbn":["9783030041601"]},"type":"book_chapter","year":"2019","day":"25","date_updated":"2025-09-23T11:59:52Z","department":[{"_id":"TaHa"}],"place":"Cham","language":[{"iso":"eng"}],"date_published":"2019-03-25T00:00:00Z","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1803.06627","open_access":"1"}],"volume":2,"title":"How to Sheafify an Elliptic Quantum Group","citation":{"chicago":"Yang, Yaping, and Gufang Zhao. “How to Sheafify an Elliptic Quantum Group.” In <i>2017 MATRIX Annals</i>, 2:675–91. MXBS. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-04161-8_54\">https://doi.org/10.1007/978-3-030-04161-8_54</a>.","ama":"Yang Y, Zhao G. How to Sheafify an Elliptic Quantum Group. In: <i>2017 MATRIX Annals</i>. Vol 2. MXBS. Cham: Springer International Publishing; 2019:675-691. doi:<a href=\"https://doi.org/10.1007/978-3-030-04161-8_54\">10.1007/978-3-030-04161-8_54</a>","apa":"Yang, Y., &#38; Zhao, G. (2019). How to Sheafify an Elliptic Quantum Group. In <i>2017 MATRIX Annals</i> (Vol. 2, pp. 675–691). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-04161-8_54\">https://doi.org/10.1007/978-3-030-04161-8_54</a>","ieee":"Y. Yang and G. Zhao, “How to Sheafify an Elliptic Quantum Group,” in <i>2017 MATRIX Annals</i>, vol. 2, Cham: Springer International Publishing, 2019, pp. 675–691.","ista":"Yang Y, Zhao G. 2019.How to Sheafify an Elliptic Quantum Group. In: 2017 MATRIX Annals. MATRIX Book Series, vol. 2, 675–691.","mla":"Yang, Yaping, and Gufang Zhao. “How to Sheafify an Elliptic Quantum Group.” <i>2017 MATRIX Annals</i>, vol. 2, Springer International Publishing, 2019, pp. 675–91, doi:<a href=\"https://doi.org/10.1007/978-3-030-04161-8_54\">10.1007/978-3-030-04161-8_54</a>.","short":"Y. Yang, G. Zhao, in:, 2017 MATRIX Annals, Springer International Publishing, Cham, 2019, pp. 675–691."},"_id":"19987","OA_place":"repository","page":"675-691","date_created":"2025-07-10T13:31:38Z","abstract":[{"text":"These lecture notes are based on Yang’s talk at the MATRIX program Geometric R-Matrices: from Geometry to Probability, at the University of Melbourne, Dec. 18–22, 2017, and Zhao’s talk at Perimeter Institute for Theoretical Physics in January 2018. We give an introductory survey of the results in Yang and Zhao (Quiver varieties and elliptic quantum groups, 2017. arxiv1708.01418). We discuss a sheafified elliptic quantum group associated to any symmetric Kac-Moody Lie algebra. The sheafification is obtained by applying the equivariant elliptic cohomological theory to the moduli space of representations of a preprojective algebra. By construction, the elliptic quantum group naturally acts on the equivariant elliptic cohomology of Nakajima quiver varieties. As an application, we obtain a relation between the sheafified elliptic quantum group and the global affine Grassmannian over an elliptic curve.","lang":"eng"}],"acknowledgement":"Y.Y. would like to thank the organizers of the MATRIX program Geometric R-Matrices: from Geometry to Probability for their kind invitation, and many participants of the program for useful discussions, including Vassily Gorbounov, Andrei Okounkov, Allen Knutson, Hitoshi Konno, Paul Zinn-Justin. Proposition 1 and Sect. 3.3 are new, for which we thank Hitoshi Konno for interesting discussions and communications. These notes were written when both authors were visiting the Perimeter Institute for Theoretical Physics (PI). We are grateful to PI for the hospitality.","publisher":"Springer International Publishing","month":"03","publication":"2017 MATRIX Annals","series_title":"MXBS","oa":1,"status":"public","quality_controlled":"1","doi":"10.1007/978-3-030-04161-8_54","author":[{"last_name":"Yang","full_name":"Yang, Yaping","first_name":"Yaping","id":"360D8648-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zhao, Gufang","last_name":"Zhao","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","first_name":"Gufang"}],"oa_version":"Preprint","external_id":{"arxiv":["1803.06627"]},"arxiv":1,"alternative_title":["MATRIX Book Series"],"publication_status":"published","intvolume":"         2"},{"publication_status":"published","arxiv":1,"external_id":{"arxiv":["1902.07129"]},"oa_version":"Preprint","doi":"10.1142/9781786347015_0018","author":[{"first_name":"A","last_name":"De Martino","full_name":"De Martino, A"},{"last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"E","last_name":"Marinari","full_name":"Marinari, E"}],"quality_controlled":"1","oa":1,"status":"public","month":"09","publication":"Chemical Kinetics","abstract":[{"text":"Quantitative studies of cell metabolism are often based on large chemical reaction network models. A steady-state approach is suited to analyze phenomena on the timescale of cell growth and circumvents the problem of incomplete experimental knowledge on kinetic laws and parameters, but it should be supported by a correct implementation of thermodynamic constraints. In this chapter, we review the latter aspect, highlighting its computational challenges and physical insights. The simple introduction of Gibbs inequalities avoids the presence of unfeasible loops allowing for correct timescale analysis, but leads to possibly non-convex feasible flux spaces whose exploration needs efficient algorithms. We briefly review the implementation of thermodynamics through variational principles in constraint-based models of metabolic networks.","lang":"eng"}],"publisher":"World Scientific Publishing","page":"455-471","date_created":"2025-07-10T13:34:01Z","OA_place":"repository","_id":"19988","citation":{"ista":"De Martino A, De Martino D, Marinari E. 2019.The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges. In: Chemical Kinetics. , 455–471.","mla":"De Martino, A., et al. “The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges.” <i>Chemical Kinetics</i>, World Scientific Publishing, 2019, pp. 455–71, doi:<a href=\"https://doi.org/10.1142/9781786347015_0018\">10.1142/9781786347015_0018</a>.","short":"A. De Martino, D. De Martino, E. Marinari, in:, Chemical Kinetics, World Scientific Publishing, 2019, pp. 455–471.","ama":"De Martino A, De Martino D, Marinari E. The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges. In: <i>Chemical Kinetics</i>. World Scientific Publishing; 2019:455-471. doi:<a href=\"https://doi.org/10.1142/9781786347015_0018\">10.1142/9781786347015_0018</a>","apa":"De Martino, A., De Martino, D., &#38; Marinari, E. (2019). The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges. In <i>Chemical Kinetics</i> (pp. 455–471). World Scientific Publishing. <a href=\"https://doi.org/10.1142/9781786347015_0018\">https://doi.org/10.1142/9781786347015_0018</a>","ieee":"A. De Martino, D. De Martino, and E. Marinari, “The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges,” in <i>Chemical Kinetics</i>, World Scientific Publishing, 2019, pp. 455–471.","chicago":"De Martino, A, Daniele De Martino, and E Marinari. “The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges.” In <i>Chemical Kinetics</i>, 455–71. World Scientific Publishing, 2019. <a href=\"https://doi.org/10.1142/9781786347015_0018\">https://doi.org/10.1142/9781786347015_0018</a>."},"title":"The Essential Role of Thermodynamics in Metabolic Network Modeling: Physical Insights and Computational Challenges","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1902.07129","open_access":"1"}],"department":[{"_id":"GaTk"}],"language":[{"iso":"eng"}],"date_published":"2019-09-01T00:00:00Z","type":"book_chapter","publication_identifier":{"isbn":["9781786347008"],"eisbn":["9781786347022"]},"year":"2019","day":"01","date_updated":"2025-09-23T11:53:34Z"},{"department":[{"_id":"PeJo"}],"place":"Berlin, Heidelberg","date_published":"2019-04-02T00:00:00Z","language":[{"iso":"ger"}],"oa_version":"None","type":"book_chapter","publication_identifier":{"eissn":["2512-5214"],"eisbn":["9783662564684"],"isbn":["9783662564677"],"issn":["0937-7433"]},"year":"2019","doi":"10.1007/978-3-662-56468-4_7","date_updated":"2025-09-23T11:44:57Z","day":"02","author":[{"orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"citation":{"apa":"Jonas, P. M. (2019). Aktionspotenzial: Fortleitung im Axon. In <i>Physiologie des Menschen</i> (32nd ed., pp. 72–82). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-56468-4_7\">https://doi.org/10.1007/978-3-662-56468-4_7</a>","ama":"Jonas PM. Aktionspotenzial: Fortleitung im Axon. In: <i>Physiologie des Menschen</i>. 32nd ed. Springer-Lehrbuch. Berlin, Heidelberg: Springer Nature; 2019:72-82. doi:<a href=\"https://doi.org/10.1007/978-3-662-56468-4_7\">10.1007/978-3-662-56468-4_7</a>","ieee":"P. M. Jonas, “Aktionspotenzial: Fortleitung im Axon,” in <i>Physiologie des Menschen</i>, 32nd ed., Berlin, Heidelberg: Springer Nature, 2019, pp. 72–82.","chicago":"Jonas, Peter M. “Aktionspotenzial: Fortleitung im Axon.” In <i>Physiologie des Menschen</i>, 32nd ed., 72–82. Springer-Lehrbuch. Berlin, Heidelberg: Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-662-56468-4_7\">https://doi.org/10.1007/978-3-662-56468-4_7</a>.","mla":"Jonas, Peter M. “Aktionspotenzial: Fortleitung im Axon.” <i>Physiologie des Menschen</i>, 32nd ed., Springer Nature, 2019, pp. 72–82, doi:<a href=\"https://doi.org/10.1007/978-3-662-56468-4_7\">10.1007/978-3-662-56468-4_7</a>.","ista":"Jonas PM. 2019.Aktionspotenzial: Fortleitung im Axon. In: Physiologie des Menschen. , 72–82.","short":"P.M. Jonas, in:, Physiologie des Menschen, 32nd ed., Springer Nature, Berlin, Heidelberg, 2019, pp. 72–82."},"title":"Aktionspotenzial: Fortleitung im Axon","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"closed access","article_processing_charge":"No","abstract":[{"lang":"ger","text":"Neurone empfangen Eingangssignale, konvertieren diese in Aktionspotenziale und generieren schließlich Ausgangssignale auf ihren Zielzellen. Dabei sind die zu überwindenden räumlichen Distanzen oft groß. Daher ist entscheidend, dass elektrische Signale in Nervenzellen schnell von einem zum anderen Ort geleitet werden können. Diese wichtige Aufgabe erfüllt das Axon, der „Ausgangsfortsatz“ der Nervenzelle. Für die schnelle Leitung des Aktionspotenzials sind sowohl die passiven Eigenschaften des axonalen Kabels als auch die aktiven Eigenschaften der Zellmembran von entscheidender Bedeutung. Die Evolution bedient sich zweier Tricks, um die Leitungsgeschwindigkeit des Aktionspotenzials zu maximieren. Der eine Trick ist die Zunahme des Axondurchmessers. Der andere Trick ist die Ausbildung von Markscheiden. Dies führt bei nahezu gleichem Platzbedarf zu einer Zunahme der Leistungsgeschwindigkeit um fast zwei Größenordnungen. Die Aktionspotenzialleitung an myelinisierten Axonen erfolgt „saltatorisch“."}],"edition":"32","publisher":"Springer Nature","date_created":"2025-07-10T13:36:36Z","page":"72-82","_id":"19989","quality_controlled":"1","publication_status":"published","corr_author":"1","status":"public","publication":"Physiologie des Menschen","series_title":"Springer-Lehrbuch","month":"04"},{"oa_version":"Published Version","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10278","file_size":570829,"checksum":"2149979c46964c4d117af06ccb6c0834","date_created":"2021-11-12T11:41:56Z","success":1,"date_updated":"2021-11-12T11:41:56Z","creator":"cchlebak","file_name":"2019_ACM_Chatterjee.pdf"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman"}],"doi":"10.1145/3360550","related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"external_id":{"arxiv":["1909.00989"]},"arxiv":1,"intvolume":"         3","publication_status":"published","article_number":"124","date_published":"2019-10-10T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"file_date_updated":"2021-11-12T11:41:56Z","day":"10","date_updated":"2026-04-08T07:00:31Z","publication_identifier":{"eissn":["2475-1421"]},"year":"2019","type":"conference","title":"Value-centric dynamic partial order reduction","citation":{"ieee":"K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, Athens, Greece, 2019, vol. 3.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>.","apa":"Chatterjee, K., Pavlogiannis, A., &#38; Toman, V. (2019). Value-centric dynamic partial order reduction. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>","ama":"Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>","short":"K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019.","ista":"Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.","mla":"Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, vol. 3, 124, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>."},"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"}],"volume":3,"article_processing_charge":"No","conference":{"start_date":"2019-10-23","location":"Athens, Greece","end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"hybrid","publisher":"ACM","abstract":[{"lang":"eng","text":"The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning."}],"acknowledgement":"The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n","_id":"10190","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"OA_place":"publisher","scopus_import":"1","date_created":"2021-10-27T14:57:06Z","keyword":["safety","risk","reliability and quality","software"],"ddc":["000"],"quality_controlled":"1","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications","month":"10","oa":1,"status":"public","corr_author":"1"},{"intvolume":"        27","publication_status":"published","pmid":1,"external_id":{"pmid":["30089829"],"isi":["000454111500019"]},"oa_version":"Published Version","author":[{"last_name":"Marsh","full_name":"Marsh, Ashley","first_name":"Ashley"},{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"},{"first_name":"Paul","full_name":"Lockhart, Paul","last_name":"Lockhart"},{"last_name":"Leventer","full_name":"Leventer, Richard","first_name":"Richard"}],"doi":"10.1038/s41431-018-0231-2","ddc":["570"],"quality_controlled":"1","publication":"European Journal of Human Genetics","month":"01","oa":1,"status":"public","isi":1,"publisher":"Springer Nature","acknowledgement":"This work was supported by EuroGentest2 (Unit 2: “Genetic testing as part of health care”), a Coordination Action under FP7 (Grant Agreement Number 261469) and the European Society of Human Genetics. We acknowledge the participation of the patients and their families in these studies, as well as the generous financial support of the Lefroy and Handbury families. APLM was supported by an Australian Postgraduate Award. PJL is supported by an NHMRC Career Development Fellowship (GNT1032364). RJL is supported by a Melbourne Children’s Clinician Scientist Fellowship.","abstract":[{"lang":"eng","text":"Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease: 615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2 at 1p13.3. 4. OMIM# of the Gene(s): 102771."}],"article_type":"original","publist_id":"7949","_id":"105","page":"161-166","date_created":"2018-12-11T11:44:39Z","scopus_import":"1","title":"CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63","citation":{"chicago":"Marsh, Ashley, Gaia Novarino, Paul Lockhart, and Richard Leventer. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” <i>European Journal of Human Genetics</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41431-018-0231-2\">https://doi.org/10.1038/s41431-018-0231-2</a>.","apa":"Marsh, A., Novarino, G., Lockhart, P., &#38; Leventer, R. (2019). CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. <i>European Journal of Human Genetics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41431-018-0231-2\">https://doi.org/10.1038/s41431-018-0231-2</a>","ama":"Marsh A, Novarino G, Lockhart P, Leventer R. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. <i>European Journal of Human Genetics</i>. 2019;27:161-166. doi:<a href=\"https://doi.org/10.1038/s41431-018-0231-2\">10.1038/s41431-018-0231-2</a>","ieee":"A. Marsh, G. Novarino, P. Lockhart, and R. Leventer, “CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63,” <i>European Journal of Human Genetics</i>, vol. 27. Springer Nature, pp. 161–166, 2019.","short":"A. Marsh, G. Novarino, P. Lockhart, R. Leventer, European Journal of Human Genetics 27 (2019) 161–166.","ista":"Marsh A, Novarino G, Lockhart P, Leventer R. 2019. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. 27, 161–166.","mla":"Marsh, Ashley, et al. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” <i>European Journal of Human Genetics</i>, vol. 27, Springer Nature, 2019, pp. 161–66, doi:<a href=\"https://doi.org/10.1038/s41431-018-0231-2\">10.1038/s41431-018-0231-2</a>."},"volume":27,"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1038/s41431-018-0231-2","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2019-01-01T00:00:00Z","department":[{"_id":"GaNo"}],"date_updated":"2026-06-18T08:42:55Z","day":"01","type":"journal_article","year":"2019"},{"oa_version":"Published Version","file":[{"checksum":"9138977a06fcd6a95976eb4bca875f0c","file_size":1934830,"file_id":"7617","content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"dernst","file_name":"2019_ARCH19_Immler.pdf","date_created":"2020-03-24T07:36:36Z","date_updated":"2020-07-14T12:48:00Z"}],"author":[{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Luis","last_name":"Benet","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"full_name":"Chen, Xin","last_name":"Chen","first_name":"Xin"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"last_name":"Geretti","full_name":"Geretti, Luca","first_name":"Luca"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"first_name":"David P.","last_name":"Sanders","full_name":"Sanders, David P."},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Schilling, Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065"}],"doi":"10.29007/m75b","intvolume":"        61","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2019-05-25T00:00:00Z","department":[{"_id":"ToHe"}],"has_accepted_license":"1","day":"25","date_updated":"2026-04-03T09:51:13Z","file_date_updated":"2020-07-14T12:48:00Z","type":"conference","publication_identifier":{"eissn":["2398-7340"]},"year":"2019","citation":{"mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair, 2019, pp. 41–61, doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>.","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2019, pp. 41–61.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair; 2019:41-61. doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>","ieee":"F. Immler <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 61:41–61. EasyChair, 2019. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>"},"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","volume":61,"conference":{"location":"Montreal, Canada","end_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15"},"article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"EasyChair","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"date_created":"2020-03-08T23:00:49Z","page":"41-61","scopus_import":"1","_id":"7576","quality_controlled":"1","ddc":["000"],"oa":1,"status":"public","publication":"EPiC Series in Computing","month":"05","corr_author":"1"},{"external_id":{"arxiv":["1812.01475"],"isi":["000540384500015"]},"related_material":{"record":[{"id":"15020","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Hledik","full_name":"Hledik, Michal","first_name":"Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas R","id":"3E999752-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1287-3779","last_name":"Sokolowski","full_name":"Sokolowski, Thomas R"},{"first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper"}],"doi":"10.1109/ITW44776.2019.8989292","oa_version":"Preprint","publication_status":"published","article_number":"8989292","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1812.01475","open_access":"1"}],"article_processing_charge":"No","conference":{"start_date":"2019-08-25","location":"Visby, Sweden","name":"Information Theory Workshop","end_date":"2019-08-28"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A tight upper bound on mutual information","citation":{"chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>.","apa":"Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2019). A tight upper bound on mutual information. In <i>IEEE Information Theory Workshop, ITW 2019</i>. Visby, Sweden: IEEE. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>","ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>","ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in <i>IEEE Information Theory Workshop, ITW 2019</i>, Visby, Sweden, 2019.","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” <i>IEEE Information Theory Workshop, ITW 2019</i>, 8989292, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>.","ista":"Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.","short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019."},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"day":"01","date_updated":"2026-04-07T12:59:24Z","year":"2019","type":"conference","publication_identifier":{"isbn":["9781538669006"]},"date_published":"2019-08-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"month":"08","publication":"IEEE Information Theory Workshop, ITW 2019","status":"public","oa":1,"isi":1,"quality_controlled":"1","_id":"7606","scopus_import":"1","date_created":"2020-03-22T23:00:47Z","publisher":"IEEE","ec_funded":1,"abstract":[{"lang":"eng","text":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound."}]},{"department":[{"_id":"VlKo"}],"date_published":"2019-10-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","type":"conference","year":"2019","publication_identifier":{"isbn":["9781728150239"]},"doi":"10.1109/ICCVW.2019.00097","author":[{"full_name":"Rannen-Triki, Amal","last_name":"Rannen-Triki","first_name":"Amal"},{"first_name":"Maxim","last_name":"Berman","full_name":"Berman, Maxim"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"first_name":"Matthew B.","last_name":"Blaschko","full_name":"Blaschko, Matthew B."}],"day":"01","date_updated":"2023-09-08T11:19:12Z","citation":{"mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 748–752, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>.","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>.","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., &#38; Blaschko, M. B. (2019). Function norms for neural networks. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019."},"title":"Function norms for neural networks","external_id":{"isi":["000554591600090"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"start_date":"2019-10-27","end_date":"2019-10-28","name":"ICCVW: International Conference on Computer Vision Workshop","location":"Seoul, South Korea"},"article_processing_charge":"No","abstract":[{"text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN.","lang":"eng"}],"publisher":"IEEE","date_created":"2020-04-05T22:00:50Z","scopus_import":"1","_id":"7639","quality_controlled":"1","publication_status":"published","article_number":"748-752","isi":1,"status":"public","month":"10","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop"},{"oa_version":"Preprint","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov"},{"last_name":"Kuznetsova","full_name":"Kuznetsova, Alina","first_name":"Alina"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"},{"first_name":"Vittorio","full_name":"Ferrari, Vittorio","last_name":"Ferrari"}],"doi":"10.1109/ICCVW.2019.00217","external_id":{"isi":["000554591601098"],"arxiv":["1807.02136"]},"arxiv":1,"article_number":"1749-1753","publication_status":"published","date_published":"2019-10-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"date_updated":"2025-04-15T07:10:23Z","day":"01","type":"conference","year":"2019","publication_identifier":{"isbn":["9781728150239"]},"title":"Detecting visual relationships using box attention","citation":{"mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 1749–1753, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>.","ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., &#38; Ferrari, V. (2019). Detecting visual relationships using box attention. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>.","ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019."},"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.02136"}],"conference":{"location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","start_date":"2019-10-27"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","ec_funded":1,"abstract":[{"text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results.","lang":"eng"}],"_id":"7640","date_created":"2020-04-05T22:00:51Z","scopus_import":"1","quality_controlled":"1","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","month":"10","status":"public","oa":1,"isi":1},{"author":[{"last_name":"Biniaz","full_name":"Biniaz, Ahmad","first_name":"Ahmad"},{"first_name":"Kshitij","last_name":"Jain","full_name":"Jain, Kshitij"},{"first_name":"Anna","full_name":"Lubiw, Anna","last_name":"Lubiw"},{"orcid":"0000-0002-6660-1322","last_name":"Masárová","full_name":"Masárová, Zuzana","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Miltzow","full_name":"Miltzow, Tillmann","first_name":"Tillmann"},{"last_name":"Mondal","full_name":"Mondal, Debajyoti","first_name":"Debajyoti"},{"first_name":"Anurag Murty","full_name":"Naredla, Anurag Murty","last_name":"Naredla"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"},{"first_name":"Alexi","last_name":"Turcotte","full_name":"Turcotte, Alexi"}],"day":"16","date_updated":"2026-04-08T07:23:00Z","year":"2019","type":"preprint","doi":"10.48550/arXiv.1903.06981","language":[{"iso":"eng"}],"date_published":"2019-03-16T00:00:00Z","oa_version":"Preprint","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.06981"}],"external_id":{"arxiv":["1903.06981"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1903.06981\">https://doi.org/10.48550/arXiv.1903.06981</a>.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1903.06981\">10.48550/arXiv.1903.06981</a>","ieee":"A. Biniaz <i>et al.</i>, “Token swapping on trees,” <i>arXiv</i>. .","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1903.06981\">https://doi.org/10.48550/arXiv.1903.06981</a>","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” <i>ArXiv</i>, 1903.06981, doi:<a href=\"https://doi.org/10.48550/arXiv.1903.06981\">10.48550/arXiv.1903.06981</a>.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.)."},"title":"Token swapping on trees","related_material":{"record":[{"id":"12833","status":"public","relation":"later_version"},{"id":"7944","relation":"dissertation_contains","status":"public"}]},"date_created":"2020-06-08T12:25:25Z","_id":"7950","abstract":[{"lang":"eng","text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex.  The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete.  We present some partial results:\r\n1.  An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2.  Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3.  Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3.  A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars.  In this version, tokens and  vertices  have  colours,  and  colours  have  weights.   The  goal  is  to  get  every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved."}],"arxiv":1,"status":"public","oa":1,"month":"03","publication":"arXiv","article_number":"1903.06981","publication_status":"draft"},{"doi":"10.1523/JNEUROSCI.1059-18.2018","author":[{"first_name":"Guillaume","full_name":"Trébuchet, Guillaume","last_name":"Trébuchet"},{"last_name":"Cattenoz","full_name":"Cattenoz, Pierre B","first_name":"Pierre B"},{"first_name":"János","last_name":"Zsámboki","full_name":"Zsámboki, János"},{"full_name":"Mazaud, David","last_name":"Mazaud","first_name":"David"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","full_name":"Siekhaus, Daria E","last_name":"Siekhaus","orcid":"0000-0001-8323-8353"},{"full_name":"Fanto, Manolis","last_name":"Fanto","first_name":"Manolis"},{"first_name":"Angela","last_name":"Giangrande","full_name":"Giangrande, Angela"}],"file":[{"content_type":"application/pdf","file_size":9455414,"file_id":"8596","access_level":"open_access","relation":"main_file","checksum":"8f6925eb4cd1e8747d8ea25929c68de6","creator":"dernst","file_name":"2019_JournNeuroscience_Trebuchet.pdf","date_updated":"2020-10-02T09:33:28Z","success":1,"date_created":"2020-10-02T09:33:28Z"}],"oa_version":"Published Version","external_id":{"isi":["000455189900006"],"pmid":["30504274"]},"pmid":1,"issue":"2","publication_status":"published","intvolume":"        39","year":"2019","type":"journal_article","file_date_updated":"2020-10-02T09:33:28Z","date_updated":"2025-04-15T06:52:10Z","day":"09","department":[{"_id":"DaSi"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2019-01-09T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","project":[{"call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077"}],"volume":39,"title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","citation":{"ista":"Trébuchet G, Cattenoz PB, Zsámboki J, Mazaud D, Siekhaus DE, Fanto M, Giangrande A. 2019. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. 39(2), 238–255.","mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>.","short":"G. Trébuchet, P.B. Cattenoz, J. Zsámboki, D. Mazaud, D.E. Siekhaus, M. Fanto, A. Giangrande, Journal of Neuroscience 39 (2019) 238–255.","ama":"Trébuchet G, Cattenoz PB, Zsámboki J, et al. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. 2019;39(2):238-255. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>","chicago":"Trébuchet, Guillaume, Pierre B Cattenoz, János Zsámboki, David Mazaud, Daria E Siekhaus, Manolis Fanto, and Angela Giangrande. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2019. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>.","ieee":"G. Trébuchet <i>et al.</i>, “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” <i>Journal of Neuroscience</i>, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.","apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., &#38; Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>"},"_id":"8","publist_id":"8048","scopus_import":"1","date_created":"2018-12-11T11:44:07Z","page":"238-255","ec_funded":1,"acknowledgement":"This work was supported by INSERM, CNRS, UDS, Ligue Régionale contre le Cancer, Hôpital de Strasbourg, Association pour la Recherche sur le Cancer (ARC) and Agence Nationale de la Recherche (ANR) grants. P.B.C. was funded by the ANR and by the ARSEP (Fondation pour l'Aide à la Recherche sur la Sclérose en Plaques), and G.T. by governmental and ARC fellowships. This work was also supported by grants from the Ataxia UK (2491) and the NC3R (NC/L000199/1) awarded to M.F. The Institut de Génétique et de Biologie Moléculaire et Cellulaire was also supported by a French state fund through the ANR labex. D.E.S. was funded by Marie Curie Grant CIG 334077/IRTIM. We thank B. Altenhein, K. Brückner, M. Crozatier, L. Waltzer, M. Logan, E. Kurant, R. Reuter, E. Kurucz, J.L Dimarcq, J. Hoffmann, C. Goodman, the DHSB, and the BDSC for reagents and flies. We also thank all of the laboratory members for comments on the manuscript; C. Diebold, C. Delaporte, M. Pezze, the fly, and imaging and antibody facilities for technical assistance; and D. Dembele for help with statistics. In addition, we thank Alison Brewer for help with Luciferase assays.","article_type":"original","abstract":[{"text":"Despite their different origins, Drosophila glia and hemocytes are related cell populations that provide an immune function. Drosophila hemocytes patrol the body cavity and act as macrophages outside the nervous system whereas glia originate from the neuroepithelium and provide the scavenger population of the nervous system. Drosophila glia are hence the functional orthologs of vertebrate microglia, even though the latter are cells of immune origin that subsequently move into the brain during development. Interestingly, the Drosophila immune cells within (glia) and outside the nervous system (hemocytes) require the same transcription factor Glide/Gcm for their development. This raises the issue of how do glia specifically differentiate in the nervous system and hemocytes in the procephalic mesoderm. The Repo homeodomain transcription factor and pan-glial direct target of Glide/Gcm is known to ensure glial terminal differentiation. Here we show that Repo also takes center stage in the process that discriminates between glia and hemocytes. First, Repo expression is repressed in the hemocyte anlagen by mesoderm-specific factors. Second, Repo ectopic activation in the procephalic mesoderm is sufficient to repress the expression of hemocyte-specific genes. Third, the lack of Repo triggers the expression of hemocyte markers in glia. Thus, a complex network of tissue-specific cues biases the potential of Glide/Gcm. These data allow us to revise the concept of fate determinants and help us understand the bases of cell specification. Both sexes were analyzed.SIGNIFICANCE STATEMENTDistinct cell types often require the same pioneer transcription factor, raising the issue of how does one factor trigger different fates. In Drosophila, glia and hemocytes provide a scavenger activity within and outside the nervous system, respectively. While they both require the Glide/Gcm transcription factor, glia originate from the ectoderm, hemocytes from the mesoderm. Here we show that tissue-specific factors inhibit the gliogenic potential of Glide/Gcm in the mesoderm by repressing the expression of the homeodomain protein Repo, a major glial-specific target of Glide/Gcm. Repo expression in turn inhibits the expression of hemocyte-specific genes in the nervous system. These cell-specific networks secure the establishment of the glial fate only in the nervous system and allow cell diversification.","lang":"eng"}],"publisher":"Society for Neuroscience","isi":1,"month":"01","publication":"Journal of Neuroscience","oa":1,"status":"public","quality_controlled":"1","ddc":["570"]},{"publication_status":"published","issue":"2","intvolume":"       368","external_id":{"isi":["000467796800007"]},"file":[{"creator":"dernst","file_name":"2018_CommunMathPhys_Deuchert.pdf","date_created":"2018-12-17T10:34:06Z","date_updated":"2020-07-14T12:48:07Z","checksum":"c7e9880b43ac726712c1365e9f2f73a6","file_size":893902,"file_id":"5688","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"author":[{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Deuchert, Andreas","last_name":"Deuchert","orcid":"0000-0003-3146-6746"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"doi":"10.1007/s00220-018-3239-0","oa_version":"Published Version","status":"public","oa":1,"publication":"Communications in Mathematical Physics","month":"06","isi":1,"quality_controlled":"1","ddc":["530"],"page":"723-776","scopus_import":"1","date_created":"2018-12-11T11:44:31Z","publist_id":"7974","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"80","publisher":"Springer","article_type":"original","abstract":[{"lang":"eng","text":"We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer."}],"ec_funded":1,"article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Deuchert, A., Seiringer, R., &#38; Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2. Springer, pp. 723–776, 2019.","chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>.","ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. 2019;368(2):723-776. doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>","short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776.","ista":"Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 368(2), 723–776.","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>."},"title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","volume":368,"project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"day":"01","date_updated":"2025-04-14T07:27:00Z","file_date_updated":"2020-07-14T12:48:07Z","year":"2019","type":"journal_article","date_published":"2019-06-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"has_accepted_license":"1"},{"publisher":"Formal Power Series and Algebraic Combinatorics","acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","abstract":[{"text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices.","lang":"eng"}],"ec_funded":1,"scopus_import":"1","date_created":"2020-07-26T22:01:04Z","_id":"8175","quality_controlled":"1","oa":1,"status":"public","publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","month":"07","date_published":"2019-07-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:17:18Z","day":"01","year":"2019","type":"conference","citation":{"ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics; 2019.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics, 2019.","apa":"Betea, D., Bouttier, J., Nejjar, P., &#38; Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, Ljubljana, Slovenia, 2019.","ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, 34, Formal Power Series and Algebraic Combinatorics, 2019.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019."},"title":"New edge asymptotics of skew Young diagrams via free boundaries","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"},{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2019-07-01","location":"Ljubljana, Slovenia","end_date":"2019-07-05","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics"},"main_file_link":[{"url":"https://arxiv.org/abs/1902.08750","open_access":"1"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"article_number":"34","publication_status":"published","oa_version":"Preprint","author":[{"first_name":"Dan","last_name":"Betea","full_name":"Betea, Dan"},{"last_name":"Bouttier","full_name":"Bouttier, Jérémie","first_name":"Jérémie"},{"last_name":"Nejjar","full_name":"Nejjar, Peter","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vuletíc, Mirjana","last_name":"Vuletíc","first_name":"Mirjana"}],"external_id":{"arxiv":["1902.08750"]}},{"department":[{"_id":"UlWa"}],"oa_version":"Preprint","date_published":"2019-10-28T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.1910.12628","type":"preprint","year":"2019","author":[{"last_name":"Avvakumov","orcid":"0000-0002-7840-5062","full_name":"Avvakumov, Sergey","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kudrya, Sergey","last_name":"Kudrya","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67","first_name":"Sergey"}],"date_updated":"2026-04-08T07:25:54Z","day":"28","project":[{"grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"Vanishing of all equivariant obstructions and the mapping degree","related_material":{"record":[{"id":"11446","status":"public","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"8156"}]},"citation":{"ista":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628.","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>, 1910.12628, doi:<a href=\"https://doi.org/10.48550/arXiv.1910.12628\">10.48550/arXiv.1910.12628</a>.","short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.).","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” <i>arXiv</i>. .","apa":"Avvakumov, S., &#38; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1910.12628\">https://doi.org/10.48550/arXiv.1910.12628</a>","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1910.12628\">10.48550/arXiv.1910.12628</a>","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1910.12628\">https://doi.org/10.48550/arXiv.1910.12628</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1910.12628"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.12628"}],"article_processing_charge":"No","arxiv":1,"abstract":[{"lang":"eng","text":"Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in {\\mathbb R}\\}$.\r\n  Previously, the special cases of this statement for certain $X$ were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We\r\ntake a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$ of $(n-1)$-simplex to itself.  Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result  applying it to one such question, a specific instance of envy-free division problem."}],"_id":"8182","date_created":"2020-07-30T10:45:08Z","corr_author":"1","publication_status":"draft","article_number":"1910.12628","publication":"arXiv","month":"10","oa":1,"status":"public"},{"main_file_link":[{"url":"https://arxiv.org/abs/1908.08731","open_access":"1"}],"article_processing_charge":"No","external_id":{"arxiv":["1908.08731"],"isi":["000986519600004"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Avvakumov, S., Karasev, R., &#38; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1908.08731\">https://doi.org/10.48550/arXiv.1908.08731</a>","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1908.08731\">https://doi.org/10.48550/arXiv.1908.08731</a>.","ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1908.08731\">10.48550/arXiv.1908.08731</a>","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” <i>arXiv</i>. .","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731.","mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>, 1908.08731, doi:<a href=\"https://doi.org/10.48550/arXiv.1908.08731\">10.48550/arXiv.1908.08731</a>."},"related_material":{"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"title":"Stronger counterexamples to the topological Tverberg conjecture","project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory"}],"author":[{"first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","orcid":"0000-0002-7840-5062","full_name":"Avvakumov, Sergey"},{"first_name":"R.","last_name":"Karasev","full_name":"Karasev, R."},{"first_name":"A.","last_name":"Skopenkov","full_name":"Skopenkov, A."}],"day":"23","date_updated":"2026-04-08T07:25:54Z","type":"preprint","year":"2019","doi":"10.48550/arXiv.1908.08731","language":[{"iso":"eng"}],"date_published":"2019-08-23T00:00:00Z","oa_version":"Preprint","department":[{"_id":"UlWa"}],"status":"public","oa":1,"month":"08","publication":"arXiv","isi":1,"publication_status":"draft","article_number":"1908.08731","date_created":"2020-07-30T10:45:34Z","_id":"8184","abstract":[{"lang":"eng","text":"Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if r is not a prime power and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this further (for d large compared to r): If r is not a prime power and N := (d+ 1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the r-fold van Kampen–Flores conjecture we also produce counterexamples which are stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the Ozaydin theorem on existence of equivariant maps. "}],"acknowledgement":"We would like to thank F. Frick for helpful discussions","arxiv":1},{"oa_version":"Preprint","language":[{"iso":"eng"}],"date_published":"2019-07-25T00:00:00Z","department":[{"_id":"UlWa"}],"day":"25","date_updated":"2026-04-08T07:25:54Z","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey","last_name":"Avvakumov","orcid":"0000-0002-7840-5062"},{"first_name":"Roman","full_name":"Karasev, Roman","last_name":"Karasev"}],"doi":"10.48550/arXiv.1907.11183","type":"preprint","year":"2019","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8156"}],"link":[{"relation":"later_version","url":"https://doi.org/10.1112/mtk.12059"}]},"title":"Envy-free division using mapping degree","citation":{"short":"S. Avvakumov, R. Karasev, ArXiv (n.d.).","mla":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” <i>ArXiv</i>, 1907.11183, doi:<a href=\"https://doi.org/10.48550/arXiv.1907.11183\">10.48550/arXiv.1907.11183</a>.","ista":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.","apa":"Avvakumov, S., &#38; Karasev, R. (n.d.). Envy-free division using mapping degree. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1907.11183\">https://doi.org/10.48550/arXiv.1907.11183</a>","ieee":"S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” <i>arXiv</i>. .","ama":"Avvakumov S, Karasev R. Envy-free division using mapping degree. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1907.11183\">10.48550/arXiv.1907.11183</a>","chicago":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1907.11183\">https://doi.org/10.48550/arXiv.1907.11183</a>."},"project":[{"grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1907.11183","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1907.11183"]},"arxiv":1,"abstract":[{"text":"In this paper we study envy-free division problems. The classical approach to some of such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions when this map hits the center of the simplex. The mere continuity is not sufficient for such a conclusion, the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem) is a certain boundary condition.\r\n  We follow Erel Segal-Halevi, Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the economic meaning of possibility for a player to prefer an empty part in the segment\r\npartition problem. We solve the problem positively when $n$, the number of players that divide the segment, is a prime power, and we provide counterexamples for every $n$ which is not a prime power. We also provide counterexamples relevant to a wider class of fair or envy-free partition problems when $n$ is odd and not a prime power.","lang":"eng"}],"_id":"8185","date_created":"2020-07-30T10:45:51Z","publication":"arXiv","month":"07","status":"public","oa":1,"corr_author":"1","article_number":"1907.11183","publication_status":"draft"},{"edition":"4","publication_status":"published","doi":"10.1002/9781119487845.ch4","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alison","full_name":"Etheridge, Alison","last_name":"Etheridge"}],"oa_version":"None","external_id":{"isi":["000261343000003"]},"editor":[{"first_name":"David","full_name":"Balding, David","last_name":"Balding"},{"first_name":"Ida","full_name":"Moltke, Ida","last_name":"Moltke"},{"full_name":"Marioni, John","last_name":"Marioni","first_name":"John"}],"page":"115-144","scopus_import":"1","date_created":"2020-08-21T04:25:39Z","_id":"8281","abstract":[{"text":"We review the history of population genetics, starting with its origins a century ago from the synthesis between Mendel and Darwin's ideas, through to the recent development of sophisticated schemes of inference from sequence data, based on the coalescent. We explain the close relation between the coalescent and a diffusion process, which we illustrate by their application to understand spatial structure. We summarise the powerful methods available for analysis of multiple loci, when linkage equilibrium can be assumed, and then discuss approaches to the more challenging case, where associations between alleles require that we follow genotype, rather than allele, frequencies. Though we can hardly cover the whole of population genetics, we give an overview of the current state of the subject, and future challenges to it.","lang":"eng"}],"publisher":"Wiley","isi":1,"status":"public","month":"07","publication":"Handbook of statistical genomics","quality_controlled":"1","ddc":["576"],"publication_identifier":{"isbn":["9781119429142"]},"year":"2019","type":"book_chapter","day":"29","date_updated":"2024-10-21T06:02:39Z","department":[{"_id":"NiBa"}],"date_published":"2019-07-29T00:00:00Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","citation":{"short":"N.H. Barton, A. Etheridge, in:, D. Balding, I. Moltke, J. Marioni (Eds.), Handbook of Statistical Genomics, 4th ed., Wiley, 2019, pp. 115–144.","mla":"Barton, Nicholas H., and Alison Etheridge. “Mathematical Models in Population Genetics.” <i>Handbook of Statistical Genomics</i>, edited by David Balding et al., 4th ed., Wiley, 2019, pp. 115–44, doi:<a href=\"https://doi.org/10.1002/9781119487845.ch4\">10.1002/9781119487845.ch4</a>.","ista":"Barton NH, Etheridge A. 2019.Mathematical models in population genetics. In: Handbook of statistical genomics. , 115–144.","chicago":"Barton, Nicholas H, and Alison Etheridge. “Mathematical Models in Population Genetics.” In <i>Handbook of Statistical Genomics</i>, edited by David Balding, Ida Moltke, and John Marioni, 4th ed., 115–44. Wiley, 2019. <a href=\"https://doi.org/10.1002/9781119487845.ch4\">https://doi.org/10.1002/9781119487845.ch4</a>.","ieee":"N. H. Barton and A. Etheridge, “Mathematical models in population genetics,” in <i>Handbook of statistical genomics</i>, 4th ed., D. Balding, I. Moltke, and J. Marioni, Eds. Wiley, 2019, pp. 115–144.","ama":"Barton NH, Etheridge A. Mathematical models in population genetics. In: Balding D, Moltke I, Marioni J, eds. <i>Handbook of Statistical Genomics</i>. 4th ed. Wiley; 2019:115-144. doi:<a href=\"https://doi.org/10.1002/9781119487845.ch4\">10.1002/9781119487845.ch4</a>","apa":"Barton, N. H., &#38; Etheridge, A. (2019). Mathematical models in population genetics. In D. Balding, I. Moltke, &#38; J. Marioni (Eds.), <i>Handbook of statistical genomics</i> (4th ed., pp. 115–144). Wiley. <a href=\"https://doi.org/10.1002/9781119487845.ch4\">https://doi.org/10.1002/9781119487845.ch4</a>"},"title":"Mathematical models in population genetics"},{"date_published":"2019-05-25T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"day":"25","date_updated":"2026-06-18T19:33:41Z","publication_identifier":{"eissn":["2398-7340"]},"year":"2019","type":"conference","citation":{"mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair, 2019, pp. 14–40, doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>.","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.","short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 14–40.","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair; 2019:14-40. doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>","chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In <i>EPiC Series in Computing</i>, 61:14–40. EasyChair, 2019. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>."},"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","volume":61,"conference":{"start_date":"2019-04-15","location":"Montreal, Canada","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15"},"main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/open/1gbP"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"EasyChair","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot 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 provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.</jats:p>"}],"date_created":"2020-09-26T14:23:54Z","scopus_import":"1","page":"14-40","_id":"8570","quality_controlled":"1","ddc":["000"],"oa":1,"status":"public","publication":"EPiC Series in Computing","month":"05","corr_author":"1","oa_version":"Published Version","author":[{"last_name":"Althoff","full_name":"Althoff, Matthias","first_name":"Matthias"},{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"first_name":"Rajarshi","full_name":"Ray, Rajarshi","last_name":"Ray"},{"orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schupp, Stefan","last_name":"Schupp","first_name":"Stefan"}],"doi":"10.29007/bj1w","intvolume":"        61","publication_status":"published"}]