[{"abstract":[{"text":"Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology.","lang":"eng"}],"publist_id":"6844","doi":"10.1146/annurev-ento-020117-043110","publication_identifier":{"issn":["1545-4487"]},"status":"public","day":"07","publication_status":"published","related_material":{"record":[{"id":"819","relation":"dissertation_contains","status":"public"}]},"month":"01","isi":1,"publisher":"Annual Reviews","language":[{"iso":"eng"}],"page":"105 - 123","intvolume":"        63","scopus_import":"1","external_id":{"isi":["000424633700008"]},"_id":"806","author":[{"full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"first_name":"Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982","last_name":"Pull"},{"orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","full_name":"Fürst, Matthias","last_name":"Fürst"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 63, 105–123.","mla":"Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>, vol. 63, Annual Reviews, 2018, pp. 105–23, doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>.","apa":"Cremer, S., Pull, C., &#38; Fürst, M. (2018). Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>","ama":"Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. 2018;63:105-123. doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>","short":"S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123.","chicago":"Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>. Annual Reviews, 2018. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>.","ieee":"S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution of colony-level disease protection,” <i>Annual Review of Entomology</i>, vol. 63. Annual Reviews, pp. 105–123, 2018."},"department":[{"_id":"SyCr"}],"oa_version":"None","date_updated":"2023-09-19T09:29:45Z","type":"journal_article","quality_controlled":"1","date_published":"2018-01-07T00:00:00Z","title":"Social immunity: Emergence and evolution of colony-level disease protection","volume":63,"article_processing_charge":"No","publication":"Annual Review of Entomology","year":"2018","date_created":"2018-12-11T11:48:36Z"},{"date_created":"2018-12-11T11:44:31Z","ddc":["000"],"volume":11022,"article_processing_charge":"No","year":"2018","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2018-09-06","location":"Beijing, China","start_date":"2018-09-04"},"quality_controlled":"1","date_published":"2018-08-26T00:00:00Z","title":"Monitoring temporal logic with clock variables","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"type":"conference","oa":1,"author":[{"last_name":"Elgyütt","full_name":"Elgyütt, Adrian","first_name":"Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ferrere","first_name":"Thomas","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>.","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","mla":"Elgyütt, Adrian, et al. <i>Monitoring Temporal Logic with Clock Variables</i>. Vol. 11022, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>.","apa":"Elgyütt, A., Ferrere, T., &#38; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70."},"has_accepted_license":"1","file":[{"file_name":"2018_LNCS_Elgyuett.pdf","content_type":"application/pdf","date_updated":"2020-10-09T06:24:21Z","file_size":537219,"access_level":"open_access","file_id":"8638","date_created":"2020-10-09T06:24:21Z","success":1,"checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","relation":"main_file","creator":"dernst"}],"department":[{"_id":"ToHe"}],"date_updated":"2023-09-13T08:58:34Z","oa_version":"Submitted Version","_id":"81","scopus_import":"1","file_date_updated":"2020-10-09T06:24:21Z","external_id":{"isi":["000884993200004"]},"page":"53 - 70","intvolume":"     11022","language":[{"iso":"eng"}],"publisher":"Springer","month":"08","isi":1,"alternative_title":["LNCS"],"day":"26","publication_status":"published","status":"public","doi":"10.1007/978-3-030-00151-3_4","publist_id":"7973","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}]},{"issue":"8","doi":"10.1371/journal.pbio.2005971","abstract":[{"text":"In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term &quot;leaky resistance.&quot; We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”.","lang":"eng"}],"publist_id":"7972","status":"public","publication_status":"published","day":"16","isi":1,"month":"08","related_material":{"record":[{"status":"public","relation":"research_data","id":"9810"}]},"publisher":"Public Library of Science","language":[{"iso":"eng"}],"article_number":"2005971","intvolume":"        16","external_id":{"isi":["000443383300024"]},"file_date_updated":"2020-07-14T12:48:10Z","scopus_import":"1","_id":"82","oa_version":"Published Version","date_updated":"2023-09-13T08:45:41Z","file":[{"file_size":4007095,"date_updated":"2020-07-14T12:48:10Z","content_type":"application/pdf","file_name":"2018_Plos_Chaudhry.pdf","date_created":"2018-12-17T12:55:31Z","file_id":"5706","access_level":"open_access","creator":"dernst","relation":"main_file","checksum":"527076f78265cd4ea192cd1569851587"}],"department":[{"_id":"CaGu"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ieee":"W. Chaudhry <i>et al.</i>, “Leaky resistance and the conditions for the existence of lytic bacteriophage,” <i>PLoS Biology</i>, vol. 16, no. 8. Public Library of Science, 2018.","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018).","ama":"Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. 2018;16(8). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>","mla":"Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>.","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971."},"oa":1,"author":[{"first_name":"Waqas","full_name":"Chaudhry, Waqas","last_name":"Chaudhry"},{"full_name":"Pleska, Maros","first_name":"Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7460-7479","last_name":"Pleska"},{"first_name":"Nilang","full_name":"Shah, Nilang","last_name":"Shah"},{"last_name":"Weiss","full_name":"Weiss, Howard","first_name":"Howard"},{"last_name":"Mccall","first_name":"Ingrid","full_name":"Mccall, Ingrid"},{"first_name":"Justin","full_name":"Meyer, Justin","last_name":"Meyer"},{"first_name":"Animesh","full_name":"Gupta, Animesh","last_name":"Gupta"},{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","full_name":"Guet, Calin C","last_name":"Guet"},{"last_name":"Levin","first_name":"Bruce","full_name":"Levin, Bruce"}],"type":"journal_article","date_published":"2018-08-16T00:00:00Z","title":"Leaky resistance and the conditions for the existence of lytic bacteriophage","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2018","publication":"PLoS Biology","volume":16,"article_processing_charge":"Yes","ddc":["570"],"date_created":"2018-12-11T11:44:32Z"},{"pubrep_id":"1046","type":"dissertation","date_updated":"2023-09-07T12:30:23Z","oa_version":"Published Version","department":[{"_id":"KrPi"}],"file":[{"date_created":"2019-04-09T06:43:41Z","file_id":"6245","access_level":"open_access","file_size":876241,"date_updated":"2020-07-14T12:48:11Z","content_type":"application/pdf","file_name":"2018_Thesis_Abusalah.pdf","creator":"dernst","relation":"main_file","checksum":"c4b5f7d111755d1396787f41886fc674"},{"creator":"dernst","relation":"source_file","checksum":"0f382ac56b471c48fd907d63eb87dafe","date_created":"2019-04-09T06:43:41Z","file_id":"6246","access_level":"closed","file_size":2029190,"content_type":"application/x-gzip","date_updated":"2020-07-14T12:48:11Z","file_name":"2018_Thesis_Abusalah_source.tar.gz"}],"citation":{"mla":"Abusalah, Hamza M. <i>Proof Systems for Sustainable Decentralized Cryptocurrencies</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>.","apa":"Abusalah, H. M. (2018). <i>Proof systems for sustainable decentralized cryptocurrencies</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>","ista":"Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.","chicago":"Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>.","short":"H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018.","ama":"Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"last_name":"Abusalah","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M"}],"_id":"83","file_date_updated":"2020-07-14T12:48:11Z","ddc":["004"],"date_created":"2018-12-11T11:44:32Z","year":"2018","article_processing_charge":"No","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"date_published":"2018-09-05T00:00:00Z","title":"Proof systems for sustainable decentralized cryptocurrencies","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"status":"public","id":"1229","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1235"},{"status":"public","relation":"part_of_dissertation","id":"1236"},{"status":"public","relation":"part_of_dissertation","id":"559"}]},"month":"09","publication_status":"published","day":"05","ec_funded":1,"status":"public","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:TH_1046","publist_id":"7971","abstract":[{"text":"A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds.","lang":"eng"}],"page":"59","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}]},{"_id":"85","scopus_import":"1","file_date_updated":"2020-07-14T12:48:14Z","external_id":{"isi":["000851042300031"]},"type":"conference","oa":1,"author":[{"full_name":"Gilad, Eran","first_name":"Eran","last_name":"Gilad"},{"full_name":"Brown, Trevor A","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","last_name":"Brown"},{"last_name":"Oskin","full_name":"Oskin, Mark","first_name":"Mark"},{"last_name":"Etsion","first_name":"Yoav","full_name":"Etsion, Yoav"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479."},"file":[{"access_level":"open_access","date_created":"2019-02-12T07:40:40Z","file_id":"5954","file_name":"2018_Brown.pdf","file_size":665372,"content_type":"application/pdf","date_updated":"2020-07-14T12:48:14Z","relation":"main_file","checksum":"13a3f250be8878405e791b53c19722ad","creator":"dernst"}],"department":[{"_id":"DaAl"}],"oa_version":"Preprint","date_updated":"2023-09-18T09:32:36Z","conference":{"end_date":"2018-08-31","location":"Turin, Italy","start_date":"2018-08-27","name":"Euro-Par: European Conference on Parallel Processing"},"quality_controlled":"1","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","date_published":"2018-08-01T00:00:00Z","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"date_created":"2018-12-11T11:44:33Z","ddc":["000"],"article_processing_charge":"No","volume":11014,"year":"2018","publication_identifier":{"issn":["03029743"]},"status":"public","abstract":[{"lang":"eng","text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use."}],"doi":"10.1007/978-3-319-96983-1_33","publist_id":"7969","month":"08","isi":1,"alternative_title":["LNCS"],"day":"01","publication_status":"published","acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","publisher":"Springer","page":"465 - 479","intvolume":"     11014","language":[{"iso":"eng"}]},{"department":[{"_id":"SiHi"}],"date_updated":"2021-01-12T08:20:00Z","oa_version":"Preprint","publication_status":"submitted","acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","author":[{"last_name":"Llorca","first_name":"Alfredo","full_name":"Llorca, Alfredo"},{"full_name":"Ciceri, Gabriele","first_name":"Gabriele","last_name":"Ciceri"},{"last_name":"Beattie","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","full_name":"Beattie, Robert J","first_name":"Robert J","orcid":"0000-0002-8483-8753"},{"last_name":"Wong","first_name":"Fong K.","full_name":"Wong, Fong K."},{"last_name":"Diana","first_name":"Giovanni","full_name":"Diana, Giovanni"},{"last_name":"Serafeimidou","full_name":"Serafeimidou, Eleni","first_name":"Eleni"},{"last_name":"Fernández-Otero","full_name":"Fernández-Otero, Marian","first_name":"Marian"},{"last_name":"Streicher","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","full_name":"Streicher, Carmen","first_name":"Carmen"},{"full_name":"Arnold, Sebastian J.","first_name":"Sebastian J.","last_name":"Arnold"},{"last_name":"Meyer","first_name":"Martin","full_name":"Meyer, Martin"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"},{"first_name":"Miguel","full_name":"Maravall, Miguel","last_name":"Maravall"},{"last_name":"Marín","full_name":"Marín, Oscar","first_name":"Oscar"}],"oa":1,"ec_funded":1,"day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, <a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>","ieee":"A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>."},"month":"12","type":"preprint","doi":"10.1101/494088","abstract":[{"lang":"eng","text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex."}],"_id":"8547","status":"public","year":"2018","main_file_link":[{"url":"https://doi.org/10.1101/494088","open_access":"1"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"bioRxiv","date_created":"2020-09-21T12:01:50Z","date_published":"2018-12-13T00:00:00Z","title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","project":[{"_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780"},{"_id":"264E56E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","grant_number":"M02416"}],"publisher":"Cold Spring Harbor Laboratory"},{"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-07-20T00:00:00Z","title":"Computing average response time","quality_controlled":"1","ddc":["000"],"date_created":"2018-12-11T11:44:33Z","year":"2018","publication":"Principles of Modeling","volume":10760,"_id":"86","editor":[{"first_name":"Marten","full_name":"Lohstroh, Marten","last_name":"Lohstroh"},{"last_name":"Derler","full_name":"Derler, Patricia","first_name":"Patricia"},{"first_name":"Marjan","full_name":"Sirjani, Marjan","last_name":"Sirjani"}],"file_date_updated":"2020-07-14T12:48:14Z","scopus_import":1,"type":"book_chapter","date_updated":"2021-01-12T08:20:14Z","oa_version":"Submitted Version","file":[{"creator":"dernst","relation":"main_file","checksum":"9995c6ce6957333baf616fc4f20be597","date_created":"2019-11-19T08:22:18Z","file_id":"7053","access_level":"open_access","file_size":516307,"content_type":"application/pdf","date_updated":"2020-07-14T12:48:14Z","file_name":"2018_PrinciplesModeling_Chatterjee.pdf"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>."},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publisher":"Springer","intvolume":"     10760","page":"143 - 161","language":[{"iso":"eng"}],"status":"public","doi":"10.1007/978-3-319-95246-8_9","publist_id":"7968","abstract":[{"lang":"eng","text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms."}],"alternative_title":["LNCS"],"month":"07","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","publication_status":"published","day":"20","ec_funded":1},{"type":"journal_article","oa_version":"Published Version","date_updated":"2023-09-19T15:04:49Z","department":[{"_id":"JoDa"}],"file":[{"date_created":"2020-10-06T16:35:16Z","success":1,"file_id":"8619","access_level":"open_access","file_size":2818077,"date_updated":"2020-10-06T16:35:16Z","content_type":"application/pdf","file_name":"2018_ScientificReports_Gregor.pdf","creator":"dernst","relation":"main_file","checksum":"e642080fcbde9584c63544f587c74f03"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>, vol. 8, 2724, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>.","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &#38; Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” <i>Scientific Reports</i>, vol. 8. Springer Nature, 2018.","chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>.","ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. 2018;8. doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018)."},"has_accepted_license":"1","oa":1,"author":[{"last_name":"Gregor","full_name":"Gregor, Carola","first_name":"Carola"},{"last_name":"Sidenstein","first_name":"Sven C.","full_name":"Sidenstein, Sven C."},{"full_name":"Andresen, Martin","first_name":"Martin","last_name":"Andresen"},{"first_name":"Steffen J.","full_name":"Sahl, Steffen J.","last_name":"Sahl"},{"last_name":"Danzl","first_name":"Johann G","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973"},{"first_name":"Stefan W.","full_name":"Hell, Stefan W.","last_name":"Hell"}],"_id":"8618","external_id":{"pmid":["29426833"],"isi":["000424630400037"]},"file_date_updated":"2020-10-06T16:35:16Z","ddc":["570"],"date_created":"2020-10-06T16:33:37Z","year":"2018","publication":"Scientific Reports","volume":8,"article_processing_charge":"No","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2018-02-09T00:00:00Z","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","keyword":["Multidisciplinary"],"quality_controlled":"1","isi":1,"month":"02","publication_status":"published","day":"09","pmid":1,"status":"public","publication_identifier":{"issn":["2045-2322"]},"doi":"10.1038/s41598-018-19947-1","abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}],"article_number":"2724","intvolume":"         8","article_type":"original","language":[{"iso":"eng"}],"publisher":"Springer Nature"},{"article_type":"original","page":"3215 - 3238","intvolume":"        28","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Institute of Mathematical Statistics","related_material":{"record":[{"status":"public","id":"6287","relation":"dissertation_contains"}]},"month":"10","isi":1,"day":"01","publication_status":"published","status":"public","abstract":[{"text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics.","lang":"eng"}],"doi":"10.1214/18-AAP1389","publist_id":"7967","issue":"5","date_created":"2018-12-11T11:44:33Z","article_processing_charge":"No","volume":28,"publication":"Annals of Applied Probability","year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1705.02870","open_access":"1"}],"quality_controlled":"1","date_published":"2018-10-01T00:00:00Z","title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","orcid":"0000-0002-0659-3201","last_name":"Nikitenko"}],"oa":1,"citation":{"apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>.","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2018. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>.","short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. 2018;28(5):3215-3238. doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” <i>Annals of Applied Probability</i>, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"HeEd"}],"oa_version":"Preprint","date_updated":"2023-09-15T12:10:35Z","_id":"87","scopus_import":"1","external_id":{"isi":["000442893500018"],"arxiv":["1705.02870"]}},{"article_processing_charge":"No","year":"2018","date_created":"2018-12-11T11:44:08Z","ddc":["570"],"date_published":"2018-07-01T00:00:00Z","title":"Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ","author":[{"last_name":"Belyaeva","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera"}],"oa":1,"citation":{"short":"V. Belyaeva, Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo , Institute of Science and Technology Austria, 2018.","ama":"Belyaeva V. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>","chicago":"Belyaeva, Vera. “Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo .” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>.","ieee":"V. Belyaeva, “Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ,” Institute of Science and Technology Austria, 2018.","ista":"Belyaeva V. 2018. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria.","mla":"Belyaeva, Vera. <i>Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo </i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>.","apa":"Belyaeva, V. (2018). <i>Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","department":[{"_id":"DaSi"}],"file":[{"creator":"dernst","relation":"source_file","checksum":"d27b2465cb70d0c9678a0381b9b6ced1","date_created":"2019-04-08T14:13:12Z","file_id":"6243","access_level":"closed","file_size":102737483,"date_updated":"2020-07-14T12:48:14Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","file_name":"2018_Thesis_Belyaeva_source.docx"},{"embargo":"2019-11-19","checksum":"a2939b61bde2de7b8ced77bbae0eaaed","relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"6244","date_created":"2019-04-08T14:14:08Z","file_name":"2018_Thesis_Belyaeva.pdf","date_updated":"2021-02-11T11:17:16Z","content_type":"application/pdf","file_size":88077843}],"oa_version":"Published Version","date_updated":"2023-09-07T12:43:10Z","type":"dissertation","pubrep_id":"1064","file_date_updated":"2021-02-11T11:17:16Z","_id":"9","language":[{"iso":"eng"}],"page":"96","supervisor":[{"last_name":"Siekhaus","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","full_name":"Siekhaus, Daria E"}],"publisher":"Institute of Science and Technology Austria","day":"01","publication_status":"published","month":"07","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:th1064","abstract":[{"text":"Immune cells migrating to the sites of infection navigate through diverse tissue architectures and switch their migratory mechanisms upon demand. However, little is known about systemic regulators that could allow the acquisition of these mechanisms. We performed a genetic screen in Drosophila melanogaster to identify regulators of germband invasion by embryonic macrophages into the confined space between the ectoderm and mesoderm. We have found that bZIP circadian transcription factors (TFs) Kayak (dFos) and Vrille (dNFIL3) have opposite effects on macrophage germband infiltration: Kayak facilitated and Vrille inhibited it. These TFs are enriched in the macrophages during migration and genetically interact to control it. Kayak sets a less coordinated mode of migration of the macrophage group and increases the probability and length of Levy walks. Intriguingly, the motility of kayak mutant macrophages was also strongly affected during initial germband invasion but not along another less confined route. Inhibiting Rho1 signaling within the tail ectoderm partially rescued the Kayak mutant phenotype, strongly suggesting that migrating macrophages have to overcome a barrier imposed by the stiffness of the ectoderm. Also, Kayak appeared to be important for the maintenance of the round cell shape and the rear edge translocation of the macrophages invading the germband. Complementary to this, the cortical actin cytoskeleton of Kayak- deficient macrophages was strongly affected. RNA sequencing revealed the filamin Cheerio and tetraspanin TM4SF to be downstream of Kayak. Chromatin immunoprecipitation and immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Indeed, Cheerio, TM4SF and Diaphanous are required within macrophages for germband invasion, and expression of constitutively active Diaphanous in macrophages was able to rescue the kayak mutant phenotype. Moreover, Cher and Diaphanous are also reduced in the macrophages overexpressing Vrille. We hypothesize that Kayak, through its targets, increases actin polymerization and cortical tension in macrophages and thus allows extra force generation necessary for macrophage dissemination and migration through confined stiff tissues, while Vrille counterbalances it.","lang":"eng"}],"publist_id":"8047","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","status":"public"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020"}],"date_published":"2018-06-13T00:00:00Z","title":"Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage","ddc":["571"],"date_created":"2018-12-11T11:44:57Z","publication":"eLife","article_processing_charge":"No","volume":7,"year":"2018","_id":"162","file_date_updated":"2020-07-14T12:45:07Z","scopus_import":"1","external_id":{"isi":["000436227500001"]},"type":"journal_article","has_accepted_license":"1","citation":{"ista":"Kaucka M, Petersen J, Tesarova M, Szarowska B, Kastriti M, Xie M, Kicheva A, Annusver K, Kasper M, Symmons O, Pan L, Spitz F, Kaiser J, Hovorakova M, Zikmund T, Sunadome K, Matise MP, Wang H, Marklund U, Abdo H, Ernfors P, Maire P, Wurmser M, Chagin AS, Fried K, Adameyko I. 2018. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. eLife. 7, e34465.","apa":"Kaucka, M., Petersen, J., Tesarova, M., Szarowska, B., Kastriti, M., Xie, M., … Adameyko, I. (2018). Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.34465\">https://doi.org/10.7554/eLife.34465</a>","mla":"Kaucka, Marketa, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” <i>ELife</i>, vol. 7, e34465, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.34465\">10.7554/eLife.34465</a>.","short":"M. Kaucka, J. Petersen, M. Tesarova, B. Szarowska, M. Kastriti, M. Xie, A. Kicheva, K. Annusver, M. Kasper, O. Symmons, L. Pan, F. Spitz, J. Kaiser, M. Hovorakova, T. Zikmund, K. Sunadome, M.P. Matise, H. Wang, U. Marklund, H. Abdo, P. Ernfors, P. Maire, M. Wurmser, A.S. Chagin, K. Fried, I. Adameyko, ELife 7 (2018).","ama":"Kaucka M, Petersen J, Tesarova M, et al. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.34465\">10.7554/eLife.34465</a>","chicago":"Kaucka, Marketa, Julian Petersen, Marketa Tesarova, Bara Szarowska, Maria Kastriti, Meng Xie, Anna Kicheva, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.34465\">https://doi.org/10.7554/eLife.34465</a>.","ieee":"M. Kaucka <i>et al.</i>, “Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Kaucka","full_name":"Kaucka, Marketa","first_name":"Marketa"},{"last_name":"Petersen","full_name":"Petersen, Julian","first_name":"Julian"},{"full_name":"Tesarova, Marketa","first_name":"Marketa","last_name":"Tesarova"},{"first_name":"Bara","full_name":"Szarowska, Bara","last_name":"Szarowska"},{"last_name":"Kastriti","full_name":"Kastriti, Maria","first_name":"Maria"},{"first_name":"Meng","full_name":"Xie, Meng","last_name":"Xie"},{"orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","first_name":"Anna","last_name":"Kicheva"},{"last_name":"Annusver","full_name":"Annusver, Karl","first_name":"Karl"},{"full_name":"Kasper, Maria","first_name":"Maria","last_name":"Kasper"},{"full_name":"Symmons, Orsolya","first_name":"Orsolya","last_name":"Symmons"},{"last_name":"Pan","first_name":"Leslie","full_name":"Pan, Leslie"},{"first_name":"Francois","full_name":"Spitz, Francois","last_name":"Spitz"},{"last_name":"Kaiser","full_name":"Kaiser, Jozef","first_name":"Jozef"},{"last_name":"Hovorakova","first_name":"Maria","full_name":"Hovorakova, Maria"},{"full_name":"Zikmund, Tomas","first_name":"Tomas","last_name":"Zikmund"},{"first_name":"Kazunori","full_name":"Sunadome, Kazunori","last_name":"Sunadome"},{"first_name":"Michael P","full_name":"Matise, Michael P","last_name":"Matise"},{"last_name":"Wang","first_name":"Hui","full_name":"Wang, Hui"},{"last_name":"Marklund","full_name":"Marklund, Ulrika","first_name":"Ulrika"},{"full_name":"Abdo, Hind","first_name":"Hind","last_name":"Abdo"},{"first_name":"Patrik","full_name":"Ernfors, Patrik","last_name":"Ernfors"},{"first_name":"Pascal","full_name":"Maire, Pascal","last_name":"Maire"},{"last_name":"Wurmser","full_name":"Wurmser, Maud","first_name":"Maud"},{"full_name":"Chagin, Andrei S","first_name":"Andrei S","last_name":"Chagin"},{"first_name":"Kaj","full_name":"Fried, Kaj","last_name":"Fried"},{"last_name":"Adameyko","full_name":"Adameyko, Igor","first_name":"Igor"}],"oa":1,"date_updated":"2023-09-18T09:29:07Z","oa_version":"Published Version","department":[{"_id":"AnKi"}],"file":[{"file_name":"2018_eLife_Kaucka.pdf","date_updated":"2020-07-14T12:45:07Z","content_type":"application/pdf","file_size":9816484,"access_level":"open_access","file_id":"5727","date_created":"2018-12-17T16:41:58Z","checksum":"da2378cdcf6b5461dcde194e4d608343","relation":"main_file","creator":"dernst"}],"publisher":"eLife Sciences Publications","article_number":"e34465","intvolume":"         7","language":[{"iso":"eng"}],"status":"public","doi":"10.7554/eLife.34465","publist_id":"7759","abstract":[{"text":"Facial shape is the basis for facial recognition and categorization. Facial features reflect the underlying geometry of the skeletal structures. Here, we reveal that cartilaginous nasal capsule (corresponding to upper jaw and face) is shaped by signals generated by neural structures: brain and olfactory epithelium. Brain-derived Sonic Hedgehog (SHH) enables the induction of nasal septum and posterior nasal capsule, whereas the formation of a capsule roof is controlled by signals from the olfactory epithelium. Unexpectedly, the cartilage of the nasal capsule turned out to be important for shaping membranous facial bones during development. This suggests that conserved neurosensory structures could benefit from protection and have evolved signals inducing cranial cartilages encasing them. Experiments with mutant mice revealed that the genomic regulatory regions controlling production of SHH in the nervous system contribute to facial cartilage morphogenesis, which might be a mechanism responsible for the adaptive evolution of animal faces and snouts.","lang":"eng"}],"isi":1,"related_material":{"record":[{"status":"public","id":"9838","relation":"research_data"}]},"month":"06","day":"13","ec_funded":1,"publication_status":"published"},{"language":[{"iso":"eng"}],"intvolume":"        66","page":"903-921","article_type":"original","publisher":"SAGE Publications","publication_status":"published","day":"01","month":"12","isi":1,"issue":"12","doi":"10.1369/0022155418786698","abstract":[{"lang":"eng","text":"For ultrafast fixation of biological samples to avoid artifacts, high-pressure freezing (HPF) followed by freeze substitution (FS) is preferred over chemical fixation at room temperature. After HPF, samples are maintained at low temperature during dehydration and fixation, while avoiding damaging recrystallization. This is a notoriously slow process. McDonald and Webb demonstrated, in 2011, that sample agitation during FS dramatically reduces the necessary time. Then, in 2015, we (H.G. and S.R.) introduced an agitation module into the cryochamber of an automated FS unit and demonstrated that the preparation of algae could be shortened from days to a couple of hours. We argued that variability in the processing, reproducibility, and safety issues are better addressed using automated FS units. For dissemination, we started low-cost manufacturing of agitation modules for two of the most widely used FS units, the Automatic Freeze Substitution Systems, AFS(1) and AFS2, from Leica Microsystems, using three dimensional (3D)-printing of the major components. To test them, several labs independently used the modules on a wide variety of specimens that had previously been processed by manual agitation, or without agitation. We demonstrate that automated processing with sample agitation saves time, increases flexibility with respect to sample requirements and protocols, and produces data of at least as good quality as other approaches."}],"pmid":1,"status":"public","publication_identifier":{"issn":["0022-1554"]},"year":"2018","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1369/0022155418786698"}],"volume":66,"article_processing_charge":"No","publication":"Journal of Histochemistry and Cytochemistry","date_created":"2018-12-11T11:44:57Z","title":"Agitation modules: Flexible means to accelerate automated freeze substitution","date_published":"2018-12-01T00:00:00Z","quality_controlled":"1","department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"oa_version":"Published Version","date_updated":"2023-10-17T08:42:24Z","author":[{"first_name":"Siegfried","full_name":"Reipert, Siegfried","last_name":"Reipert"},{"first_name":"Helmuth","full_name":"Goldammer, Helmuth","last_name":"Goldammer"},{"last_name":"Richardson","first_name":"Christine","full_name":"Richardson, Christine"},{"last_name":"Goldberg","full_name":"Goldberg, Martin","first_name":"Martin"},{"full_name":"Hawkins, Timothy","first_name":"Timothy","last_name":"Hawkins"},{"last_name":"Hollergschwandtner","first_name":"Elena","full_name":"Hollergschwandtner, Elena","id":"3C054040-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kaufmann","full_name":"Kaufmann, Walter","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315"},{"last_name":"Antreich","first_name":"Sebastian","full_name":"Antreich, Sebastian"},{"full_name":"Stierhof, York","first_name":"York","last_name":"Stierhof"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Reipert, Siegfried, et al. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 66, no. 12, SAGE Publications, 2018, pp. 903–21, doi:<a href=\"https://doi.org/10.1369/0022155418786698\">10.1369/0022155418786698</a>.","apa":"Reipert, S., Goldammer, H., Richardson, C., Goldberg, M., Hawkins, T., Saeckl, E., … Stierhof, Y. (2018). Agitation modules: Flexible means to accelerate automated freeze substitution. <i>Journal of Histochemistry and Cytochemistry</i>. SAGE Publications. <a href=\"https://doi.org/10.1369/0022155418786698\">https://doi.org/10.1369/0022155418786698</a>","ista":"Reipert S, Goldammer H, Richardson C, Goldberg M, Hawkins T, Saeckl E, Kaufmann W, Antreich S, Stierhof Y. 2018. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 66(12), 903–921.","chicago":"Reipert, Siegfried, Helmuth Goldammer, Christine Richardson, Martin Goldberg, Timothy Hawkins, Elena Saeckl, Walter Kaufmann, Sebastian Antreich, and York Stierhof. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” <i>Journal of Histochemistry and Cytochemistry</i>. SAGE Publications, 2018. <a href=\"https://doi.org/10.1369/0022155418786698\">https://doi.org/10.1369/0022155418786698</a>.","ama":"Reipert S, Goldammer H, Richardson C, et al. Agitation modules: Flexible means to accelerate automated freeze substitution. <i>Journal of Histochemistry and Cytochemistry</i>. 2018;66(12):903-921. doi:<a href=\"https://doi.org/10.1369/0022155418786698\">10.1369/0022155418786698</a>","short":"S. Reipert, H. Goldammer, C. Richardson, M. Goldberg, T. Hawkins, E. Saeckl, W. Kaufmann, S. Antreich, Y. Stierhof, Journal of Histochemistry and Cytochemistry 66 (2018) 903–921.","ieee":"S. Reipert <i>et al.</i>, “Agitation modules: Flexible means to accelerate automated freeze substitution,” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 66, no. 12. SAGE Publications, pp. 903–921, 2018."},"type":"journal_article","external_id":{"isi":["000452277700005"],"pmid":["29969056"]},"scopus_import":"1","_id":"163"},{"publisher":"American Physical Society","article_number":"103302 ","intvolume":"         3","language":[{"iso":"eng"}],"status":"public","issue":"10","publist_id":"8038","abstract":[{"lang":"eng","text":"Creeping flow of polymeric fluid without inertia exhibits elastic instabilities and elastic turbulence accompanied by drag enhancement due to elastic stress produced by flow-stretched polymers. However, in inertia-dominated flow at high Re and low fluid elasticity El, a reduction in turbulent frictional drag is caused by an intricate competition between inertial and elastic stresses. Here we explore the effect of inertia on the stability of viscoelastic flow in a broad range of control parameters El and (Re,Wi). We present the stability diagram of observed flow regimes in Wi-Re coordinates and find that the instabilities' onsets show an unexpectedly nonmonotonic dependence on El. Further, three distinct regions in the diagram are identified based on El. Strikingly, for high-elasticity fluids we discover a complete relaminarization of flow at Reynolds number in the range of 1 to 10, different from a well-known turbulent drag reduction. These counterintuitive effects may be explained by a finite polymer extensibility and a suppression of vorticity at high Wi. Our results call for further theoretical and numerical development to uncover the role of inertial effect on elastic turbulence in a viscoelastic flow."}],"doi":"10.1103/PhysRevFluids.3.103302","isi":1,"month":"10","publication_status":"published","day":"15","ec_funded":1,"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_published":"2018-10-15T00:00:00Z","title":"Drag enhancement and drag reduction in viscoelastic flow","quality_controlled":"1","ddc":["532"],"date_created":"2018-12-11T11:44:11Z","year":"2018","publication":"Physical Review Fluids","volume":3,"article_processing_charge":"No","_id":"17","external_id":{"isi":["000447311500001"]},"file_date_updated":"2020-07-14T12:45:12Z","scopus_import":"1","pubrep_id":"1061","type":"journal_article","oa_version":"Published Version","date_updated":"2023-09-11T12:59:28Z","file":[{"creator":"system","relation":"main_file","checksum":"e1445be33e8165114e96246275600750","file_size":1409040,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:12Z","file_name":"IST-2018-1061-v1+1_PhysRevFluids.3.103302.pdf","date_created":"2018-12-12T10:10:14Z","file_id":"4800","access_level":"open_access"}],"department":[{"_id":"BjHo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction in Viscoelastic Flow.” <i>Physical Review Fluids</i>, vol. 3, no. 10, 103302, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">10.1103/PhysRevFluids.3.103302</a>.","apa":"Varshney, A., &#38; Steinberg, V. (2018). Drag enhancement and drag reduction in viscoelastic flow. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">https://doi.org/10.1103/PhysRevFluids.3.103302</a>","ista":"Varshney A, Steinberg V. 2018. Drag enhancement and drag reduction in viscoelastic flow. Physical Review Fluids. 3(10), 103302.","chicago":"Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction in Viscoelastic Flow.” <i>Physical Review Fluids</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">https://doi.org/10.1103/PhysRevFluids.3.103302</a>.","short":"A. Varshney, V. Steinberg, Physical Review Fluids 3 (2018).","ama":"Varshney A, Steinberg V. Drag enhancement and drag reduction in viscoelastic flow. <i>Physical Review Fluids</i>. 2018;3(10). doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">10.1103/PhysRevFluids.3.103302</a>","ieee":"A. Varshney and V. Steinberg, “Drag enhancement and drag reduction in viscoelastic flow,” <i>Physical Review Fluids</i>, vol. 3, no. 10. American Physical Society, 2018."},"has_accepted_license":"1","author":[{"orcid":"0000-0002-3072-5999","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","first_name":"Atul","full_name":"Varshney, Atul","last_name":"Varshney"},{"last_name":"Steinberg","first_name":"Victor","full_name":"Steinberg, Victor"}],"oa":1},{"language":[{"iso":"eng"}],"arxiv":1,"page":"269 - 304","intvolume":"       141","publisher":"Charles Babbage Research Centre","day":"01","publication_status":"published","isi":1,"month":"10","publist_id":"8037","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"issue":"10","publication_identifier":{"issn":["0381-7032"]},"status":"public","publication":"Ars Combinatoria","article_processing_charge":"No","volume":141,"year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"date_created":"2018-12-11T11:44:11Z","quality_controlled":"1","title":"Superconcentrators of density 25.3","date_published":"2018-10-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. 2018;141(10):269-304.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” <i>Ars Combinatoria</i>, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304."},"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rolinek, Michal","last_name":"Rolinek"}],"oa":1,"date_updated":"2023-09-19T14:46:18Z","oa_version":"Preprint","department":[{"_id":"VlKo"}],"type":"journal_article","scopus_import":"1","external_id":{"isi":["000446809500022"],"arxiv":["1405.7828"]},"_id":"18"},{"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"date_published":"2018-07-01T00:00:00Z","title":"Statistical mechanics of the uniform electron gas","quality_controlled":"1","ddc":["510"],"date_created":"2018-12-11T11:45:03Z","year":"2018","publication":"Journal de l'Ecole Polytechnique - Mathematiques","article_processing_charge":"No","volume":5,"_id":"180","external_id":{"arxiv":["1705.10676"]},"file_date_updated":"2020-07-14T12:45:16Z","scopus_import":"1","type":"journal_article","date_updated":"2023-10-17T08:05:28Z","oa_version":"Published Version","file":[{"relation":"main_file","checksum":"1ba7cccdf3900f42c4f715ae75d6813c","creator":"dernst","access_level":"open_access","date_created":"2018-12-17T16:38:18Z","file_id":"5726","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","file_size":843938,"date_updated":"2020-07-14T12:45:16Z","content_type":"application/pdf"}],"department":[{"_id":"RoSe"}],"citation":{"short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","ama":"Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2018;5:79-116. doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>","chicago":"Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2018. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>.","ieee":"M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform electron gas,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5. Ecole Polytechnique, pp. 79–116, 2018.","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116.","mla":"Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5, Ecole Polytechnique, 2018, pp. 79–116, doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>.","apa":"Lewi, M., Lieb, É., &#38; Seiringer, R. (2018). Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","author":[{"first_name":"Mathieu","full_name":"Lewi, Mathieu","last_name":"Lewi"},{"last_name":"Lieb","full_name":"Lieb, Élliott","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"oa":1,"publisher":"Ecole Polytechnique","intvolume":"         5","article_type":"original","page":"79 - 116","arxiv":1,"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["2429-7100"],"eissn":["2270-518X"]},"license":"https://creativecommons.org/licenses/by-nd/4.0/","publist_id":"7741","doi":"10.5802/jep.64","abstract":[{"text":"In this paper we define and study the classical Uniform Electron Gas (UEG), a system of infinitely many electrons whose density is constant everywhere in space. The UEG is defined differently from Jellium, which has a positive constant background but no constraint on the density. We prove that the UEG arises in Density Functional Theory in the limit of a slowly varying density, minimizing the indirect Coulomb energy. We also construct the quantum UEG and compare it to the classical UEG at low density.","lang":"eng"}],"month":"07","publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement 694227 for R.S. and MDFT 725528 for M.L.). Financial support by the Austrian Science Fund (FWF), project No P 27533-N27 (R.S.) and by the US National Science Foundation, grant No PHY12-1265118 (E.H.L.) are gratefully acknowledged.","day":"01","ec_funded":1},{"_id":"181","external_id":{"arxiv":["1708.01546"],"isi":["000437018500032"]},"scopus_import":"1","type":"journal_article","oa_version":"Published Version","date_updated":"2023-09-15T12:05:52Z","department":[{"_id":"LaEr"}],"citation":{"ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(3):3271-3290. doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>.","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3. Society for Industrial and Applied Mathematics , pp. 3271–3290, 2018.","ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 3271–90, doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>.","apa":"Erdös, L., Krüger, T. H., &#38; Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603"},{"full_name":"Krüger, Torben H","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","last_name":"Krüger"},{"first_name":"David T","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87","full_name":"Renfrew, David T","orcid":"0000-0003-3493-121X","last_name":"Renfrew"}],"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"},{"grant_number":"M02080","name":"Structured Non-Hermitian Random Matrices","_id":"258F40A4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"Power law decay for systems of randomly coupled differential equations","date_published":"2018-01-01T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T11:45:03Z","main_file_link":[{"url":"https://arxiv.org/abs/1708.01546","open_access":"1"}],"year":"2018","publication":"SIAM Journal on Mathematical Analysis","article_processing_charge":"No","volume":50,"status":"public","issue":"3","doi":"10.1137/17M1143125","publist_id":"7740","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2."}],"isi":1,"month":"01","acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","publication_status":"published","day":"01","ec_funded":1,"publisher":"Society for Industrial and Applied Mathematics ","intvolume":"        50","page":"3271 - 3290","arxiv":1,"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a densetime real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice."}],"publist_id":"7739","doi":"10.1145/3178126.3178132","publication_identifier":{"isbn":["978-1-4503-5642-8 "]},"status":"public","day":"11","publication_status":"published","month":"04","isi":1,"alternative_title":["HSCC Proceedings"],"publisher":"ACM","language":[{"iso":"eng"}],"page":"177 - 186","scopus_import":"1","file_date_updated":"2020-07-14T12:45:17Z","external_id":{"isi":["000474781600020"]},"_id":"182","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"first_name":"Oded","full_name":"Maler, Oded","last_name":"Maler"}],"oa":1,"has_accepted_license":"1","citation":{"ista":"Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186.","apa":"Bakhirkin, A., Ferrere, T., &#38; Maler, O. (2018). Efficient parametric identification for STL. In <i>Proceedings of the 21st International Conference on Hybrid Systems</i> (pp. 177–186). Porto, Portugal: ACM. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>","mla":"Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, ACM, 2018, pp. 177–86, doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>.","ama":"Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL. In: <i>Proceedings of the 21st International Conference on Hybrid Systems</i>. ACM; 2018:177-186. doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>","short":"A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–186.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric Identification for STL.” In <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, 177–86. ACM, 2018. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>.","ieee":"A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification for STL,” in <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, Porto, Portugal, 2018, pp. 177–186."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"access_level":"open_access","file_id":"7833","date_created":"2020-05-14T12:18:29Z","file_name":"2018_HSCC_Bakhirkin.pdf","date_updated":"2020-07-14T12:45:17Z","content_type":"application/pdf","file_size":5900421,"checksum":"81eabc96430e84336ea88310ac0a1ad0","relation":"main_file","creator":"dernst"}],"department":[{"_id":"ToHe"}],"date_updated":"2023-09-11T13:30:51Z","oa_version":"Submitted Version","type":"conference","quality_controlled":"1","date_published":"2018-04-11T00:00:00Z","title":"Efficient parametric identification for STL","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"conference":{"name":"HSCC: Hybrid Systems: Computation and Control","end_date":"2018-04-13","start_date":"2018-04-11","location":"Porto, Portugal"},"article_processing_charge":"No","publication":"Proceedings of the 21st International Conference on Hybrid Systems","year":"2018","date_created":"2018-12-11T11:45:04Z","ddc":["000"]},{"language":[{"iso":"eng"}],"page":"197 - 206","publisher":"Association for Computing Machinery, Inc","day":"11","publication_status":"published","acknowledgement":"This work was partially supported by the Austrian Science Fund (FWF) under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM), the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI), the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The CPS/IoT project receives support from the Austrian government through the Federal Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel (HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland, Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands, United Kingdom, Slovakia, Norway.","month":"04","isi":1,"alternative_title":["HSCC Proceedings"],"abstract":[{"lang":"eng","text":"Fault-localization is considered to be a very tedious and time-consuming activity in the design of complex Cyber-Physical Systems (CPS). This laborious task essentially requires expert knowledge of the system in order to discover the cause of the fault. In this context, we propose a new procedure that AIDS designers in debugging Simulink/Stateflow hybrid system models, guided by Signal Temporal Logic (STL) specifications. The proposed method relies on three main ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether a tested behavior satisfies or violates an STL specification, localizes time segments and interfaces variables contributing to the property violations; (2) a slicing procedure that maps these observable behavior segments to the internal states and transitions of the Simulink model; and (3) a spectrum-based fault-localization method that combines the previous analysis from multiple tests to identify the internal states and/or transitions that are the most likely to explain the fault. We demonstrate the applicability of our approach on two Simulink models from the automotive and the avionics domain."}],"publist_id":"7738","doi":"10.1145/3178126.3178131","status":"public","article_processing_charge":"No","year":"2018","date_created":"2018-12-11T11:45:04Z","quality_controlled":"1","title":"Localizing faults in simulink/stateflow models with STL","date_published":"2018-04-11T00:00:00Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"conference":{"end_date":"2018-04-13","location":"Porto, Portugal","start_date":"2018-04-11","name":"HSCC: Hybrid Systems: Computation and Control"},"author":[{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere"},{"last_name":"Manjunath","first_name":"Niveditha","full_name":"Manjunath, Niveditha"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","last_name":"Nickovic"}],"citation":{"ieee":"E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal, 2018, pp. 197–206.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, Inc, 2018. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>.","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, Inc, 2018, pp. 197–206.","ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery, Inc; 2018:197-206. doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>","apa":"Bartocci, E., Ferrere, T., Manjunath, N., &#38; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing Machinery, Inc. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>","mla":"Bartocci, Ezio, et al. <i>Localizing Faults in Simulink/Stateflow Models with STL</i>. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>.","ista":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in simulink/stateflow models with STL. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 197–206."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"}],"date_updated":"2023-09-13T08:48:46Z","oa_version":"None","type":"conference","scopus_import":"1","external_id":{"isi":["000474781600022"]},"_id":"183"},{"type":"conference","oa_version":"Published Version","date_updated":"2023-09-06T11:10:57Z","file":[{"checksum":"d12bdd60f04a57307867704b5f930afd","relation":"main_file","creator":"dernst","file_name":"2018_LIPIcs_Goaoc.pdf","date_updated":"2020-07-14T12:45:18Z","content_type":"application/pdf","file_size":718414,"access_level":"open_access","file_id":"5725","date_created":"2018-12-17T16:35:02Z"}],"department":[{"_id":"UlWa"}],"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>","mla":"Goaoc, Xavier, et al. <i>Shellability Is NP-Complete</i>. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16."},"author":[{"last_name":"Goaoc","first_name":"Xavier","full_name":"Goaoc, Xavier"},{"last_name":"Paták","first_name":"Pavel","full_name":"Paták, Pavel"},{"orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","last_name":"Patakova"},{"last_name":"Tancer","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","first_name":"Martin"},{"last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"oa":1,"_id":"184","file_date_updated":"2020-07-14T12:45:18Z","scopus_import":1,"ddc":["516","000"],"date_created":"2018-12-11T11:45:04Z","year":"2018","volume":99,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2018-06-14","location":"Budapest, Hungary","start_date":"2018-06-11"},"title":"Shellability is NP-complete","date_published":"2018-06-11T00:00:00Z","quality_controlled":"1","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"related_material":{"record":[{"relation":"later_version","id":"7108","status":"public"}]},"month":"06","publication_status":"published","acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","day":"11","status":"public","doi":"10.4230/LIPIcs.SoCG.2018.41","publist_id":"7736","abstract":[{"text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes.","lang":"eng"}],"intvolume":"        99","page":"41:1 - 41:16","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"language":[{"iso":"eng"}],"intvolume":"        99","article_number":"39","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","day":"01","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"month":"01","abstract":[{"text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint &quot;pipes&quot; corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.","lang":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2018.39","publist_id":"7735","status":"public","publication_identifier":{"isbn":["978-3-95977-066-8"]},"year":"2018","volume":99,"date_created":"2018-12-11T11:45:04Z","ddc":["510"],"title":"Hanani-Tutte for approximating maps of graphs","date_published":"2018-01-01T00:00:00Z","project":[{"name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","conference":{"location":"Budapest, Hungary","start_date":"2018-06-11","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"UlWa"}],"file":[{"creator":"dernst","relation":"main_file","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","date_created":"2018-12-17T12:33:52Z","file_id":"5701","access_level":"open_access","file_size":718857,"date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","file_name":"2018_LIPIcs_Fulek.pdf"}],"date_updated":"2021-01-12T06:53:36Z","oa_version":"Published Version","oa":1,"author":[{"orcid":"0000-0001-8485-1774","first_name":"Radoslav","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek"},{"first_name":"Jan","full_name":"Kynčl, Jan","last_name":"Kynčl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">https://doi.org/10.4230/LIPIcs.SoCG.2018.39</a>.","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">10.4230/LIPIcs.SoCG.2018.39</a>","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Fulek, R., &#38; Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">https://doi.org/10.4230/LIPIcs.SoCG.2018.39</a>","mla":"Fulek, Radoslav, and Jan Kynčl. <i>Hanani-Tutte for Approximating Maps of Graphs</i>. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">10.4230/LIPIcs.SoCG.2018.39</a>.","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39."},"has_accepted_license":"1","type":"conference","scopus_import":1,"file_date_updated":"2020-07-14T12:45:19Z","_id":"185"}]