[{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","publication_status":"published","citation":{"ieee":"D. Degraen, M. Piovarci, B. Bickel, and A. Kruger, “Capturing tactile properties of real surfaces for haptic reproduction,” in <i>34th Annual ACM Symposium</i>, Virtual, 2021, pp. 954–971.","ama":"Degraen D, Piovarci M, Bickel B, Kruger A. Capturing tactile properties of real surfaces for haptic reproduction. In: <i>34th Annual ACM Symposium</i>. Association for Computing Machinery; 2021:954-971. doi:<a href=\"https://doi.org/10.1145/3472749.3474798\">10.1145/3472749.3474798</a>","apa":"Degraen, D., Piovarci, M., Bickel, B., &#38; Kruger, A. (2021). Capturing tactile properties of real surfaces for haptic reproduction. In <i>34th Annual ACM Symposium</i> (pp. 954–971). Virtual: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3472749.3474798\">https://doi.org/10.1145/3472749.3474798</a>","ista":"Degraen D, Piovarci M, Bickel B, Kruger A. 2021. Capturing tactile properties of real surfaces for haptic reproduction. 34th Annual ACM Symposium. UIST: User Interface Software and Technology, 954–971.","chicago":"Degraen, Donald, Michael Piovarci, Bernd Bickel, and Antonio Kruger. “Capturing Tactile Properties of Real Surfaces for Haptic Reproduction.” In <i>34th Annual ACM Symposium</i>, 954–71. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3472749.3474798\">https://doi.org/10.1145/3472749.3474798</a>.","mla":"Degraen, Donald, et al. “Capturing Tactile Properties of Real Surfaces for Haptic Reproduction.” <i>34th Annual ACM Symposium</i>, Association for Computing Machinery, 2021, pp. 954–71, doi:<a href=\"https://doi.org/10.1145/3472749.3474798\">10.1145/3472749.3474798</a>.","short":"D. Degraen, M. Piovarci, B. Bickel, A. Kruger, in:, 34th Annual ACM Symposium, Association for Computing Machinery, 2021, pp. 954–971."},"scopus_import":"1","month":"10","_id":"10148","page":"954-971","quality_controlled":"1","year":"2021","publisher":"Association for Computing Machinery","date_published":"2021-10-10T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1145/3472749.3474798","file":[{"file_size":29796364,"content_type":"application/pdf","date_updated":"2021-10-18T07:36:03Z","file_name":"degraen-UIST2021_Texture_Appropriation_CR_preprint.pdf","access_level":"open_access","checksum":"b0b26464df79b3a59e8ed82e4e19ab15","file_id":"10149","relation":"main_file","creator":"bbickel","date_created":"2021-10-18T07:36:03Z"}],"oa":1,"author":[{"last_name":"Degraen","full_name":"Degraen, Donald","first_name":"Donald"},{"orcid":"0000-0002-5062-4474","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","first_name":"Michael","full_name":"Piovarci, Michael","last_name":"Piovarci"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","last_name":"Bickel"},{"first_name":"Antonio","full_name":"Kruger, Antonio","last_name":"Kruger"}],"abstract":[{"lang":"eng","text":"Tactile feedback of an object’s surface enables us to discern its material properties and affordances. This understanding is used in digital fabrication processes by creating objects with high-resolution surface variations to influence a user’s tactile perception. As the design of such surface haptics commonly relies on knowledge from real-life experiences, it is unclear how to adapt this information for digital design methods. In this work, we investigate replicating the haptics of real materials. Using an existing process for capturing an object’s microgeometry, we digitize and reproduce the stable surface information of a set of 15 fabric samples. In a psychophysical experiment, we evaluate the tactile qualities of our set of original samples and their replicas. From our results, we see that direct reproduction of surface variations is able to influence different psychophysical dimensions of the tactile perception of surface textures. While the fabrication process did not preserve all properties, our approach underlines that replication of surface microgeometries benefits fabrication methods in terms of haptic perception by covering a large range of tactile variations. Moreover, by changing the surface structure of a single fabricated material, its material perception can be influenced. We conclude by proposing strategies for capturing and reproducing digitized textures to better resemble the perceived haptics of the originals."}],"oa_version":"Preprint","date_updated":"2025-03-31T15:58:15Z","ddc":["000"],"day":"10","title":"Capturing tactile properties of real surfaces for haptic reproduction","department":[{"_id":"BeBi"}],"project":[{"name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"642841"}],"has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-8635-7"]},"ec_funded":1,"conference":{"location":"Virtual","start_date":"2021-10-10","name":"UIST: User Interface Software and Technology","end_date":"2021-10-14"},"publication":"34th Annual ACM Symposium","acknowledgement":"Our gratitude goes out to Kamila Mushkina, Akhmajon Makhsadov, Jordan Espenshade, Bruno Fruchard, Roland Bennewitz, and Robert Drumm. This project has received funding from the EU’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO).","date_created":"2021-10-18T07:36:11Z","status":"public","file_date_updated":"2021-10-18T07:36:03Z","article_processing_charge":"No"},{"_id":"10153","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"month":"10","scopus_import":"1","type":"journal_article","volume":5,"citation":{"chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>.","ista":"Mühlböck F, Tate R. 2021. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 5, 127.","mla":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, 127, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>.","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","apa":"Mühlböck, F., &#38; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>","ama":"Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5. doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5. Association for Computing Machinery, 2021."},"publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"article_type":"original","language":[{"iso":"eng"}],"doi":"10.1145/3485504","date_published":"2021-10-15T00:00:00Z","publisher":"Association for Computing Machinery","oa":1,"file":[{"file_id":"10154","access_level":"open_access","checksum":"71011efd2da771cafdec7f0d9693f8c1","file_name":"monnom-oopsla21.pdf","date_updated":"2021-10-19T12:52:23Z","content_type":"application/pdf","file_size":770269,"date_created":"2021-10-19T12:52:23Z","relation":"main_file","creator":"fmuehlbo","success":1}],"year":"2021","quality_controlled":"1","project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","day":"15","ddc":["005"],"title":"Transitioning from structural to nominal code with efficient gradual typing","abstract":[{"text":"Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical untyped patterns, and some research investigating gradually removing types from code exhibiting typical typed patterns. This paper investigates how to extend these established gradual-typing concepts to give formal guarantees not only about how to change types as code evolves but also about how to change such programming patterns as well.\r\n\r\nIn particular, we explore mixing untyped \"structural\" code with typed \"nominal\" code in an object-oriented language. But whereas previous work only allowed \"nominal\" objects to be treated as \"structural\" objects, we also allow \"structural\" objects to dynamically acquire certain nominal types, namely interfaces. We present a calculus that supports such \"cross-paradigm\" code migration and interoperation in a manner satisfying both the static and dynamic gradual guarantees, and demonstrate that the calculus can be implemented efficiently.","lang":"eng"}],"date_updated":"2025-04-15T06:25:55Z","intvolume":"         5","article_number":"127","oa_version":"Published Version","author":[{"orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","full_name":"Mühlböck, Fabian","last_name":"Mühlböck"},{"last_name":"Tate","full_name":"Tate, Ross","first_name":"Ross"}],"article_processing_charge":"No","acknowledgement":"We thank the reviewers for their valuable suggestions towards improving the paper. We also \r\nthank Mae Milano and Adrian Sampson, as well as the members of the Programming Languages Discussion Group at Cornell University and of the Programming Research Laboratory at Northeastern University, for their helpful feedback on preliminary findings of this work.\r\n\r\nThis material is based upon work supported in part by the National Science Foundation (NSF) through grant CCF-1350182 and the Austrian Science Fund (FWF) through grant Z211-N23 (Wittgenstein~Award).\r\nAny opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF or the FWF.","status":"public","file_date_updated":"2021-10-19T12:52:23Z","date_created":"2021-10-19T12:48:44Z","publication":"Proceedings of the ACM on Programming Languages","publication_identifier":{"eissn":["2475-1421"]},"conference":{"end_date":"2021-10-23","name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","location":"Chicago, IL, United States","start_date":"2021-10-17"}},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","citation":{"apa":"Appel, L.-M., Franke, V., Bruno, M., Grishkovskaya, I., Kasiliauskaite, A., Kaufmann, T., … Slade, D. (2021). PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-26360-2\">https://doi.org/10.1038/s41467-021-26360-2</a>","ama":"Appel L-M, Franke V, Bruno M, et al. PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-26360-2\">10.1038/s41467-021-26360-2</a>","ieee":"L.-M. Appel <i>et al.</i>, “PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","short":"L.-M. Appel, V. Franke, M. Bruno, I. Grishkovskaya, A. Kasiliauskaite, T. Kaufmann, U.E. Schoeberl, M.G. Puchinger, S. Kostrhon, C. Ebenwaldner, M. Sebesta, E. Beltzung, K. Mechtler, G. Lin, A. Vlasova, M. Leeb, R. Pavri, A. Stark, A. Akalin, R. Stefl, C. Bernecky, K. Djinovic-Carugo, D. Slade, Nature Communications 12 (2021).","chicago":"Appel, Lisa-Marie, Vedran Franke, Melania Bruno, Irina Grishkovskaya, Aiste Kasiliauskaite, Tanja Kaufmann, Ursula E. Schoeberl, et al. “PHF3 Regulates Neuronal Gene Expression through the Pol II CTD Reader Domain SPOC.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-26360-2\">https://doi.org/10.1038/s41467-021-26360-2</a>.","ista":"Appel L-M, Franke V, Bruno M, Grishkovskaya I, Kasiliauskaite A, Kaufmann T, Schoeberl UE, Puchinger MG, Kostrhon S, Ebenwaldner C, Sebesta M, Beltzung E, Mechtler K, Lin G, Vlasova A, Leeb M, Pavri R, Stark A, Akalin A, Stefl R, Bernecky C, Djinovic-Carugo K, Slade D. 2021. PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. Nature Communications. 12(1), 6078.","mla":"Appel, Lisa-Marie, et al. “PHF3 Regulates Neuronal Gene Expression through the Pol II CTD Reader Domain SPOC.” <i>Nature Communications</i>, vol. 12, no. 1, 6078, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-26360-2\">10.1038/s41467-021-26360-2</a>."},"volume":12,"type":"journal_article","scopus_import":"1","month":"10","_id":"10163","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"external_id":{"isi":["000709050300001"]},"quality_controlled":"1","year":"2021","file":[{"date_created":"2021-10-21T13:51:49Z","success":1,"creator":"cchlebak","relation":"main_file","file_name":"2021_NatComm_Appel.pdf","access_level":"open_access","checksum":"d99fcd51aebde19c21314e3de0148007","file_id":"10169","file_size":5111706,"content_type":"application/pdf","date_updated":"2021-10-21T13:51:49Z"}],"oa":1,"publisher":"Springer Nature","doi":"10.1038/s41467-021-26360-2","language":[{"iso":"eng"}],"date_published":"2021-10-19T00:00:00Z","issue":"1","article_type":"original","keyword":["general physics and astronomy","general biochemistry","genetics and molecular biology","general chemistry"],"author":[{"last_name":"Appel","full_name":"Appel, Lisa-Marie","first_name":"Lisa-Marie"},{"first_name":"Vedran","full_name":"Franke, Vedran","last_name":"Franke"},{"full_name":"Bruno, Melania","last_name":"Bruno","first_name":"Melania"},{"last_name":"Grishkovskaya","full_name":"Grishkovskaya, Irina","first_name":"Irina"},{"last_name":"Kasiliauskaite","full_name":"Kasiliauskaite, Aiste","first_name":"Aiste"},{"last_name":"Kaufmann","full_name":"Kaufmann, Tanja","first_name":"Tanja"},{"full_name":"Schoeberl, Ursula E.","last_name":"Schoeberl","first_name":"Ursula E."},{"first_name":"Martin G.","last_name":"Puchinger","full_name":"Puchinger, Martin G."},{"last_name":"Kostrhon","full_name":"Kostrhon, Sebastian","first_name":"Sebastian"},{"last_name":"Ebenwaldner","full_name":"Ebenwaldner, Carmen","first_name":"Carmen"},{"first_name":"Marek","full_name":"Sebesta, Marek","last_name":"Sebesta"},{"first_name":"Etienne","last_name":"Beltzung","full_name":"Beltzung, Etienne"},{"first_name":"Karl","last_name":"Mechtler","full_name":"Mechtler, Karl"},{"first_name":"Gen","full_name":"Lin, Gen","last_name":"Lin"},{"first_name":"Anna","full_name":"Vlasova, Anna","last_name":"Vlasova"},{"last_name":"Leeb","full_name":"Leeb, Martin","first_name":"Martin"},{"last_name":"Pavri","full_name":"Pavri, Rushad","first_name":"Rushad"},{"first_name":"Alexander","last_name":"Stark","full_name":"Stark, Alexander"},{"first_name":"Altuna","last_name":"Akalin","full_name":"Akalin, Altuna"},{"first_name":"Richard","last_name":"Stefl","full_name":"Stefl, Richard"},{"last_name":"Bernecky","full_name":"Bernecky, Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carrie A","orcid":"0000-0003-0893-7036"},{"first_name":"Kristina","full_name":"Djinovic-Carugo, Kristina","last_name":"Djinovic-Carugo"},{"last_name":"Slade","full_name":"Slade, Dea","first_name":"Dea"}],"article_number":"6078","oa_version":"Published Version","date_updated":"2024-10-21T06:02:05Z","intvolume":"        12","abstract":[{"text":"The C-terminal domain (CTD) of the largest subunit of RNA polymerase II (Pol II) is a regulatory hub for transcription and RNA processing. Here, we identify PHD-finger protein 3 (PHF3) as a regulator of transcription and mRNA stability that docks onto Pol II CTD through its SPOC domain. We characterize SPOC as a CTD reader domain that preferentially binds two phosphorylated Serine-2 marks in adjacent CTD repeats. PHF3 drives liquid-liquid phase separation of phosphorylated Pol II, colocalizes with Pol II clusters and tracks with Pol II across the length of genes. PHF3 knock-out or SPOC deletion in human cells results in increased Pol II stalling, reduced elongation rate and an increase in mRNA stability, with marked derepression of neuronal genes. Key neuronal genes are aberrantly expressed in Phf3 knock-out mouse embryonic stem cells, resulting in impaired neuronal differentiation. Our data suggest that PHF3 acts as a prominent effector of neuronal gene regulation by bridging transcription with mRNA decay.","lang":"eng"}],"title":"PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC","ddc":["610"],"day":"19","isi":1,"has_accepted_license":"1","department":[{"_id":"CaBe"}],"publication_identifier":{"eissn":["2041-1723"]},"publication":"Nature Communications","related_material":{"link":[{"url":"https://www.biorxiv.org/content/10.1101/2020.02.11.943159","description":"Preprint ","relation":"earlier_version"}]},"date_created":"2021-10-20T14:40:32Z","status":"public","file_date_updated":"2021-10-21T13:51:49Z","acknowledgement":"D.S. thanks Claudine Kraft, Renée Schroeder, Verena Jantsch, Franz Klein and Peter Schlögelhofer for support. We thank Anita Testa Salmazo for help with purifying Pol II; Matthias Geyer and Robert Düster for sharing DYRK1A kinase; Felix Hartmann and Clemens Plaschka for help with mass photometry; Goran Kokic for design of the arrest assay sequences; Petra van der Lelij for help with generating mESC KO; Maximilian Freilinger for help with the purification of mEGFP-CTD; Stefan Ameres, Nina Fasching and Brian Reichholf for advice on SLAM-seq and for sharing reagents; Laura Gallego Valle for advice regarding LLPS assays; Krzysztof Chylinski for advice regarding CRISPR/Cas9 methodology; VBCF Protein Technologies facility for purifying PHF3 and providing gRNAs and Cas9; VBCF NGS facility for sequencing; Monoclonal antibody facility at the Helmholtz center for Pol II antibodies; Friedrich Propst and Elzbieta Kowalska for advice and for sharing materials; Egon Ogris for sharing materials; Martin Eilers for recommending a ChIP-grade TFIIS antibody; Susanne Opravil, Otto Hudecz, Markus Hartl and Natascha Hartl for mass spectrometry analysis; staff of the X-ray beamlines at the ESRF in Grenoble for their excellent support; Christa Bücker, Anton Meinhart, Clemens Plaschka and members of the Slade lab for critical comments on the manuscript; Life Science Editors for editing assistance. M.B. and D.S. acknowledge support by the FWF-funded DK ‘Chromosome Dynamics’. T.K. is a recipient of the DOC fellowship from the Austrian Academy of Sciences. U.S. is supported by the L’Oreal for Women in Science Austria Fellowship and the Austrian Science Fund (FWF T 795-B30). M.L is supported by the Vienna Science and Technology Fund (WWTF, VRG14-006). R.S. is supported by the Czech Science Foundation (15-17670 S and 21-24460 S), Ministry of Education, Youths and Sports of the Czech Republic (CEITEC 2020 project (LQ1601)), and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement no. 649030); this publication reflects only the author’s view and the Research Executive Agency is not responsible for any use that may be made of the information it contains. M.S. is supported by the Czech Science Foundation (GJ20-21581Y). K.D.C. research is supported by the Austrian Science Fund (FWF) Projects I525 and I1593, P22276, P19060, and W1221, Federal Ministry of Economy, Family and Youth through the initiative ‘Laura Bassi Centres of Expertise’, funding from the Centre of Optimized Structural Studies No. 253275, the Wellcome Trust Collaborative Award (201543/Z/16), COST action BM1405 Non-globular proteins - from sequence to structure, function and application in molecular physiopathology (NGP-NET), the Vienna Science and Technology Fund (WWTF LS17-008), and by the University of Vienna. This project was funded by the MFPL start-up grant, the Vienna Science and Technology Fund (WWTF LS14-001), and the Austrian Science Fund (P31546-B28 and W1258 “DK: Integrative Structural Biology”) to D.S.","article_processing_charge":"No"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","citation":{"mla":"Huylmans, Ann K., et al. “Transitions to Asexuality and Evolution of Gene Expression in Artemia Brine Shrimp.” <i>Proceedings of the Royal Society B: Biological Sciences</i>, vol. 288, no. 1959, 20211720, The Royal Society, 2021, doi:<a href=\"https://doi.org/10.1098/rspb.2021.1720\">10.1098/rspb.2021.1720</a>.","chicago":"Huylmans, Ann K, Ariana Macon, Francisco Hontoria, and Beatriz Vicoso. “Transitions to Asexuality and Evolution of Gene Expression in Artemia Brine Shrimp.” <i>Proceedings of the Royal Society B: Biological Sciences</i>. The Royal Society, 2021. <a href=\"https://doi.org/10.1098/rspb.2021.1720\">https://doi.org/10.1098/rspb.2021.1720</a>.","ista":"Huylmans AK, Macon A, Hontoria F, Vicoso B. 2021. Transitions to asexuality and evolution of gene expression in Artemia brine shrimp. Proceedings of the Royal Society B: Biological Sciences. 288(1959), 20211720.","short":"A.K. Huylmans, A. Macon, F. Hontoria, B. Vicoso, Proceedings of the Royal Society B: Biological Sciences 288 (2021).","ama":"Huylmans AK, Macon A, Hontoria F, Vicoso B. Transitions to asexuality and evolution of gene expression in Artemia brine shrimp. <i>Proceedings of the Royal Society B: Biological Sciences</i>. 2021;288(1959). doi:<a href=\"https://doi.org/10.1098/rspb.2021.1720\">10.1098/rspb.2021.1720</a>","apa":"Huylmans, A. K., Macon, A., Hontoria, F., &#38; Vicoso, B. (2021). Transitions to asexuality and evolution of gene expression in Artemia brine shrimp. <i>Proceedings of the Royal Society B: Biological Sciences</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rspb.2021.1720\">https://doi.org/10.1098/rspb.2021.1720</a>","ieee":"A. K. Huylmans, A. Macon, F. Hontoria, and B. Vicoso, “Transitions to asexuality and evolution of gene expression in Artemia brine shrimp,” <i>Proceedings of the Royal Society B: Biological Sciences</i>, vol. 288, no. 1959. The Royal Society, 2021."},"type":"journal_article","volume":288,"pmid":1,"scopus_import":"1","month":"09","_id":"10166","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"external_id":{"pmid":["34547909"],"isi":["000697643700001"]},"quality_controlled":"1","year":"2021","file":[{"success":1,"relation":"main_file","creator":"cchlebak","date_created":"2021-10-22T11:48:02Z","file_size":995806,"date_updated":"2021-10-22T11:48:02Z","content_type":"application/pdf","access_level":"open_access","checksum":"76e7f253b7040bca2ad76f82bd7c45c0","file_name":"2021_ProRoSocBBioSci_Huylmans.pdf","file_id":"10172"}],"oa":1,"language":[{"iso":"eng"}],"date_published":"2021-09-22T00:00:00Z","publisher":"The Royal Society","doi":"10.1098/rspb.2021.1720","issue":"1959","article_type":"original","keyword":["asexual reproduction","parthenogenesis","sex-biased genes","sexual conflict","automixis","crustaceans"],"author":[{"full_name":"Huylmans, Ann K","last_name":"Huylmans","orcid":"0000-0001-8871-4961","first_name":"Ann K","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87"},{"id":"2A0848E2-F248-11E8-B48F-1D18A9856A87","first_name":"Ariana","last_name":"Macon","full_name":"Macon, Ariana"},{"first_name":"Francisco","last_name":"Hontoria","full_name":"Hontoria, Francisco"},{"first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","last_name":"Vicoso","full_name":"Vicoso, Beatriz"}],"oa_version":"Published Version","article_number":"20211720","date_updated":"2025-04-14T07:41:20Z","intvolume":"       288","abstract":[{"lang":"eng","text":"While sexual reproduction is widespread among many taxa, asexual lineages have repeatedly evolved from sexual ancestors. Despite extensive research on the evolution of sex, it is still unclear whether this switch represents a major transition requiring major molecular reorganization, and how convergent the changes involved are. In this study, we investigated the phylogenetic relationship and patterns of gene expression of sexual and asexual lineages of Eurasian Artemia brine shrimp, to assess how gene expression patterns are affected by the transition to asexuality. We find only a few genes that are consistently associated with the evolution of asexuality, suggesting that this shift may not require an extensive overhauling of the meiotic machinery. While genes with sex-biased expression have high rates of expression divergence within Eurasian Artemia, neither female- nor male-biased genes appear to show unusual evolutionary patterns after sexuality is lost, contrary to theoretical expectations."}],"title":"Transitions to asexuality and evolution of gene expression in Artemia brine shrimp","ddc":["595"],"day":"22","has_accepted_license":"1","isi":1,"department":[{"_id":"BeVi"}],"project":[{"_id":"250BDE62-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution"}],"ec_funded":1,"publication_identifier":{"issn":["0962-8452"],"eissn":["1471-2954"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"publication":"Proceedings of the Royal Society B: Biological Sciences","related_material":{"link":[{"url":"https://doi.org/10.6084/m9.figshare.c.5615488.v1","relation":"supplementary_material"}],"record":[{"status":"public","relation":"research_data","id":"9949"}]},"date_created":"2021-10-21T07:46:06Z","status":"public","file_date_updated":"2021-10-22T11:48:02Z","acknowledgement":"We thank the Vicoso laboratory, Thomas Lenormand and Tanja Schwander for helpful discussions, the group of Gonzalo Gajardo, especially Cristian Gallardo-Escárate and Margarita Parraguez Donoso, for sequencing data and advice, and the IST Scientific Computing Group for their support. This work was supported by the European Research Council under the European Union's Horizon 2020 research and innovation program (grant agreement no. 715257).","article_processing_charge":"Yes (via OA deal)"},{"publication_identifier":{"issn":["0022-2488"]},"publication":"Journal of Mathematical Physics","acknowledgement":"We would like to thank Nils Carqueville, Tobias Dyckerhoff, Jan Hesse, Ehud Meir, Sebastian Novak, Louis-Hadrien Robert, Nick Salter, Walker Stern, and Lukas Woike for helpful discussions and comments. L.S. was supported by the DFG Research Training Group 1670 “Mathematics Inspired by String Theory and Quantum Field Theory.”","main_file_link":[{"url":"https://arxiv.org/abs/1802.09978","open_access":"1"}],"date_created":"2021-10-24T22:01:32Z","status":"public","article_processing_charge":"No","author":[{"first_name":"Ingo","full_name":"Runkel, Ingo","last_name":"Runkel"},{"id":"7943226E-220E-11EA-94C7-D59F3DDC885E","first_name":"Lorant","orcid":"0000-0003-2834-5054","last_name":"Szegedy","full_name":"Szegedy, Lorant"}],"abstract":[{"lang":"eng","text":"We give a combinatorial model for r-spin surfaces with parameterized boundary based on Novak (“Lattice topological field theories in two dimensions,” Ph.D. thesis, Universität Hamburg, 2015). The r-spin structure is encoded in terms of ℤ𝑟-valued indices assigned to the edges of a polygonal decomposition. This combinatorial model is designed for our state-sum construction of two-dimensional topological field theories on r-spin surfaces. We show that an example of such a topological field theory computes the Arf-invariant of an r-spin surface as introduced by Randal-Williams [J. Topol. 7, 155 (2014)] and Geiges et al. [Osaka J. Math. 49, 449 (2012)]. This implies, in particular, that the r-spin Arf-invariant is constant on orbits of the mapping class group, providing an alternative proof of that fact."}],"article_number":"102302","oa_version":"Preprint","date_updated":"2025-07-10T11:49:44Z","intvolume":"        62","day":"01","title":"Topological field theory on r-spin surfaces and the Arf-invariant","department":[{"_id":"MiLe"}],"isi":1,"external_id":{"isi":["000755638500010"],"arxiv":["1802.09978"]},"quality_controlled":"1","year":"2021","doi":"10.1063/5.0037826","language":[{"iso":"eng"}],"publisher":"AIP Publishing","date_published":"2021-10-01T00:00:00Z","issue":"10","oa":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":62,"corr_author":"1","publication_status":"published","citation":{"mla":"Runkel, Ingo, and Lorant Szegedy. “Topological Field Theory on R-Spin Surfaces and the Arf-Invariant.” <i>Journal of Mathematical Physics</i>, vol. 62, no. 10, 102302, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0037826\">10.1063/5.0037826</a>.","chicago":"Runkel, Ingo, and Lorant Szegedy. “Topological Field Theory on R-Spin Surfaces and the Arf-Invariant.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0037826\">https://doi.org/10.1063/5.0037826</a>.","ista":"Runkel I, Szegedy L. 2021. Topological field theory on r-spin surfaces and the Arf-invariant. Journal of Mathematical Physics. 62(10), 102302.","short":"I. Runkel, L. Szegedy, Journal of Mathematical Physics 62 (2021).","ama":"Runkel I, Szegedy L. Topological field theory on r-spin surfaces and the Arf-invariant. <i>Journal of Mathematical Physics</i>. 2021;62(10). doi:<a href=\"https://doi.org/10.1063/5.0037826\">10.1063/5.0037826</a>","apa":"Runkel, I., &#38; Szegedy, L. (2021). Topological field theory on r-spin surfaces and the Arf-invariant. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0037826\">https://doi.org/10.1063/5.0037826</a>","ieee":"I. Runkel and L. Szegedy, “Topological field theory on r-spin surfaces and the Arf-invariant,” <i>Journal of Mathematical Physics</i>, vol. 62, no. 10. AIP Publishing, 2021."},"scopus_import":"1","month":"10","arxiv":1,"_id":"10176"},{"citation":{"ama":"Martín-Sánchez J, Duan J, Taboada-Gutiérrez J, et al. Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. <i>Science Advances</i>. 2021;7(41). doi:<a href=\"https://doi.org/10.1126/sciadv.abj0127\">10.1126/sciadv.abj0127</a>","apa":"Martín-Sánchez, J., Duan, J., Taboada-Gutiérrez, J., Álvarez-Pérez, G., Voronin, K. V., Prieto Gonzalez, I., … Alonso-González, P. (2021). Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.abj0127\">https://doi.org/10.1126/sciadv.abj0127</a>","ieee":"J. Martín-Sánchez <i>et al.</i>, “Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas,” <i>Science Advances</i>, vol. 7, no. 41. American Association for the Advancement of Science, 2021.","ista":"Martín-Sánchez J, Duan J, Taboada-Gutiérrez J, Álvarez-Pérez G, Voronin KV, Prieto Gonzalez I, Ma W, Bao Q, Volkov VS, Hillenbrand R, Nikitin AY, Alonso-González P. 2021. Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas. Science Advances. 7(41), abj0127.","mla":"Martín-Sánchez, Javier, et al. “Focusing of In-Plane Hyperbolic Polaritons in van Der Waals Crystals with Tailored Infrared Nanoantennas.” <i>Science Advances</i>, vol. 7, no. 41, abj0127, American Association for the Advancement of Science, 2021, doi:<a href=\"https://doi.org/10.1126/sciadv.abj0127\">10.1126/sciadv.abj0127</a>.","chicago":"Martín-Sánchez, Javier, Jiahua Duan, Javier Taboada-Gutiérrez, Gonzalo Álvarez-Pérez, Kirill V. Voronin, Ivan Prieto Gonzalez, Weiliang Ma, et al. “Focusing of In-Plane Hyperbolic Polaritons in van Der Waals Crystals with Tailored Infrared Nanoantennas.” <i>Science Advances</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/sciadv.abj0127\">https://doi.org/10.1126/sciadv.abj0127</a>.","short":"J. Martín-Sánchez, J. Duan, J. Taboada-Gutiérrez, G. Álvarez-Pérez, K.V. Voronin, I. Prieto Gonzalez, W. Ma, Q. Bao, V.S. Volkov, R. Hillenbrand, A.Y. Nikitin, P. Alonso-González, Science Advances 7 (2021)."},"publication_status":"published","volume":7,"type":"journal_article","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"10177","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"arxiv":1,"month":"10","scopus_import":"1","year":"2021","quality_controlled":"1","external_id":{"arxiv":["2103.10852"],"isi":["000704912700024"]},"article_type":"original","oa":1,"file":[{"file_size":2441163,"date_updated":"2021-10-27T14:16:06Z","content_type":"application/pdf","checksum":"0a470ef6a47d2b8a96ede4c4d28cfacd","access_level":"open_access","file_name":"2021_ScienceAdv_Martin-Sanchez.pdf","file_id":"10189","success":1,"creator":"cziletti","relation":"main_file","date_created":"2021-10-27T14:16:06Z"}],"issue":"41","publisher":"American Association for the Advancement of Science","date_published":"2021-10-08T00:00:00Z","doi":"10.1126/sciadv.abj0127","language":[{"iso":"eng"}],"date_updated":"2026-04-02T13:15:46Z","intvolume":"         7","oa_version":"Published Version","article_number":"abj0127","abstract":[{"lang":"eng","text":"Phonon polaritons (PhPs)—light coupled to lattice vibrations—with in-plane hyperbolic dispersion exhibit ray-like propagation with large wave vectors and enhanced density of optical states along certain directions on a surface. As such, they have raised a surge of interest, promising unprecedented manipulation of infrared light at the nanoscale in a planar circuitry. Here, we demonstrate focusing of in-plane hyperbolic PhPs propagating along thin slabs of α-MoO3. To that end, we developed metallic nanoantennas of convex geometries for both efficient launching and focusing of the polaritons. The foci obtained exhibit enhanced near-field confinement and absorption compared to foci produced by in-plane isotropic PhPs. Foci sizes as small as λp/4.5 = λ0/50 were achieved (λp is the polariton wavelength and λ0 is the photon wavelength). Focusing of in-plane hyperbolic polaritons introduces a first and most basic building block developing planar polariton optics using in-plane anisotropic van der Waals materials."}],"author":[{"last_name":"Martín-Sánchez","full_name":"Martín-Sánchez, Javier","first_name":"Javier"},{"first_name":"Jiahua","last_name":"Duan","full_name":"Duan, Jiahua"},{"first_name":"Javier","last_name":"Taboada-Gutiérrez","full_name":"Taboada-Gutiérrez, Javier"},{"first_name":"Gonzalo","last_name":"Álvarez-Pérez","full_name":"Álvarez-Pérez, Gonzalo"},{"first_name":"Kirill V.","last_name":"Voronin","full_name":"Voronin, Kirill V."},{"last_name":"Prieto Gonzalez","full_name":"Prieto Gonzalez, Ivan","first_name":"Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7370-5357"},{"full_name":"Ma, Weiliang","last_name":"Ma","first_name":"Weiliang"},{"first_name":"Qiaoliang","last_name":"Bao","full_name":"Bao, Qiaoliang"},{"last_name":"Volkov","full_name":"Volkov, Valentyn S.","first_name":"Valentyn S."},{"full_name":"Hillenbrand, Rainer","last_name":"Hillenbrand","first_name":"Rainer"},{"last_name":"Nikitin","full_name":"Nikitin, Alexey Y.","first_name":"Alexey Y."},{"first_name":"Pablo","last_name":"Alonso-González","full_name":"Alonso-González, Pablo"}],"has_accepted_license":"1","isi":1,"department":[{"_id":"NanoFab"}],"title":"Focusing of in-plane hyperbolic polaritons in van der Waals crystals with tailored infrared nanoantennas","day":"08","ddc":["530"],"publication":"Science Advances","publication_identifier":{"eissn":["2375-2548"]},"article_processing_charge":"Yes","status":"public","file_date_updated":"2021-10-27T14:16:06Z","date_created":"2021-10-24T22:01:33Z","acknowledgement":"J.M.-S. acknowledges financial support from the Ramón y Cajal Program of the Government of Spain and FSE (RYC2018-026196-I) and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-110308GA-I00). P.A.-G. acknowledges support from the European Research Council under starting grant no. 715496, 2DNANOPTICA, and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-111156GB-I00). J.T.-G. acknowledges support through the Severo Ochoa Program from the Government of the Principality of Asturias (PA-18-PF-BP17-126). G.A.-P. acknowledges support through the Severo Ochoa Program from the Government of the Principality of Asturias (PA-20-PF-BP19-053). K.V.V. and V.S.V. acknowledge the financial support from the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-15-2021-606). A.Y.N. acknowledges the Spanish Ministry of Science, Innovation, and Universities (national projects MAT2017-88358-C3-3-R and PID2020-115221GB-C42) and the Basque Department of Education (PIBA-2020-1-0014). R.H. acknowledges financial support from the Spanish Ministry of Science, Innovation, and Universities (national project number RTI2018-094830-B-100 and project number MDM-2016-0618 of the Marie de Maeztu Units of Excellence Program) and the Basque Government (grant number IT1164-19)."},{"year":"2021","quality_controlled":"1","external_id":{"arxiv":["2102.05397"],"isi":["000702042400001"]},"article_type":"original","issue":"9","publisher":"IOP Publishing","doi":"10.1088/1367-2630/ac23f1","language":[{"iso":"eng"}],"date_published":"2021-09-29T00:00:00Z","oa":1,"file":[{"success":1,"creator":"cziletti","relation":"main_file","date_created":"2021-10-28T12:06:01Z","file_size":2215016,"content_type":"application/pdf","date_updated":"2021-10-28T12:06:01Z","file_name":"2021_NewJPhys_Sahu.pdf","access_level":"open_access","checksum":"ace603e8f0962b3ba55f23fa34f57764","file_id":"10193"}],"type":"journal_article","volume":23,"citation":{"ieee":"P. Sahu, J. M. Schwarz, and M. L. Manning, “Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue,” <i>New Journal of Physics</i>, vol. 23, no. 9. IOP Publishing, 2021.","ama":"Sahu P, Schwarz JM, Manning ML. Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. <i>New Journal of Physics</i>. 2021;23(9). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">10.1088/1367-2630/ac23f1</a>","apa":"Sahu, P., Schwarz, J. M., &#38; Manning, M. L. (2021). Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">https://doi.org/10.1088/1367-2630/ac23f1</a>","chicago":"Sahu, Preeti, J. M. Schwarz, and M. Lisa Manning. “Geometric Signatures of Tissue Surface Tension in a Three-Dimensional Model of Confluent Tissue.” <i>New Journal of Physics</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">https://doi.org/10.1088/1367-2630/ac23f1</a>.","mla":"Sahu, Preeti, et al. “Geometric Signatures of Tissue Surface Tension in a Three-Dimensional Model of Confluent Tissue.” <i>New Journal of Physics</i>, vol. 23, no. 9, 093043, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac23f1\">10.1088/1367-2630/ac23f1</a>.","ista":"Sahu P, Schwarz JM, Manning ML. 2021. Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue. New Journal of Physics. 23(9), 093043.","short":"P. Sahu, J.M. Schwarz, M.L. Manning, New Journal of Physics 23 (2021)."},"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"10178","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","month":"09","arxiv":1,"publication":"New Journal of Physics","publication_identifier":{"eissn":["1367-2630"]},"article_processing_charge":"Yes","acknowledgement":"We thank Paula Sanematsu, Matthias Merkel, Daniel Sussman, Cristina Marchetti and Edouard Hannezo for helpful discussions, and M Merkel for developing and sharing the original version of the 3D Voronoi code. This work was primarily funded by NSF-PHY-1607416, NSF-PHY-2014192 , and are in the division of physics at the National Science Foundation. PS and MLM acknowledge additional support from Simons Grant No. 454947.\r\n","file_date_updated":"2021-10-28T12:06:01Z","status":"public","date_created":"2021-10-24T22:01:34Z","abstract":[{"lang":"eng","text":"In dense biological tissues, cell types performing different roles remain segregated by maintaining sharp interfaces. To better understand the mechanisms for such sharp compartmentalization, we study the effect of an imposed heterotypic tension at the interface between two distinct cell types in a fully 3D Voronoi model for confluent tissues. We find that cells rapidly sort and self-organize to generate a tissue-scale interface between cell types, and cells adjacent to this interface exhibit signature geometric features including nematic-like ordering, bimodal facet areas, and registration, or alignment, of cell centers on either side of the two-tissue interface. The magnitude of these features scales directly with the magnitude of the imposed tension, suggesting that biologists can estimate the magnitude of tissue surface tension between two tissue types simply by segmenting a 3D tissue. To uncover the underlying physical mechanisms driving these geometric features, we develop two minimal, ordered models using two different underlying lattices that identify an energetic competition between bulk cell shapes and tissue interface area. When the interface area dominates, changes to neighbor topology are costly and occur less frequently, which generates the observed geometric features."}],"date_updated":"2026-04-02T13:54:56Z","intvolume":"        23","article_number":"093043","oa_version":"Published Version","author":[{"id":"55BA52EE-A185-11EA-88FD-18AD3DDC885E","first_name":"Preeti","full_name":"Sahu, Preeti","last_name":"Sahu"},{"first_name":"J. M.","last_name":"Schwarz","full_name":"Schwarz, J. M."},{"full_name":"Manning, M. Lisa","last_name":"Manning","first_name":"M. Lisa"}],"department":[{"_id":"EdHa"}],"isi":1,"has_accepted_license":"1","day":"29","ddc":["570"],"title":"Geometric signatures of tissue surface tension in a three-dimensional model of confluent tissue"},{"external_id":{"isi":["000708012800001"],"pmid":["34661293"]},"quality_controlled":"1","year":"2021","publisher":"Embo Press","doi":"10.15252/embj.2021108714","date_published":"2021-10-18T00:00:00Z","language":[{"iso":"eng"}],"issue":"23","file":[{"file_name":"2021_EMBO_Bajaj.pdf","access_level":"open_access","checksum":"78d2d02e775322297e774f72810a41a4","file_id":"10541","file_size":7819881,"content_type":"application/pdf","date_updated":"2021-12-13T14:54:14Z","date_created":"2021-12-13T14:54:14Z","success":1,"relation":"main_file","creator":"alisjak"}],"oa":1,"article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":40,"publication_status":"published","citation":{"ista":"Bajaj S, Bagley JA, Sommer CM, Vertesy A, Nagumo Wong S, Krenn V, Lévi-Strauss J, Knoblich JA. 2021. Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. EMBO Journal. 40(23), e108714.","chicago":"Bajaj, Sunanjay, Joshua A. Bagley, Christoph M Sommer, Abel Vertesy, Sakurako Nagumo Wong, Veronica Krenn, Julie Lévi-Strauss, and Juergen A. Knoblich. “Neurotransmitter Signaling Regulates Distinct Phases of Multimodal Human Interneuron Migration.” <i>EMBO Journal</i>. Embo Press, 2021. <a href=\"https://doi.org/10.15252/embj.2021108714\">https://doi.org/10.15252/embj.2021108714</a>.","mla":"Bajaj, Sunanjay, et al. “Neurotransmitter Signaling Regulates Distinct Phases of Multimodal Human Interneuron Migration.” <i>EMBO Journal</i>, vol. 40, no. 23, e108714, Embo Press, 2021, doi:<a href=\"https://doi.org/10.15252/embj.2021108714\">10.15252/embj.2021108714</a>.","short":"S. Bajaj, J.A. Bagley, C.M. Sommer, A. Vertesy, S. Nagumo Wong, V. Krenn, J. Lévi-Strauss, J.A. Knoblich, EMBO Journal 40 (2021).","ieee":"S. Bajaj <i>et al.</i>, “Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration,” <i>EMBO Journal</i>, vol. 40, no. 23. Embo Press, 2021.","apa":"Bajaj, S., Bagley, J. A., Sommer, C. M., Vertesy, A., Nagumo Wong, S., Krenn, V., … Knoblich, J. A. (2021). Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.15252/embj.2021108714\">https://doi.org/10.15252/embj.2021108714</a>","ama":"Bajaj S, Bagley JA, Sommer CM, et al. Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration. <i>EMBO Journal</i>. 2021;40(23). doi:<a href=\"https://doi.org/10.15252/embj.2021108714\">10.15252/embj.2021108714</a>"},"pmid":1,"month":"10","scopus_import":"1","_id":"10179","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"publication":"EMBO Journal","acknowledgement":"We thank all Knoblich laboratory members for continued support and discussions. We thank the IMP/IMBA BioOptics facility, particularly Pawel Pasierbek, Alberto Moreno Cencerrado and Gerald Schmauss, the IMP/IMBA Molecular Biology Service, in particular Robert Heinen, the IMP Bioinformatics facility, in particular Thomas Burkard, the Vienna Biocenter Core Facilities (VBCF) Histopathology facility, in particular Tamara Engelmaier, and the VBCF Next Generation Sequencing Facility, notably Volodymyr Shubchynskyy and Carmen Czepe. We would also like to thank Simon Haendeler for advice on statistical analyses, Jose Guzman for discussions and assistance with slice culture setups, Oliver L. Eichmueller for discussions and assistance with microscopy, and E.H. Gustafson, S. Wolfinger, and D. Reumann for technical assistance regarding generation of cerebral organoids. This project received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie fellowship agreement Nr.707109 awarded to J.A.B. Work in J.A.K.'s laboratory is supported by the Austrian Federal Ministry of Education, Science and Research, the Austrian Academy of Sciences, the City of Vienna, a Research Program of the Austrian Science Fund FWF (SFBF78 Stem Cell, F 7803-B) and a European Research Council (ERC) Advanced Grant under the European 20 Union’s Horizon 2020 program (grant agreement no. 695642).","date_created":"2021-10-24T22:01:34Z","file_date_updated":"2021-12-13T14:54:14Z","status":"public","article_processing_charge":"Yes (in subscription journal)","author":[{"first_name":"Sunanjay","last_name":"Bajaj","full_name":"Bajaj, Sunanjay"},{"last_name":"Bagley","full_name":"Bagley, Joshua A.","first_name":"Joshua A."},{"full_name":"Sommer, Christoph M","last_name":"Sommer","orcid":"0000-0003-1216-9105","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph M"},{"first_name":"Abel","last_name":"Vertesy","full_name":"Vertesy, Abel"},{"full_name":"Nagumo Wong, Sakurako","last_name":"Nagumo Wong","first_name":"Sakurako"},{"full_name":"Krenn, Veronica","last_name":"Krenn","first_name":"Veronica"},{"first_name":"Julie","full_name":"Lévi-Strauss, Julie","last_name":"Lévi-Strauss"},{"full_name":"Knoblich, Juergen A.","last_name":"Knoblich","first_name":"Juergen A."}],"abstract":[{"lang":"eng","text":"Inhibitory GABAergic interneurons migrate over long distances from their extracortical origin into the developing cortex. In humans, this process is uniquely slow and prolonged, and it is unclear whether guidance cues unique to humans govern the various phases of this complex developmental process. Here, we use fused cerebral organoids to identify key roles of neurotransmitter signaling pathways in guiding the migratory behavior of human cortical interneurons. We use scRNAseq to reveal expression of GABA, glutamate, glycine, and serotonin receptors along distinct maturation trajectories across interneuron migration. We develop an image analysis software package, TrackPal, to simultaneously assess 48 parameters for entire migration tracks of individual cells. By chemical screening, we show that different modes of interneuron migration depend on distinct neurotransmitter signaling pathways, linking transcriptional maturation of interneurons with their migratory behavior. Altogether, our study provides a comprehensive quantitative analysis of human interneuron migration and its functional modulation by neurotransmitter signaling."}],"oa_version":"Published Version","article_number":"e108714","intvolume":"        40","date_updated":"2023-08-14T08:05:23Z","ddc":["610"],"day":"18","title":"Neurotransmitter signaling regulates distinct phases of multimodal human interneuron migration","department":[{"_id":"Bio"}],"isi":1,"has_accepted_license":"1"},{"file":[{"date_updated":"2021-10-27T15:34:18Z","content_type":"application/pdf","file_size":3527521,"file_id":"10192","checksum":"3389d9d01fc58f8fb4c1a53e14a8abbf","access_level":"open_access","file_name":"2021_JMachLearnRes_Hoefler.pdf","creator":"cziletti","relation":"main_file","success":1,"date_created":"2021-10-27T15:34:18Z"}],"oa":1,"language":[{"iso":"eng"}],"publisher":"ML Research Press","date_published":"2021-09-01T00:00:00Z","issue":"241","article_type":"original","external_id":{"arxiv":["2102.00554"]},"page":"1-124","quality_controlled":"1","year":"2021","arxiv":1,"scopus_import":"1","month":"09","_id":"10180","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"short":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, A. Krumes, Journal of Machine Learning Research 22 (2021) 1–124.","mla":"Hoefler, Torsten, et al. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” <i>Journal of Machine Learning Research</i>, vol. 22, no. 241, ML Research Press, 2021, pp. 1–124.","chicago":"Hoefler, Torsten, Dan-Adrian Alistarh, Tal Ben-Nun, Nikoli Dryden, and Alexandra Krumes. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” <i>Journal of Machine Learning Research</i>. ML Research Press, 2021.","ista":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Krumes A. 2021. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research. 22(241), 1–124.","apa":"Hoefler, T., Alistarh, D.-A., Ben-Nun, T., Dryden, N., &#38; Krumes, A. (2021). Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. <i>Journal of Machine Learning Research</i>. ML Research Press.","ama":"Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Krumes A. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. <i>Journal of Machine Learning Research</i>. 2021;22(241):1-124.","ieee":"T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and A. Krumes, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” <i>Journal of Machine Learning Research</i>, vol. 22, no. 241. ML Research Press, pp. 1–124, 2021."},"type":"journal_article","corr_author":"1","volume":22,"date_created":"2021-10-24T22:01:34Z","main_file_link":[{"url":"https://www.jmlr.org/papers/v22/21-0366.html","open_access":"1"}],"file_date_updated":"2021-10-27T15:34:18Z","status":"public","acknowledgement":"We thank Doug Burger, Steve Scott, Marco Heddes, and the respective teams at Microsoft for inspiring discussions on the topic. We thank Angelika Steger for uplifting debates about the connections to biological brains, Sidak Pal Singh for his support regarding experimental results, and Utku Evci as well as Xin Wang for comments on previous versions of this\r\nwork. Special thanks go to Bernhard Schölkopf, our JMLR editor Samy Bengio, and the three anonymous reviewers who provided excellent comprehensive, pointed, and deep review comments that improved the quality of our manuscript significantly.","article_processing_charge":"No","publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"publication":"Journal of Machine Learning Research","title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","ddc":["000"],"day":"01","has_accepted_license":"1","department":[{"_id":"DaAl"}],"author":[{"first_name":"Torsten","last_name":"Hoefler","full_name":"Hoefler, Torsten"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Ben-Nun","full_name":"Ben-Nun, Tal","first_name":"Tal"},{"first_name":"Nikoli","last_name":"Dryden","full_name":"Dryden, Nikoli"},{"first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","last_name":"Peste","full_name":"Peste, Elena-Alexandra"}],"oa_version":"Published Version","date_updated":"2025-06-26T11:53:12Z","intvolume":"        22","abstract":[{"text":"The growing energy and performance costs of deep learning have driven the community to reduce the size of neural networks by selectively pruning components. Similarly to their biological counterparts, sparse networks generalize just as well, sometimes even better than, the original dense networks. Sparsity promises to reduce the memory footprint of regular networks to fit mobile devices, as well as shorten training time for ever growing networks. In this paper, we survey prior work on sparsity in deep learning and provide an extensive tutorial of sparsification for both inference and training. We describe approaches to remove and add elements of neural networks, different training strategies to achieve model sparsity, and mechanisms to exploit sparsity in practice. Our work distills ideas from more than 300 research papers and provides guidance to practitioners who wish to utilize sparsity today, as well as to researchers whose goal is to push the frontier forward. We include the necessary background on mathematical methods in sparsification, describe phenomena such as early structure adaptation, the intricate relations between sparsity and the training process, and show techniques for achieving acceleration on real hardware. We also define a metric of pruned parameter efficiency that could serve as a baseline for comparison of different sparse networks. We close by speculating on how sparsity can improve future workloads and outline major open problems in the field.","lang":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":40,"publication_status":"published","citation":{"ieee":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, and N. Pietroni, “Volume decomposition for two-piece rigid casting,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6. Association for Computing Machinery, 2021.","apa":"Alderighi, T., Malomo, L., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2021). Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>","ama":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. 2021;40(6). doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>","short":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 40 (2021).","ista":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. 2021. Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. 40(6), 272.","mla":"Alderighi, Thomas, et al. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6, 272, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>.","chicago":"Alderighi, Thomas, Luigi Malomo, Bernd Bickel, Paolo Cignoni, and Nico Pietroni. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>."},"month":"12","scopus_import":"1","_id":"10184","external_id":{"isi":["000729846700077"]},"quality_controlled":"1","year":"2021","date_published":"2021-12-01T00:00:00Z","doi":"10.1145/3478513.3480555","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"issue":"6","file":[{"file_id":"10185","file_name":"rigidmolds-authorversion.pdf","checksum":"384ece7a9ad1026787ba9560b04336d5","access_level":"open_access","content_type":"application/pdf","date_updated":"2021-10-27T07:08:07Z","file_size":107708317,"date_created":"2021-10-27T07:08:07Z","relation":"main_file","creator":"bbickel"}],"oa":1,"article_type":"original","author":[{"first_name":"Thomas","last_name":"Alderighi","full_name":"Alderighi, Thomas"},{"first_name":"Luigi","full_name":"Malomo, Luigi","last_name":"Malomo"},{"full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"first_name":"Paolo","last_name":"Cignoni","full_name":"Cignoni, Paolo"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"abstract":[{"text":"We introduce a novel technique to automatically decompose an input object’s volume into a set of parts that can be represented by two opposite height fields. Such decomposition enables the manufacturing of individual parts using two-piece reusable rigid molds. Our decomposition strategy relies on a new energy formulation that utilizes a pre-computed signal on the mesh volume representing the accessibility for a predefined set of extraction directions. Thanks to this novel formulation, our method allows for efficient optimization of a fabrication-aware partitioning of volumes in a completely\r\nautomatic way. We demonstrate the efficacy of our approach by generating valid volume partitionings for a wide range of complex objects and physically reproducing several of them.","lang":"eng"}],"oa_version":"Submitted Version","article_number":"272","intvolume":"        40","date_updated":"2025-04-14T07:28:57Z","ddc":["000"],"day":"01","title":"Volume decomposition for two-piece rigid casting","department":[{"_id":"BeBi"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"has_accepted_license":"1","isi":1,"publication_identifier":{"eissn":["1557-7368 "],"issn":["0730-0301"]},"ec_funded":1,"publication":"ACM Transactions on Graphics","acknowledgement":"The authors thank Marco Callieri for all his precious help with the resin casts. The models used in the paper are courtesy of the Stanford 3D Scanning Repository, the AIM@SHAPE Shape Repository, and Thingi10K Repository. The research was partially funded by the European Research Council (ERC) MATERIALIZABLE: Intelligent fabrication-oriented computational design and modeling (grant no. 715767).","main_file_link":[{"open_access":"1","url":"http://vcg.isti.cnr.it/Publications/2021/AMBCP21"}],"date_created":"2021-10-27T07:08:19Z","file_date_updated":"2021-10-27T07:08:07Z","status":"public","article_processing_charge":"No"},{"ec_funded":1,"publication_identifier":{"eissn":["2475-1421"]},"publication":"Proceedings of the ACM on Programming Languages","related_material":{"record":[{"relation":"dissertation_contains","id":"10199","status":"public"}]},"date_created":"2021-10-27T15:05:34Z","file_date_updated":"2021-11-04T07:24:48Z","status":"public","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","article_processing_charge":"No","author":[{"full_name":"Bui, Truc Lam","last_name":"Bui","first_name":"Truc Lam"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722"},{"last_name":"Toman","full_name":"Toman, Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","orcid":"0000-0001-9036-063X"}],"article_number":"164","oa_version":"Published Version","intvolume":"         5","date_updated":"2026-04-08T07:00:31Z","abstract":[{"lang":"eng","text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n"}],"title":"The reads-from equivalence for the TSO and PSO memory models","ddc":["000"],"day":"15","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["2011.11763"]},"quality_controlled":"1","year":"2021","file":[{"file_size":2903485,"content_type":"application/pdf","date_updated":"2021-11-04T07:24:48Z","file_name":"2021_ProcACMPL_Bui.pdf","access_level":"open_access","checksum":"9d6dce7b611853c529bb7b1915ac579e","file_id":"10215","success":1,"creator":"cchlebak","relation":"main_file","date_created":"2021-11-04T07:24:48Z"}],"oa":1,"doi":"10.1145/3485541","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"date_published":"2021-10-15T00:00:00Z","issue":"OOPSLA","article_type":"original","keyword":["safety","risk","reliability and quality","software"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","citation":{"chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>.","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>"},"volume":5,"type":"journal_article","arxiv":1,"scopus_import":"1","month":"10","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"10191"},{"degree_awarded":"PhD","type":"dissertation","corr_author":"1","publication_status":"published","supervisor":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"citation":{"ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>.","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","_id":"10199","month":"10","year":"2021","page":"166","keyword":["concurrency","verification","model checking"],"doi":"10.15479/at:ista:10199","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","date_published":"2021-10-31T00:00:00Z","file":[{"file_id":"10225","file_name":"toman_th_final.pdf","checksum":"4f412a1ee60952221b499a4b1268df35","access_level":"open_access","content_type":"application/pdf","date_updated":"2021-11-08T14:12:22Z","file_size":2915234,"date_created":"2021-11-08T14:12:22Z","creator":"vtoman","relation":"main_file"},{"date_created":"2021-11-08T14:12:46Z","creator":"vtoman","relation":"source_file","file_id":"10226","file_name":"toman_thesis.zip","access_level":"closed","checksum":"9584943f99127be2dd2963f6784c37d4","content_type":"application/zip","date_updated":"2021-11-09T09:00:50Z","file_size":8616056}],"oa":1,"abstract":[{"lang":"eng","text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness."}],"oa_version":"Published Version","date_updated":"2026-04-08T07:00:31Z","author":[{"full_name":"Toman, Viktor","last_name":"Toman","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"has_accepted_license":"1","ddc":["000"],"alternative_title":["ISTA Thesis"],"day":"31","title":"Improved verification techniques for concurrent systems","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9987"},{"status":"public","id":"10191","relation":"part_of_dissertation"},{"id":"141","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10190"}]},"acknowledged_ssus":[{"_id":"SSU"}],"publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"article_processing_charge":"No","date_created":"2021-10-29T20:09:01Z","file_date_updated":"2021-11-09T09:00:50Z","status":"public"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"apa":"Pradhan, S. J., Reddy, P. C., Smutny, M., Sharma, A., Sako, K., Oak, M. S., … Galande, S. (2021). Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-26234-7\">https://doi.org/10.1038/s41467-021-26234-7</a>","ama":"Pradhan SJ, Reddy PC, Smutny M, et al. Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-26234-7\">10.1038/s41467-021-26234-7</a>","ieee":"S. J. Pradhan <i>et al.</i>, “Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","mla":"Pradhan, Saurabh J., et al. “Satb2 Acts as a Gatekeeper for Major Developmental Transitions during Early Vertebrate Embryogenesis.” <i>Nature Communications</i>, vol. 12, no. 1, 6094, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-26234-7\">10.1038/s41467-021-26234-7</a>.","ista":"Pradhan SJ, Reddy PC, Smutny M, Sharma A, Sako K, Oak MS, Shah R, Pal M, Deshpande O, Dsilva G, Tang Y, Mishra R, Deshpande G, Giraldez AJ, Sonawane M, Heisenberg C-PJ, Galande S. 2021. Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis. Nature Communications. 12(1), 6094.","chicago":"Pradhan, Saurabh J., Puli Chandramouli Reddy, Michael Smutny, Ankita Sharma, Keisuke Sako, Meghana S. Oak, Rini Shah, et al. “Satb2 Acts as a Gatekeeper for Major Developmental Transitions during Early Vertebrate Embryogenesis.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-26234-7\">https://doi.org/10.1038/s41467-021-26234-7</a>.","short":"S.J. Pradhan, P.C. Reddy, M. Smutny, A. Sharma, K. Sako, M.S. Oak, R. Shah, M. Pal, O. Deshpande, G. Dsilva, Y. Tang, R. Mishra, G. Deshpande, A.J. Giraldez, M. Sonawane, C.-P.J. Heisenberg, S. Galande, Nature Communications 12 (2021)."},"publication_status":"published","corr_author":"1","volume":12,"type":"journal_article","scopus_import":"1","month":"10","pmid":1,"_id":"10202","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"external_id":{"isi":["000709050300016"],"pmid":["34667153"]},"year":"2021","quality_controlled":"1","oa":1,"file":[{"file_id":"10262","access_level":"open_access","checksum":"c40a69ae94435ecd3a30c9874a11ef2b","file_name":"2021_NatureComm_Pradhan.pdf","date_updated":"2021-11-09T13:59:26Z","content_type":"application/pdf","file_size":7144437,"date_created":"2021-11-09T13:59:26Z","creator":"cziletti","relation":"main_file","success":1}],"issue":"1","doi":"10.1038/s41467-021-26234-7","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2021-10-19T00:00:00Z","article_type":"original","author":[{"last_name":"Pradhan","full_name":"Pradhan, Saurabh J.","first_name":"Saurabh J."},{"first_name":"Puli Chandramouli","full_name":"Reddy, Puli Chandramouli","last_name":"Reddy"},{"orcid":"0000-0002-5920-9090","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","full_name":"Smutny, Michael","last_name":"Smutny"},{"first_name":"Ankita","last_name":"Sharma","full_name":"Sharma, Ankita"},{"orcid":"0000-0002-6453-8075","first_name":"Keisuke","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","full_name":"Sako, Keisuke","last_name":"Sako"},{"last_name":"Oak","full_name":"Oak, Meghana S.","first_name":"Meghana S."},{"first_name":"Rini","last_name":"Shah","full_name":"Shah, Rini"},{"last_name":"Pal","full_name":"Pal, Mrinmoy","first_name":"Mrinmoy"},{"last_name":"Deshpande","full_name":"Deshpande, Ojas","first_name":"Ojas"},{"first_name":"Greg","last_name":"Dsilva","full_name":"Dsilva, Greg"},{"full_name":"Tang, Yin","last_name":"Tang","first_name":"Yin"},{"last_name":"Mishra","full_name":"Mishra, Rakesh","first_name":"Rakesh"},{"first_name":"Girish","last_name":"Deshpande","full_name":"Deshpande, Girish"},{"first_name":"Antonio J.","last_name":"Giraldez","full_name":"Giraldez, Antonio J."},{"last_name":"Sonawane","full_name":"Sonawane, Mahendra","first_name":"Mahendra"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"},{"full_name":"Galande, Sanjeev","last_name":"Galande","first_name":"Sanjeev"}],"intvolume":"        12","date_updated":"2026-04-02T11:57:41Z","oa_version":"Published Version","article_number":"6094","abstract":[{"lang":"eng","text":"Zygotic genome activation (ZGA) initiates regionalized transcription underlying distinct cellular identities. ZGA is dependent upon dynamic chromatin architecture sculpted by conserved DNA-binding proteins. However, the direct mechanistic link between the onset of ZGA and the tissue-specific transcription remains unclear. Here, we have addressed the involvement of chromatin organizer Satb2 in orchestrating both processes during zebrafish embryogenesis. Integrative analysis of transcriptome, genome-wide occupancy and chromatin accessibility reveals contrasting molecular activities of maternally deposited and zygotically synthesized Satb2. Maternal Satb2 prevents premature transcription of zygotic genes by influencing the interplay between the pluripotency factors. By contrast, zygotic Satb2 activates transcription of the same group of genes during neural crest development and organogenesis. Thus, our comparative analysis of maternal versus zygotic function of Satb2 underscores how these antithetical activities are temporally coordinated and functionally implemented highlighting the evolutionary implications of the biphasic and bimodal regulation of landmark developmental transitions by a single determinant."}],"title":"Satb2 acts as a gatekeeper for major developmental transitions during early vertebrate embryogenesis","day":"19","ddc":["570"],"has_accepted_license":"1","isi":1,"department":[{"_id":"CaHe"}],"publication_identifier":{"eissn":["2041-1723"]},"publication":"Nature Communications","related_material":{"link":[{"url":"https://doi.org/10.1101/2020.11.23.394171 ","relation":"earlier_version","description":"Preprint"}]},"file_date_updated":"2021-11-09T13:59:26Z","status":"public","date_created":"2021-10-31T23:01:29Z","acknowledgement":"We are grateful to the members of C.-P.H. and SG lab for discussions. Authors thank Shubha Tole for providing embryonic mouse tissues. Authors are grateful to Alessandro Mongera and Chetana Sachidanandan for generous help with Tg: Sox10: GFP line. Authors would like to thank Satyajeet Khare, Vanessa Barone, Jyothish S., Shalini Mishra, Yoshita Bhide, and Keshav Jha for assistance in experiments. We would also like to thank Chaitanya Dingare for valuable suggestions. We thank Diana Pinhiero and Alexandra Schauer for critical reading of early versions of the manuscript. This work was supported by the Centre of Excellence in Epigenetics program of the Department of Biotechnology, Government of India Phase I (BT/01/COE/09/07) to S.G. and R.K.M., and Phase II (BT/COE/34/SP17426/2016) to S.G. and JC Bose Fellowship (JCB/2019/000013) from Science and Engineering Research Board, Government of India to S.G., DST-BMWF Indo-Austrian bilateral program grant to S.G. and C.-P.H. The work using animal models was partly supported by the infrastructure support grants from the Department of Biotechnology (National Facility for Laboratory Model Organisms: BT/INF/22/SP17358/2016 and Establishment of a Pune Biotech Cluster, Model Organism to Human Disease: B-2 Whole Animal Imaging & Tissue Processing FacilityBT/Pune-Biocluster/01/2015). S.J.P. was supported by Fellowship from the Council of Scientific and Industrial Research, India and travel fellowship from the Company of Biologists, UK. P.C.R. was supported by the Early Career Fellowship of the Wellcome Trust-DBT India Alliance (IA/E/16/1/503057). A.S. was supported by UGC and R.S. was supported by CSIR India. M.S. was supported by core funding from the Tata Institute of Fundamental Research (TIFR 12P-121).","article_processing_charge":"Yes"},{"publication_identifier":{"eissn":["2041-1723"]},"publication":"Nature Communications","status":"public","file_date_updated":"2021-11-03T11:31:24Z","date_created":"2021-10-31T23:01:30Z","acknowledgement":"L.S., P.G.Z., and A.I.T. thank the financial support of the European Graphene Flagship Project under grant agreements 881603 and EPSRC grant EP/S030751/1. L.S. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN Spin-NANO Marie Sklodowska-Curie grant agreement no. 676108. P.G.Z. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN 4PHOTON Marie Sklodowska-Curie grant agreement no. 721394. J.C., S.A.M., and R.S. acknowledge funding by EPSRC (EP/P033369 and EP/M013812). C.L.P., A.J.B., A.I.T., and A.M.F. acknowledge funding by EPSRC Programme Grant EP/N031776/1. S.A.M. acknowledges the Lee-Lucas Chair in Physics, the Solar Energies go Hybrid (SolTech) programme, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - EXC 2089/1 - 390776260.","article_processing_charge":"No","author":[{"first_name":"Luca","full_name":"Sortino, Luca","last_name":"Sortino"},{"first_name":"Panaiot G.","last_name":"Zotev","full_name":"Zotev, Panaiot G."},{"full_name":"Phillips, Catherine L.","last_name":"Phillips","first_name":"Catherine L."},{"first_name":"Alistair J.","last_name":"Brash","full_name":"Brash, Alistair J."},{"first_name":"Javier","full_name":"Cambiasso, Javier","last_name":"Cambiasso"},{"full_name":"Marensi, Elena","last_name":"Marensi","orcid":"0000-0001-7173-4923","id":"0BE7553A-1004-11EA-B805-18983DDC885E","first_name":"Elena"},{"first_name":"A. Mark","full_name":"Fox, A. Mark","last_name":"Fox"},{"first_name":"Stefan A.","full_name":"Maier, Stefan A.","last_name":"Maier"},{"first_name":"Riccardo","last_name":"Sapienza","full_name":"Sapienza, Riccardo"},{"last_name":"Tartakovskii","full_name":"Tartakovskii, Alexander I.","first_name":"Alexander I."}],"intvolume":"        12","date_updated":"2023-08-14T08:12:12Z","oa_version":"Published Version","article_number":"6063","abstract":[{"text":"Single photon emitters in atomically-thin semiconductors can be deterministically positioned using strain induced by underlying nano-structures. Here, we couple monolayer WSe2 to high-refractive-index gallium phosphide dielectric nano-antennas providing both optical enhancement and monolayer deformation. For single photon emitters formed on such nano-antennas, we find very low (femto-Joule) saturation pulse energies and up to 104 times brighter photoluminescence than in WSe2 placed on low-refractive-index SiO2 pillars. We show that the key to these observations is the increase on average by a factor of 5 of the quantum efficiency of the emitters coupled to the nano-antennas. This further allows us to gain new insights into their photoluminescence dynamics, revealing the roles of the dark exciton reservoir and Auger processes. We also find that the coherence time of such emitters is limited by intrinsic dephasing processes. Our work establishes dielectric nano-antennas as a platform for high-efficiency quantum light generation in monolayer semiconductors.","lang":"eng"}],"title":"Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas","day":"18","ddc":["530"],"has_accepted_license":"1","isi":1,"department":[{"_id":"BjHo"}],"external_id":{"arxiv":["2103.16986"],"isi":["000708601800015"]},"year":"2021","quality_controlled":"1","oa":1,"file":[{"date_created":"2021-11-03T11:31:24Z","relation":"main_file","creator":"cchlebak","success":1,"file_id":"10212","file_name":"2021_NatComm_Sortino.pdf","access_level":"open_access","checksum":"8580d128389860f732028c521cd5949e","content_type":"application/pdf","date_updated":"2021-11-03T11:31:24Z","file_size":1434201}],"publisher":"Springer Nature","date_published":"2021-10-18T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1038/s41467-021-26262-3","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Sortino, Luca, Panaiot G. Zotev, Catherine L. Phillips, Alistair J. Brash, Javier Cambiasso, Elena Marensi, A. Mark Fox, Stefan A. Maier, Riccardo Sapienza, and Alexander I. Tartakovskii. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-26262-3\">https://doi.org/10.1038/s41467-021-26262-3</a>.","ista":"Sortino L, Zotev PG, Phillips CL, Brash AJ, Cambiasso J, Marensi E, Fox AM, Maier SA, Sapienza R, Tartakovskii AI. 2021. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. Nature Communications. 12, 6063.","mla":"Sortino, Luca, et al. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” <i>Nature Communications</i>, vol. 12, 6063, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-26262-3\">10.1038/s41467-021-26262-3</a>.","short":"L. Sortino, P.G. Zotev, C.L. Phillips, A.J. Brash, J. Cambiasso, E. Marensi, A.M. Fox, S.A. Maier, R. Sapienza, A.I. Tartakovskii, Nature Communications 12 (2021).","ama":"Sortino L, Zotev PG, Phillips CL, et al. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. <i>Nature Communications</i>. 2021;12. doi:<a href=\"https://doi.org/10.1038/s41467-021-26262-3\">10.1038/s41467-021-26262-3</a>","apa":"Sortino, L., Zotev, P. G., Phillips, C. L., Brash, A. J., Cambiasso, J., Marensi, E., … Tartakovskii, A. I. (2021). Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-26262-3\">https://doi.org/10.1038/s41467-021-26262-3</a>","ieee":"L. Sortino <i>et al.</i>, “Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas,” <i>Nature Communications</i>, vol. 12. Springer Nature, 2021."},"publication_status":"published","volume":12,"type":"journal_article","arxiv":1,"scopus_import":"1","month":"10","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"10203"},{"publication_status":"published","citation":{"ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” <i>Soft Matter</i>, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.","ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. 2021;17(40):9107-9115. doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>","apa":"Osang, G. F., Edelsbrunner, H., &#38; Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. Royal Society of Chemistry . <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>.","chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>. Royal Society of Chemistry , 2021. <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>.","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115."},"type":"journal_article","volume":17,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10204","pmid":1,"month":"10","scopus_import":"1","quality_controlled":"1","year":"2021","external_id":{"isi":["000700090000001"],"pmid":["34569592"]},"page":"9107-9115","article_type":"original","file":[{"checksum":"b4da0c420530295e61b153960f6cb350","access_level":"open_access","file_name":"2021_SoftMatter_acceptedversion_Osang.pdf","file_id":"14385","file_size":4678788,"date_updated":"2023-10-03T09:21:42Z","content_type":"application/pdf","date_created":"2023-10-03T09:21:42Z","success":1,"relation":"main_file","creator":"dernst"}],"oa":1,"publisher":"Royal Society of Chemistry ","language":[{"iso":"eng"}],"doi":"10.1039/d1sm00774b","date_published":"2021-10-20T00:00:00Z","issue":"40","oa_version":"Submitted Version","intvolume":"        17","date_updated":"2025-04-15T07:16:52Z","abstract":[{"text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals.","lang":"eng"}],"author":[{"full_name":"Osang, Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Saadatfar, Mohammad","last_name":"Saadatfar","first_name":"Mohammad"}],"isi":1,"has_accepted_license":"1","department":[{"_id":"HeEd"}],"project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science"}],"title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","ddc":["540"],"day":"20","publication":"Soft Matter","ec_funded":1,"publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"article_processing_charge":"No","date_created":"2021-10-31T23:01:30Z","status":"public","file_date_updated":"2023-10-03T09:21:42Z","acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31."},{"_id":"10206","scopus_import":"1","month":"10","arxiv":1,"corr_author":"1","type":"conference","volume":"12974 ","publication_status":"published","citation":{"mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","keyword":["monitoring","neural networks","novelty detection"],"publisher":"Springer Nature","date_published":"2021-10-06T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-88494-9_3","oa":1,"quality_controlled":"1","year":"2021","page":"42-61","external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"department":[{"_id":"ToHe"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"isi":1,"alternative_title":["LNCS"],"day":"06","title":"Into the unknown: active monitoring of neural networks","place":"Cham","abstract":[{"lang":"eng","text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios."}],"oa_version":"Preprint","date_updated":"2025-04-15T06:26:14Z","author":[{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"article_processing_charge":"No","acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","main_file_link":[{"url":"https://arxiv.org/abs/2009.06429","open_access":"1"}],"date_created":"2021-10-31T23:01:31Z","status":"public","publication":"21st International Conference on Runtime Verification","related_material":{"record":[{"id":"13234","relation":"extended_version","status":"public"}]},"publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"isbn":["9-783-0308-8493-2"]},"ec_funded":1,"conference":{"location":"Virtual","start_date":"2021-10-11","name":"RV: Runtime Verification","end_date":"2021-10-14"}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":209,"type":"conference","citation":{"short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>.","chicago":"Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>.","ista":"Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.","ieee":"B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","ama":"Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>","apa":"Chatterjee, B., Peri, S., &#38; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>"},"publication_status":"published","scopus_import":"1","month":"10","arxiv":1,"_id":"10216","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"external_id":{"arxiv":["2003.01697"]},"year":"2021","quality_controlled":"1","date_published":"2021-10-04T00:00:00Z","doi":"10.4230/LIPIcs.DISC.2021.52","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"file":[{"file_name":"2021_LIPIcsDISC_BChatterjee.pdf","checksum":"76546df112a0ba1166c864d33d7834e2","access_level":"open_access","file_id":"10276","file_size":795860,"content_type":"application/pdf","date_updated":"2021-11-12T09:23:22Z","date_created":"2021-11-12T09:23:22Z","success":1,"relation":"main_file","creator":"cchlebak"}],"author":[{"full_name":"Chatterjee, Bapi","last_name":"Chatterjee","orcid":"0000-0002-2742-4028","first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Peri, Sathya","last_name":"Peri","first_name":"Sathya"},{"last_name":"Sa","full_name":"Sa, Muktikanta","first_name":"Muktikanta"}],"abstract":[{"lang":"eng","text":"This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking."}],"intvolume":"       209","date_updated":"2025-05-14T10:54:39Z","article_number":"52","oa_version":"Published Version","day":"04","alternative_title":["LIPIcs"],"ddc":["000"],"title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","department":[{"_id":"DaAl"}],"has_accepted_license":"1","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"conference":{"location":"Freiburg, Germany","start_date":"2021-10-04","name":"DISC: Distributed Computing","end_date":"2021-10-08"},"publication":"35th International Symposium on Distributed Computing","acknowledgement":"This work was partially funded by National Supercomputing Mission, Govt. of India under the project “Concurrent and Distributed Programming primitives and algorithms for Temporal Graphs”(DST/NSM/R&D_Exascale/2021/16).\r\n","file_date_updated":"2021-11-12T09:23:22Z","status":"public","date_created":"2021-11-07T23:01:23Z","article_processing_charge":"No"},{"_id":"10217","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","month":"10","type":"conference","volume":209,"publication_status":"published","citation":{"short":"D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">10.4230/LIPIcs.DISC.2021.4</a>.","ista":"Alistarh D-A, Gelashvili R, Nadiradze G. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 4.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">https://doi.org/10.4230/LIPIcs.DISC.2021.4</a>.","ieee":"D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","ama":"Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">10.4230/LIPIcs.DISC.2021.4</a>","apa":"Alistarh, D.-A., Gelashvili, R., &#38; Nadiradze, G. (2021). Lower bounds for shared-memory leader election under bounded write contention. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.4\">https://doi.org/10.4230/LIPIcs.DISC.2021.4</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-10-04T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DISC.2021.4","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"date_created":"2021-11-12T09:33:26Z","relation":"main_file","creator":"cchlebak","success":1,"file_id":"10277","checksum":"b4cdc6668c899a601c5e6a96b8ca54d9","access_level":"open_access","file_name":"2021_LIPIcsDISC_Alistarh.pdf","date_updated":"2021-11-12T09:33:26Z","content_type":"application/pdf","file_size":706791}],"oa":1,"quality_controlled":"1","year":"2021","department":[{"_id":"DaAl"}],"project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"has_accepted_license":"1","ddc":["000"],"day":"04","alternative_title":["LIPIcs"],"title":"Lower bounds for shared-memory leader election under bounded write contention","abstract":[{"text":"This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an asynchronous shared-memory model with single-writer multi-reader (SWMR) registers, for both deterministic and randomized obstruction-free algorithms. The approach extends to lower bounds for deterministic and randomized obstruction-free algorithms using multi-writer registers under bounded write concurrency, showing a trade-off between the solo step complexity of a leader election algorithm, and the worst-case number of stalls incurred by a processor in an execution.","lang":"eng"}],"oa_version":"Published Version","article_number":"4","date_updated":"2025-05-14T10:54:30Z","intvolume":"       209","author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","orcid":"0000-0001-5634-0731"}],"article_processing_charge":"No","acknowledgement":"Dan Alistarh: Supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Giorgi Nadiradze: Supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). The authors would like to thank the DISC anonymous reviewers for their useful\r\nfeedback and comments.","date_created":"2021-11-07T23:01:23Z","file_date_updated":"2021-11-12T09:33:26Z","status":"public","publication":"35th International Symposium on Distributed Computing","publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"ec_funded":1,"conference":{"end_date":"2021-10-08","name":"DISC: Distributed Computing","start_date":"2021-10-04","location":"Freiburg, Germany"}},{"ec_funded":1,"conference":{"end_date":"2021-10-08","name":"DISC: Distributed Computing ","location":"Freiburg, Germany","start_date":"2021-10-04"},"publication_identifier":{"isbn":["9-783-9597-7210-5"],"issn":["1868-8969"]},"publication":"35th International Symposium on Distributed Computing","date_created":"2021-11-07T23:01:24Z","file_date_updated":"2021-11-12T08:16:44Z","status":"public","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 840605.","article_processing_charge":"No","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","article_number":"43","intvolume":"       209","date_updated":"2025-04-14T07:50:55Z","abstract":[{"lang":"eng","text":"Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node. In this work, we consider the more general setting where G is an arbitrary graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As an example, this implies that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties."}],"title":"Brief announcement: Fast graphical population protocols","ddc":["000"],"day":"04","alternative_title":["LIPIcs"],"has_accepted_license":"1","department":[{"_id":"DaAl"}],"project":[{"name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020"}],"external_id":{"arxiv":["2102.08808"]},"quality_controlled":"1","year":"2021","file":[{"relation":"main_file","creator":"cchlebak","success":1,"date_created":"2021-11-12T08:16:44Z","content_type":"application/pdf","date_updated":"2021-11-12T08:16:44Z","file_size":534219,"file_id":"10274","file_name":"2021_LIPIcsDISC_Alistarh.pdf","checksum":"fd2a690f6856d21247e9aa952b0e2885","access_level":"open_access"}],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2021-10-04T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DISC.2021.43","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","citation":{"ieee":"D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","apa":"Alistarh, D.-A., Gelashvili, R., &#38; Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>","ama":"Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">10.4230/LIPIcs.DISC.2021.43</a>","short":"D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ista":"Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical population protocols. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 43.","mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">10.4230/LIPIcs.DISC.2021.43</a>.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.43\">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>."},"type":"conference","volume":209,"arxiv":1,"month":"10","scopus_import":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"10218"},{"abstract":[{"text":"We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).","lang":"eng"}],"date_updated":"2025-05-14T10:54:13Z","intvolume":"       209","oa_version":"Published Version","article_number":"58","author":[{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Suomela","full_name":"Suomela, Jukka","first_name":"Jukka"}],"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"DaAl"}],"has_accepted_license":"1","alternative_title":["LIPIcs"],"day":"04","ddc":["000"],"title":"Brief announcement: Sinkless orientation is hard also in the supported LOCAL model","publication":"35th International Symposium on Distributed Computing","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"conference":{"name":"DISC: Distributed Computing ","end_date":"2021-10-08","start_date":"2021-10-04","location":"Freiburg, Germany"},"ec_funded":1,"article_processing_charge":"No","acknowledgement":"Janne H. Korhonen: Project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Ami Paz: We acknowledge the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Stefan Schmid: Research supported by the Austrian Science Fund (FWF) project ADVISE, I 4800-N, 2020-2023.\r\n","status":"public","file_date_updated":"2021-11-12T08:27:42Z","date_created":"2021-11-07T23:01:24Z","type":"conference","volume":209,"citation":{"ieee":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","apa":"Korhonen, J., Paz, A., Rybicki, J., Schmid, S., &#38; Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">https://doi.org/10.4230/LIPIcs.DISC.2021.58</a>","ama":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">10.4230/LIPIcs.DISC.2021.58</a>","short":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">10.4230/LIPIcs.DISC.2021.58</a>.","chicago":"Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.58\">https://doi.org/10.4230/LIPIcs.DISC.2021.58</a>.","ista":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"10219","month":"10","scopus_import":"1","arxiv":1,"year":"2021","quality_controlled":"1","external_id":{"arxiv":["2108.02655"]},"language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2021-10-04T00:00:00Z","doi":"10.4230/LIPIcs.DISC.2021.58","oa":1,"file":[{"success":1,"creator":"cchlebak","relation":"main_file","date_created":"2021-11-12T08:27:42Z","file_size":474242,"content_type":"application/pdf","date_updated":"2021-11-12T08:27:42Z","file_name":"2021_LIPIcsDISC_Korhonen.pdf","checksum":"c43188dc2070bbd2bf5fd6fdaf9ce36d","access_level":"open_access","file_id":"10275"}]}]