[{"_id":"2909","doi":"10.1088/1742-5468/2013/01/P01002","date_created":"2018-12-11T12:00:17Z","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","citation":{"apa":"Barton, N. H., Etheridge, A., &#38; Véber, A. (2013). Modelling evolution in a spatial continuum. <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/2013/01/P01002\">https://doi.org/10.1088/1742-5468/2013/01/P01002</a>","ista":"Barton NH, Etheridge A, Véber A. 2013. Modelling evolution in a spatial continuum. Journal of Statistical Mechanics Theory and Experiment. 2013(1).","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “Modelling Evolution in a Spatial Continuum.” <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing, 2013. <a href=\"https://doi.org/10.1088/1742-5468/2013/01/P01002\">https://doi.org/10.1088/1742-5468/2013/01/P01002</a>.","ama":"Barton NH, Etheridge A, Véber A. Modelling evolution in a spatial continuum. <i>Journal of Statistical Mechanics Theory and Experiment</i>. 2013;2013(1). doi:<a href=\"https://doi.org/10.1088/1742-5468/2013/01/P01002\">10.1088/1742-5468/2013/01/P01002</a>","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “Modelling evolution in a spatial continuum,” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2013, no. 1. IOP Publishing, 2013.","mla":"Barton, Nicholas H., et al. “Modelling Evolution in a Spatial Continuum.” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2013, no. 1, IOP Publishing, 2013, doi:<a href=\"https://doi.org/10.1088/1742-5468/2013/01/P01002\">10.1088/1742-5468/2013/01/P01002</a>.","short":"N.H. Barton, A. Etheridge, A. Véber, Journal of Statistical Mechanics Theory and Experiment 2013 (2013)."},"scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"1","oa_version":"Submitted Version","oa":1,"department":[{"_id":"NiBa"}],"ec_funded":1,"volume":2013,"publication":"Journal of Statistical Mechanics Theory and Experiment","abstract":[{"text":"We survey a class of models for spatially structured populations\r\nwhich we have called spatial Λ-Fleming–Viot processes. They arise from a flexible\r\nframework for modelling in which the key innovation is that random genetic drift\r\nis driven by a Poisson point process of spatial ‘events’. We demonstrate how this\r\novercomes some of the obstructions to modelling populations which evolve in two-\r\n(and higher-) dimensional spatial continua, how its predictions match phenomena\r\nobserved in data and how it fits with classical models. Finally we outline some\r\ndirections for future research.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","title":"Modelling evolution in a spatial continuum","external_id":{"isi":["000315410500003"]},"article_processing_charge":"No","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"publication_status":"published","status":"public","pubrep_id":"557","date_updated":"2025-09-29T13:31:08Z","publisher":"IOP Publishing","year":"2013","day":"16","file":[{"file_size":702583,"date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","creator":"system","access_level":"open_access","checksum":"ce8a4424385b3086138a1e054e16e0e3","date_created":"2018-12-12T10:16:52Z","relation":"main_file","file_id":"5242","file_name":"IST-2016-557-v1+1_BEVrevised.pdf"}],"corr_author":"1","date_published":"2013-01-16T00:00:00Z","ddc":["570"],"author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Etheridge, Alison","first_name":"Alison","last_name":"Etheridge"},{"full_name":"Véber, Amandine","first_name":"Amandine","last_name":"Véber"}],"publist_id":"3834","intvolume":"      2013","isi":1,"has_accepted_license":"1"},{"abstract":[{"text":"Coalescent simulation has become an indispensable tool in population genetics and many complex evolutionary scenarios have been incorporated into the basic algorithm. Despite many years of intense interest in spatial structure, however, there are no available methods to simulate the ancestry of a sample of genes that occupy a spatial continuum. This is mainly due to the severe technical problems encountered by the classical model of isolation\r\nby distance. A recently introduced model solves these technical problems and provides a solid theoretical basis for the study of populations evolving in continuous space. We present a detailed algorithm to simulate the coalescent process in this model, and provide an efficient implementation of a generalised version of this algorithm as a freely available Python module.","lang":"eng"}],"publication":"Bioinformatics","volume":29,"ec_funded":1,"file_date_updated":"2020-07-14T12:45:52Z","title":"Coalescent simulation in continuous space","external_id":{"isi":["000316695700020"]},"page":"955 - 956","article_processing_charge":"No","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152"}],"doi":"10.1093/bioinformatics/btt067","date_created":"2018-12-11T12:00:17Z","_id":"2910","month":"02","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","scopus_import":"1","citation":{"ista":"Kelleher J, Barton NH, Etheridge A. 2013. Coalescent simulation in continuous space. Bioinformatics. 29(7), 955–956.","apa":"Kelleher, J., Barton, N. H., &#38; Etheridge, A. (2013). Coalescent simulation in continuous space. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btt067\">https://doi.org/10.1093/bioinformatics/btt067</a>","short":"J. Kelleher, N.H. Barton, A. Etheridge, Bioinformatics 29 (2013) 955–956.","mla":"Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space.” <i>Bioinformatics</i>, vol. 29, no. 7, Oxford University Press, 2013, pp. 955–56, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btt067\">10.1093/bioinformatics/btt067</a>.","ieee":"J. Kelleher, N. H. Barton, and A. Etheridge, “Coalescent simulation in continuous space,” <i>Bioinformatics</i>, vol. 29, no. 7. Oxford University Press, pp. 955–956, 2013.","ama":"Kelleher J, Barton NH, Etheridge A. Coalescent simulation in continuous space. <i>Bioinformatics</i>. 2013;29(7):955-956. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btt067\">10.1093/bioinformatics/btt067</a>","chicago":"Kelleher, Jerome, Nicholas H Barton, and Alison Etheridge. “Coalescent Simulation in Continuous Space.” <i>Bioinformatics</i>. Oxford University Press, 2013. <a href=\"https://doi.org/10.1093/bioinformatics/btt067\">https://doi.org/10.1093/bioinformatics/btt067</a>."},"issue":"7","quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"oa_version":"Published Version","department":[{"_id":"NiBa"}],"corr_author":"1","ddc":["570"],"date_published":"2013-02-07T00:00:00Z","publist_id":"3833","author":[{"full_name":"Kelleher, Jerome","last_name":"Kelleher","first_name":"Jerome"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"last_name":"Etheridge","first_name":"Alison","full_name":"Etheridge, Alison"}],"intvolume":"        29","isi":1,"has_accepted_license":"1","status":"public","pubrep_id":"556","publication_status":"published","date_updated":"2025-09-29T13:30:36Z","publisher":"Oxford University Press","year":"2013","day":"07","file":[{"access_level":"open_access","date_created":"2018-12-12T10:16:04Z","relation":"main_file","checksum":"a3b54d7477fac923815ac082403d9bd0","content_type":"application/pdf","date_updated":"2020-07-14T12:45:52Z","file_size":170197,"creator":"system","file_id":"5189","file_name":"IST-2016-556-v1+1_bioinformatics-2013.pdf"}]},{"year":"2013","day":"28","date_updated":"2025-09-29T13:29:59Z","publisher":"American Physical Society","publication_status":"published","status":"public","intvolume":"       110","isi":1,"publist_id":"3830","author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Granot Atedgi, Einat","last_name":"Granot Atedgi","first_name":"Einat"},{"first_name":"Ronen","last_name":"Segev","full_name":"Segev, Ronen"},{"full_name":"Schneidman, Elad","last_name":"Schneidman","first_name":"Elad"}],"corr_author":"1","date_published":"2013-01-28T00:00:00Z","oa_version":"Preprint","oa":1,"department":[{"_id":"GaTk"}],"quality_controlled":"1","language":[{"iso":"eng"}],"issue":"5","type":"journal_article","month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Tkačik, G., Granot Atedgi, E., Segev, R., &#38; Schneidman, E. (2013). Retinal metric: a stimulus distance measure derived from population neural responses. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.110.058104\">https://doi.org/10.1103/PhysRevLett.110.058104</a>","ista":"Tkačik G, Granot Atedgi E, Segev R, Schneidman E. 2013. Retinal metric: a stimulus distance measure derived from population neural responses. Physical Review Letters. 110(5), 058104.","ama":"Tkačik G, Granot Atedgi E, Segev R, Schneidman E. Retinal metric: a stimulus distance measure derived from population neural responses. <i>Physical Review Letters</i>. 2013;110(5). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.058104\">10.1103/PhysRevLett.110.058104</a>","chicago":"Tkačik, Gašper, Einat Granot Atedgi, Ronen Segev, and Elad Schneidman. “Retinal Metric: A Stimulus Distance Measure Derived from Population Neural Responses.” <i>Physical Review Letters</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevLett.110.058104\">https://doi.org/10.1103/PhysRevLett.110.058104</a>.","short":"G. Tkačik, E. Granot Atedgi, R. Segev, E. Schneidman, Physical Review Letters 110 (2013).","mla":"Tkačik, Gašper, et al. “Retinal Metric: A Stimulus Distance Measure Derived from Population Neural Responses.” <i>Physical Review Letters</i>, vol. 110, no. 5, 058104, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.058104\">10.1103/PhysRevLett.110.058104</a>.","ieee":"G. Tkačik, E. Granot Atedgi, R. Segev, and E. Schneidman, “Retinal metric: a stimulus distance measure derived from population neural responses,” <i>Physical Review Letters</i>, vol. 110, no. 5. American Physical Society, 2013."},"scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1205.6598","open_access":"1"}],"_id":"2913","doi":"10.1103/PhysRevLett.110.058104","date_created":"2018-12-11T12:00:18Z","external_id":{"arxiv":["1205.6598"],"isi":["000314090300012"]},"article_processing_charge":"No","arxiv":1,"title":"Retinal metric: a stimulus distance measure derived from population neural responses","article_number":"058104","volume":110,"abstract":[{"lang":"eng","text":"The ability of an organism to distinguish between various stimuli is limited by the structure and noise in the population code of its sensory neurons. Here we infer a distance measure on the stimulus space directly from the recorded activity of 100 neurons in the salamander retina. In contrast to previously used measures of stimulus similarity, this &quot;neural metric&quot; tells us how distinguishable a pair of stimulus clips is to the retina, based on the similarity between the induced distributions of population responses. We show that the retinal distance strongly deviates from Euclidean, or any static metric, yet has a simple structure: we identify the stimulus features that the neural population is jointly sensitive to, and show the support-vector-machine- like kernel function relating the stimulus and neural response spaces. We show that the non-Euclidean nature of the retinal distance has important consequences for neural decoding."}],"publication":"Physical Review Letters"},{"file_date_updated":"2020-07-14T12:45:53Z","abstract":[{"text":"The scale invariance of natural images suggests an analogy to the statistical mechanics of physical systems at a critical point. Here we examine the distribution of pixels in small image patches and show how to construct the corresponding thermodynamics. We find evidence for criticality in a diverging specific heat, which corresponds to large fluctuations in how &quot;surprising&quot; we find individual images, and in the quantitative form of the entropy vs energy. We identify special image configurations as local energy minima and show that average patches within each basin are interpretable as lines and edges in all orientations.","lang":"eng"}],"publication":"Physical Review Letters","volume":110,"title":"Statistical thermodynamics of natural images","article_number":"018701","arxiv":1,"article_processing_charge":"No","external_id":{"isi":["000313006100058"],"arxiv":["0806.2694"]},"date_created":"2018-12-11T12:00:19Z","doi":"10.1103/PhysRevLett.110.018701","_id":"2914","acknowledgement":"This work was supported in part by NSF Grants No. IIS-0613435, No. IBN-0344678, and No. PHY-0957573, by NIH Grant No. T32 MH065214, by the Human Frontier Science Program, and by the Swartz Foundation.\r\nCC BY 3.0\r\n","citation":{"apa":"Stephens, G., Mora, T., Tkačik, G., &#38; Bialek, W. (2013). Statistical thermodynamics of natural images. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.110.018701\">https://doi.org/10.1103/PhysRevLett.110.018701</a>","ista":"Stephens G, Mora T, Tkačik G, Bialek W. 2013. Statistical thermodynamics of natural images. Physical Review Letters. 110(1), 018701.","ama":"Stephens G, Mora T, Tkačik G, Bialek W. Statistical thermodynamics of natural images. <i>Physical Review Letters</i>. 2013;110(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.018701\">10.1103/PhysRevLett.110.018701</a>","chicago":"Stephens, Greg, Thierry Mora, Gašper Tkačik, and William Bialek. “Statistical Thermodynamics of Natural Images.” <i>Physical Review Letters</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevLett.110.018701\">https://doi.org/10.1103/PhysRevLett.110.018701</a>.","short":"G. Stephens, T. Mora, G. Tkačik, W. Bialek, Physical Review Letters 110 (2013).","mla":"Stephens, Greg, et al. “Statistical Thermodynamics of Natural Images.” <i>Physical Review Letters</i>, vol. 110, no. 1, 018701, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.018701\">10.1103/PhysRevLett.110.018701</a>.","ieee":"G. Stephens, T. Mora, G. Tkačik, and W. Bialek, “Statistical thermodynamics of natural images,” <i>Physical Review Letters</i>, vol. 110, no. 1. American Physical Society, 2013."},"month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","issue":"1","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"oa_version":"Published Version","oa":1,"ddc":["530"],"date_published":"2013-01-02T00:00:00Z","author":[{"first_name":"Greg","last_name":"Stephens","full_name":"Stephens, Greg"},{"last_name":"Mora","first_name":"Thierry","full_name":"Mora, Thierry"},{"first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"publist_id":"3829","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"intvolume":"       110","has_accepted_license":"1","status":"public","pubrep_id":"401","publication_status":"published","publisher":"American Physical Society","article_type":"original","date_updated":"2025-09-29T13:29:28Z","day":"02","year":"2013","file":[{"file_name":"IST-2016-401-v1+1_1281.full.pdf","file_id":"5366","date_created":"2018-12-12T10:18:44Z","checksum":"72bfbc2094c4680e8a8a6bed668cd06d","relation":"main_file","access_level":"open_access","creator":"system","file_size":416965,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:53Z"}]},{"external_id":{"isi":["000312841300007"]},"article_processing_charge":"No","page":"28 - 39","title":"Anthrax toxin receptor 2a controls mitotic spindle positioning","volume":15,"publication":"Nature Cell Biology","abstract":[{"lang":"eng","text":"Oriented mitosis is essential during tissue morphogenesis. The Wnt/planar cell polarity (Wnt/PCP) pathway orients mitosis in a number of developmental systems, including dorsal epiblast cell divisions along the animal-vegetal (A-V) axis during zebrafish gastrulation. How Wnt signalling orients the mitotic plane is, however, unknown. Here we show that, in dorsal epiblast cells, anthrax toxin receptor 2a (Antxr2a) accumulates in a polarized cortical cap, which is aligned with the embryonic A-V axis and forecasts the division plane. Filamentous actin (F-actin) also forms an A-V polarized cap, which depends on Wnt/PCP and its effectors RhoA and Rock2. Antxr2a is recruited to the cap by interacting with actin. Antxr2a also interacts with RhoA and together they activate the diaphanous-related formin zDia2. Mechanistically, Antxr2a functions as a Wnt-dependent polarized determinant, which, through the action of RhoA and zDia2, exerts torque on the spindle to align it with the A-V axis.\r\n"}],"oa_version":"None","department":[{"_id":"CaHe"}],"quality_controlled":"1","language":[{"iso":"eng"}],"issue":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","citation":{"ama":"Castanon I, Abrami L, Holtzer L, Heisenberg C-PJ, Van Der Goot F, González Gaitán M. Anthrax toxin receptor 2a controls mitotic spindle positioning. <i>Nature Cell Biology</i>. 2013;15(1):28-39. doi:<a href=\"https://doi.org/10.1038/ncb2632\">10.1038/ncb2632</a>","chicago":"Castanon, Irinka, Laurence Abrami, Laurent Holtzer, Carl-Philipp J Heisenberg, Françoise Van Der Goot, and Marcos González Gaitán. “Anthrax Toxin Receptor 2a Controls Mitotic Spindle Positioning.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/ncb2632\">https://doi.org/10.1038/ncb2632</a>.","short":"I. Castanon, L. Abrami, L. Holtzer, C.-P.J. Heisenberg, F. Van Der Goot, M. González Gaitán, Nature Cell Biology 15 (2013) 28–39.","ieee":"I. Castanon, L. Abrami, L. Holtzer, C.-P. J. Heisenberg, F. Van Der Goot, and M. González Gaitán, “Anthrax toxin receptor 2a controls mitotic spindle positioning,” <i>Nature Cell Biology</i>, vol. 15, no. 1. Nature Publishing Group, pp. 28–39, 2013.","mla":"Castanon, Irinka, et al. “Anthrax Toxin Receptor 2a Controls Mitotic Spindle Positioning.” <i>Nature Cell Biology</i>, vol. 15, no. 1, Nature Publishing Group, 2013, pp. 28–39, doi:<a href=\"https://doi.org/10.1038/ncb2632\">10.1038/ncb2632</a>.","apa":"Castanon, I., Abrami, L., Holtzer, L., Heisenberg, C.-P. J., Van Der Goot, F., &#38; González Gaitán, M. (2013). Anthrax toxin receptor 2a controls mitotic spindle positioning. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb2632\">https://doi.org/10.1038/ncb2632</a>","ista":"Castanon I, Abrami L, Holtzer L, Heisenberg C-PJ, Van Der Goot F, González Gaitán M. 2013. Anthrax toxin receptor 2a controls mitotic spindle positioning. Nature Cell Biology. 15(1), 28–39."},"scopus_import":"1","acknowledgement":"This work was supported by the SNSF, the Swiss SystemsX.ch initiative and LipidX-2008/011 (M.G-G. and F.G.v.d.G.), by the Fondation SANTE-Vaduz/Aide au Soutien des Nouvelles Thérapies (F.G.v.d.G.) and by the ERC, the NCCR Frontiers in Genetics and Chemical Biology programmes and the Polish–Swiss research program (M.G-G.).","_id":"2918","doi":"10.1038/ncb2632","date_created":"2018-12-11T12:00:20Z","intvolume":"        15","isi":1,"author":[{"full_name":"Castanon, Irinka","first_name":"Irinka","last_name":"Castanon"},{"full_name":"Abrami, Laurence","last_name":"Abrami","first_name":"Laurence"},{"full_name":"Holtzer, Laurent","first_name":"Laurent","last_name":"Holtzer"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg"},{"full_name":"Van Der Goot, Françoise","last_name":"Van Der Goot","first_name":"Françoise"},{"full_name":"González Gaitán, Marcos","last_name":"González Gaitán","first_name":"Marcos"}],"publist_id":"3819","date_published":"2013-01-01T00:00:00Z","year":"2013","day":"01","date_updated":"2025-09-30T08:16:16Z","publisher":"Nature Publishing Group","publication_status":"published","status":"public"},{"title":"SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism","volume":32,"publication":"EMBO Journal","abstract":[{"text":"The distribution of the phytohormone auxin regulates many aspects of plant development including growth response to gravity. Gravitropic root curvature involves coordinated and asymmetric cell elongation between the lower and upper side of the root, mediated by differential cellular auxin levels. The asymmetry in the auxin distribution is established and maintained by a spatio-temporal regulation of the PIN-FORMED (PIN) auxin transporter activity. We provide novel insights into the complex regulation of PIN abundance and activity during root gravitropism. We show that PIN2 turnover is differentially regulated on the upper and lower side of gravistimulated roots by distinct but partially overlapping auxin feedback mechanisms. In addition to regulating transcription and clathrin-mediated internalization, auxin also controls PIN abundance at the plasma membrane by promoting their vacuolar targeting and degradation. This effect of elevated auxin levels requires the activity of SKP-Cullin-F-box TIR1/AFB (SCF TIR1/AFB)-dependent pathway. Importantly, also suboptimal auxin levels mediate PIN degradation utilizing the same signalling pathway. These feedback mechanisms are functionally important during gravitropic response and ensure fine-tuning of auxin fluxes for maintaining as well as terminating asymmetric growth.","lang":"eng"}],"external_id":{"pmid":["23211744"],"isi":["000316464500009"]},"page":"260 - 274","article_processing_charge":"No","citation":{"apa":"Baster, P., Robert, S., Kleine Vehn, J., Vanneste, S., Kania, U., Grunewald, W., … Friml, J. (2013). SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2012.310\">https://doi.org/10.1038/emboj.2012.310</a>","ista":"Baster P, Robert S, Kleine Vehn J, Vanneste S, Kania U, Grunewald W, De Rybel B, Beeckman T, Friml J. 2013. SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. EMBO Journal. 32(2), 260–274.","ama":"Baster P, Robert S, Kleine Vehn J, et al. SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. <i>EMBO Journal</i>. 2013;32(2):260-274. doi:<a href=\"https://doi.org/10.1038/emboj.2012.310\">10.1038/emboj.2012.310</a>","chicago":"Baster, Pawel, Stéphanie Robert, Jürgen Kleine Vehn, Steffen Vanneste, Urszula Kania, Wim Grunewald, Bert De Rybel, Tom Beeckman, and Jiří Friml. “SCF^TIR1 AFB-Auxin Signalling Regulates PIN Vacuolar Trafficking and Auxin Fluxes during Root Gravitropism.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2012.310\">https://doi.org/10.1038/emboj.2012.310</a>.","short":"P. Baster, S. Robert, J. Kleine Vehn, S. Vanneste, U. Kania, W. Grunewald, B. De Rybel, T. Beeckman, J. Friml, EMBO Journal 32 (2013) 260–274.","ieee":"P. Baster <i>et al.</i>, “SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism,” <i>EMBO Journal</i>, vol. 32, no. 2. Wiley-Blackwell, pp. 260–274, 2013.","mla":"Baster, Pawel, et al. “SCF^TIR1 AFB-Auxin Signalling Regulates PIN Vacuolar Trafficking and Auxin Fluxes during Root Gravitropism.” <i>EMBO Journal</i>, vol. 32, no. 2, Wiley-Blackwell, 2013, pp. 260–74, doi:<a href=\"https://doi.org/10.1038/emboj.2012.310\">10.1038/emboj.2012.310</a>."},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","_id":"2919","date_created":"2018-12-11T12:00:20Z","doi":"10.1038/emboj.2012.310","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3553380/","open_access":"1"}],"department":[{"_id":"JiFr"}],"oa_version":"Submitted Version","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"issue":"2","author":[{"last_name":"Baster","first_name":"Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","full_name":"Baster, Pawel"},{"last_name":"Robert","first_name":"Stéphanie","full_name":"Robert, Stéphanie"},{"last_name":"Kleine Vehn","first_name":"Jürgen","full_name":"Kleine Vehn, Jürgen"},{"first_name":"Steffen","last_name":"Vanneste","full_name":"Vanneste, Steffen"},{"last_name":"Kania","first_name":"Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","full_name":"Kania, Urszula"},{"first_name":"Wim","last_name":"Grunewald","full_name":"Grunewald, Wim"},{"last_name":"De Rybel","first_name":"Bert","full_name":"De Rybel, Bert"},{"first_name":"Tom","last_name":"Beeckman","full_name":"Beeckman, Tom"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","last_name":"Friml","first_name":"Jirí"}],"publist_id":"3818","date_published":"2013-01-23T00:00:00Z","corr_author":"1","isi":1,"intvolume":"        32","publisher":"Wiley-Blackwell","date_updated":"2025-09-29T13:28:19Z","pmid":1,"publication_status":"published","status":"public","day":"23","year":"2013"},{"publisher":"Wiley-Blackwell","date_updated":"2025-09-29T13:27:27Z","pmid":1,"publication_status":"published","status":"public","day":"09","year":"2013","publist_id":"3817","author":[{"id":"2E3E0988-F248-11E8-B48F-1D18A9856A87","full_name":"Compagnon, Julien","last_name":"Compagnon","first_name":"Julien"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"date_published":"2013-01-09T00:00:00Z","corr_author":"1","isi":1,"intvolume":"        32","citation":{"short":"J. Compagnon, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 1–3.","mla":"Compagnon, Julien, and Carl-Philipp J. Heisenberg. “Neurulation Coordinating Cell Polarisation and Lumen Formation.” <i>EMBO Journal</i>, vol. 32, no. 1, Wiley-Blackwell, 2013, pp. 1–3, doi:<a href=\"https://doi.org/10.1038/emboj.2012.325\">10.1038/emboj.2012.325</a>.","ieee":"J. Compagnon and C.-P. J. Heisenberg, “Neurulation coordinating cell polarisation and lumen formation,” <i>EMBO Journal</i>, vol. 32, no. 1. Wiley-Blackwell, pp. 1–3, 2013.","ama":"Compagnon J, Heisenberg C-PJ. Neurulation coordinating cell polarisation and lumen formation. <i>EMBO Journal</i>. 2013;32(1):1-3. doi:<a href=\"https://doi.org/10.1038/emboj.2012.325\">10.1038/emboj.2012.325</a>","chicago":"Compagnon, Julien, and Carl-Philipp J Heisenberg. “Neurulation Coordinating Cell Polarisation and Lumen Formation.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2012.325\">https://doi.org/10.1038/emboj.2012.325</a>.","ista":"Compagnon J, Heisenberg C-PJ. 2013. Neurulation coordinating cell polarisation and lumen formation. EMBO Journal. 32(1), 1–3.","apa":"Compagnon, J., &#38; Heisenberg, C.-P. J. (2013). Neurulation coordinating cell polarisation and lumen formation. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2012.325\">https://doi.org/10.1038/emboj.2012.325</a>"},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","_id":"2920","date_created":"2018-12-11T12:00:20Z","doi":"10.1038/emboj.2012.325","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3545307/"}],"department":[{"_id":"CaHe"}],"oa_version":"Submitted Version","oa":1,"language":[{"iso":"eng"}],"quality_controlled":"1","issue":"1","title":"Neurulation coordinating cell polarisation and lumen formation","volume":32,"publication":"EMBO Journal","abstract":[{"lang":"eng","text":"Cell polarisation in development is a common and fundamental process underlying embryo patterning and morphogenesis, and has been extensively studied over the past years. Our current knowledge of cell polarisation in development is predominantly based on studies that have analysed polarisation of single cells, such as eggs, or cellular aggregates with a stable polarising interface, such as cultured epithelial cells (St Johnston and Ahringer, 2010). However, in embryonic development, particularly of vertebrates, cell polarisation processes often encompass large numbers of cells that are placed within moving and proliferating tissues, and undergo mesenchymal-to-epithelial transitions with a highly complex spatiotemporal choreography. How such intricate cell polarisation processes in embryonic development are achieved has only started to be analysed. By using live imaging of neurulation in the transparent zebrafish embryo, Buckley et al (2012) now describe a novel polarisation strategy by which cells assemble an apical domain in the part of their cell body that intersects with the midline of the forming neural rod. This mechanism, along with the previously described mirror-symmetric divisions (Tawk et al, 2007), is thought to trigger formation of both neural rod midline and lumen."}],"external_id":{"isi":["000314141900001"],"pmid":["23211745"]},"page":"1 - 3","article_processing_charge":"No"},{"publist_id":"3811","author":[{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","full_name":"Tragust, Simon","last_name":"Tragust","first_name":"Simon"},{"first_name":"Barbara","last_name":"Mitteregger","full_name":"Mitteregger, Barbara","id":"479DDAAC-E9CD-11E9-9B5F-82450873F7A1"},{"orcid":"0000-0003-2676-3367","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","full_name":"Barone, Vanessa","last_name":"Barone","first_name":"Vanessa"},{"id":"46528076-F248-11E8-B48F-1D18A9856A87","full_name":"Konrad, Matthias","last_name":"Konrad","first_name":"Matthias"},{"first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883"},{"first_name":"Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","date_published":"2013-01-07T00:00:00Z","intvolume":"        23","isi":1,"date_updated":"2026-04-08T14:22:39Z","publisher":"Cell Press","publication_status":"published","status":"public","year":"2013","day":"07","title":"Ants disinfect fungus-exposed brood by oral uptake and spread of their poison","volume":23,"ec_funded":1,"abstract":[{"lang":"eng","text":"To fight infectious diseases, host immune defenses are employed at multiple levels. Sanitary behavior, such as pathogen avoidance and removal, acts as a first line of defense to prevent infection [1] before activation of the physiological immune system. Insect societies have evolved a wide range of collective hygiene measures and intensive health care toward pathogen-exposed group members [2]. One of the most common behaviors is allogrooming, in which nestmates remove infectious particles from the body surfaces of exposed individuals [3]. Here we show that, in invasive garden ants, grooming of fungus-exposed brood is effective beyond the sheer mechanical removal of fungal conidiospores; it also includes chemical disinfection through the application of poison produced by the ants themselves. Formic acid is the main active component of the poison. It inhibits fungal growth of conidiospores remaining on the brood surface after grooming and also those collected in the mouth of the grooming ant. This dual function is achieved by uptake of the poison droplet into the mouth through acidopore self-grooming and subsequent application onto the infectious brood via brood grooming. This extraordinary behavior extends the current understanding of grooming and the establishment of social immunity in insect societies."}],"publication":"Current Biology","page":"76 - 82","article_processing_charge":"No","external_id":{"isi":["000313383700026"]},"project":[{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"},{"call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","grant_number":"302004","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","citation":{"mla":"Tragust, Simon, et al. “Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” <i>Current Biology</i>, vol. 23, no. 1, Cell Press, 2013, pp. 76–82, doi:<a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">10.1016/j.cub.2012.11.034</a>.","ieee":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Ants disinfect fungus-exposed brood by oral uptake and spread of their poison,” <i>Current Biology</i>, vol. 23, no. 1. Cell Press, pp. 76–82, 2013.","short":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer, Current Biology 23 (2013) 76–82.","chicago":"Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad, Line V Ugelvig, and Sylvia Cremer. “Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">https://doi.org/10.1016/j.cub.2012.11.034</a>.","ama":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. <i>Current Biology</i>. 2013;23(1):76-82. doi:<a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">10.1016/j.cub.2012.11.034</a>","ista":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2013. Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. Current Biology. 23(1), 76–82.","apa":"Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &#38; Cremer, S. (2013). Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">https://doi.org/10.1016/j.cub.2012.11.034</a>"},"scopus_import":"1","acknowledgement":"Funding for this project was obtained by the German Research Foundation (DFG, to S.C.) and the European Research Council (ERC, through an ERC-Starting Grant to S.C. and an Individual Marie Curie IEF fellowship to L.V.U.).\r\nWe thank Jørgen Eilenberg, Bernhardt Steinwender, Miriam Stock, and Meghan L. Vyleta for the fungal strain and its characterization; Volker Witte for chemical information; Eva Sixt for ant drawings; and Robert Hauschild for help with image analysis. We further thank Martin Kaltenpoth, Michael Sixt, Jürgen Heinze, and Joachim Ruther for discussion and Daria Siekhaus, Sophie A.O. Armitage, and Leila Masri for comments on the manuscript. \r\n","related_material":{"record":[{"relation":"research_data","status":"public","id":"9757"},{"id":"961","status":"public","relation":"dissertation_contains"}]},"_id":"2926","date_created":"2018-12-11T12:00:23Z","doi":"10.1016/j.cub.2012.11.034","oa_version":"None","department":[{"_id":"SyCr"},{"_id":"CaHe"}],"language":[{"iso":"eng"}],"quality_controlled":"1","issue":"1"},{"date_published":"2013-05-01T00:00:00Z","corr_author":"1","publist_id":"3796","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"},{"full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"}],"isi":1,"intvolume":"        46","status":"public","publication_status":"published","publisher":"Elsevier","date_updated":"2025-09-29T13:26:21Z","day":"01","year":"2013","publication":"Computational Geometry: Theory and Applications","abstract":[{"text":"In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ &gt; 0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0, 1), the running time is O (C (1 - δ) Γ R d (n) log n), where C (1 - δ) Γ is the number of homology classes with persistence at least (1 - δ) Γ, n is the total number of simplices in the complex, d its dimension, and R d (n) is the complexity of computing the rank of an n × n matrix with O (d n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O (C (1 - δ) Γ n 2.376) algorithm, an O (C (1 - δ) Γ n 2.28) Las-Vegas algorithm, or an O (C (1 - δ) Γ n 2 + ε{lunate}) Monte-Carlo algorithm for an arbitrary ε{lunate} &gt; 0. The space complexity of the Monte-Carlo version is bounded by O (d n) = O (n log n).","lang":"eng"}],"volume":46,"title":"An output sensitive algorithm for persistent homology","article_processing_charge":"No","external_id":{"isi":["000314437000004"]},"page":"435 - 447","doi":"10.1016/j.comgeo.2012.02.010","date_created":"2018-12-11T12:00:27Z","_id":"2939","related_material":{"record":[{"id":"3367","status":"public","relation":"earlier_version"}]},"acknowledgement":"The authors thank Herbert Edelsbrunner for many helpful discussions and suggestions. Moreover, they are grateful for the careful reviews that helped to improve the quality of the paper.","scopus_import":"1","citation":{"chicago":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>.","ama":"Chen C, Kerber M. An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. 2013;46(4):435-447. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>","mla":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>.","ieee":"C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4. Elsevier, pp. 435–447, 2013.","short":"C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.","apa":"Chen, C., &#38; Kerber, M. (2013). An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>","ista":"Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"05","type":"journal_article","issue":"4","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"oa_version":"None"},{"publication_status":"published","status":"public","publisher":"Springer","date_updated":"2025-09-18T11:37:22Z","day":"29","year":"2013","file":[{"file_size":414823,"date_updated":"2020-07-14T12:45:54Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"beb0cc1c0579da2d2e84394230a5da78","date_created":"2019-01-22T14:11:11Z","relation":"main_file","file_id":"5875","file_name":"2013_LNCS_Krenn.pdf"}],"ddc":["000"],"date_published":"2013-01-29T00:00:00Z","publist_id":"3795","author":[{"last_name":"Krenn","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan","orcid":"0000-0003-2835-9093"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Akshay","last_name":"Wadia","full_name":"Wadia, Akshay"}],"intvolume":"      7785","editor":[{"last_name":"Sahai","first_name":"Amit","full_name":"Sahai, Amit"}],"has_accepted_license":"1","_id":"2940","related_material":{"record":[{"id":"1479","relation":"later_version","status":"public"}]},"doi":"10.1007/978-3-642-36594-2_2","date_created":"2018-12-11T12:00:27Z","citation":{"ama":"Krenn S, Pietrzak KZ, Wadia A. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In: Sahai A, ed. Vol 7785. Springer; 2013:23-39. doi:<a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">10.1007/978-3-642-36594-2_2</a>","chicago":"Krenn, Stephan, Krzysztof Z Pietrzak, and Akshay Wadia. “A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It.” edited by Amit Sahai, 7785:23–39. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">https://doi.org/10.1007/978-3-642-36594-2_2</a>.","short":"S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.","ieee":"S. Krenn, K. Z. Pietrzak, and A. Wadia, “A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it,” presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan, 2013, vol. 7785, pp. 23–39.","mla":"Krenn, Stephan, et al. <i>A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It</i>. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:<a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">10.1007/978-3-642-36594-2_2</a>.","apa":"Krenn, S., Pietrzak, K. Z., &#38; Wadia, A. (2013). A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In A. Sahai (Ed.) (Vol. 7785, pp. 23–39). Presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">https://doi.org/10.1007/978-3-642-36594-2_2</a>","ista":"Krenn S, Pietrzak KZ, Wadia A. 2013. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. TCC: Theory of Cryptography Conference, LNCS, vol. 7785, 23–39."},"scopus_import":1,"type":"conference","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"oa":1,"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:54Z","alternative_title":["LNCS"],"volume":7785,"ec_funded":1,"abstract":[{"text":"A chain rule for an entropy notion H(.) states that the entropy H(X) of a variable X decreases by at most l if conditioned on an l-bit string A, i.e., H(X|A)&gt;= H(X)-l. More generally, it satisfies a chain rule for conditional entropy if H(X|Y,A)&gt;= H(X|Y)-l.\r\n\r\nAll natural information theoretic entropy notions we are aware of (like Shannon or min-entropy) satisfy some kind of chain rule for conditional entropy. Moreover, many computational entropy notions (like Yao entropy, unpredictability entropy and several variants of HILL entropy) satisfy the chain rule for conditional entropy, though here not only the quantity decreases by l, but also the quality of the entropy decreases exponentially in l. However, for \r\nthe standard notion of conditional HILL entropy (the computational equivalent of min-entropy) the existence of such a rule was unknown so far.\r\n\r\nIn this paper, we prove that for conditional HILL entropy no meaningful chain rule exists, assuming the existence of one-way permutations: there exist distributions X,Y,A, where A is a distribution over a single bit, but  $H(X|Y)&gt;&gt;H(X|Y,A)$, even if we simultaneously allow for a massive degradation in the quality of the entropy.\r\n\r\nThe idea underlying our construction is based on a surprising connection between the chain rule for HILL entropy and deniable encryption. ","lang":"eng"}],"title":"A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"conference":{"start_date":"2013-03-03","end_date":"2013-03-06","location":"Tokyo, Japan","name":"TCC: Theory of Cryptography Conference"},"page":"23 - 39"},{"day":"01","year":"2013","publication_status":"published","status":"public","publisher":"Wiley-Blackwell","date_updated":"2025-09-29T13:25:36Z","isi":1,"intvolume":"        22","date_published":"2013-02-01T00:00:00Z","corr_author":"1","publist_id":"3788","author":[{"id":"2D35326E-F248-11E8-B48F-1D18A9856A87","full_name":"Aeschbacher, Simon","last_name":"Aeschbacher","first_name":"Simon"},{"full_name":"Futschik, Andreas","last_name":"Futschik","first_name":"Andreas"},{"last_name":"Beaumont","first_name":"Mark","full_name":"Beaumont, Mark"}],"quality_controlled":"1","language":[{"iso":"eng"}],"issue":"4","department":[{"_id":"NiBa"}],"oa_version":"None","_id":"2944","related_material":{"record":[{"status":"public","relation":"research_data","id":"9758"}]},"doi":"10.1111/mec.12165","date_created":"2018-12-11T12:00:28Z","acknowledgement":"This study has made use of the computational resources provided by IST Austria and the Edinburgh Compute and Data Facility (ECDF; http://www.ecdf.ed.ac.uk). The ECDF is partially supported by the eDIKT initiative (http://www.edikt.org.uk). S.A. acknowledges financial support by IST Austria, the Janggen-Pöhn Foundation, St. Gallen, the Roche Research Foundation, Basel, the University of Edinburgh in the form of a Torrance Studentship, and the Austrian Science Fund (FWF P21305-N13).","citation":{"mla":"Aeschbacher, Simon, et al. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>, vol. 22, no. 4, Wiley-Blackwell, 2013, pp. 987–1002, doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>.","ieee":"S. Aeschbacher, A. Futschik, and M. Beaumont, “Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. ,” <i>Molecular Ecology</i>, vol. 22, no. 4. Wiley-Blackwell, pp. 987–1002, 2013.","short":"S. Aeschbacher, A. Futschik, M. Beaumont, Molecular Ecology 22 (2013) 987–1002.","chicago":"Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>.","ama":"Aeschbacher S, Futschik A, Beaumont M. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. 2013;22(4):987-1002. doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>","ista":"Aeschbacher S, Futschik A, Beaumont M. 2013. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . Molecular Ecology. 22(4), 987–1002.","apa":"Aeschbacher, S., Futschik, A., &#38; Beaumont, M. (2013). Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>"},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"02","acknowledged_ssus":[{"_id":"ScienComp"}],"page":"987 - 1002","external_id":{"isi":["000314220900008"]},"article_processing_charge":"No","volume":22,"publication":"Molecular Ecology","abstract":[{"lang":"eng","text":"We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction."}],"title":"Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. "},{"day":"04","year":"2013","file":[{"file_name":"2012_ACCV_Tommasi.pdf","file_id":"5874","checksum":"a0a7234a89e2192af655b0d0ae3bf445","date_created":"2019-01-22T14:03:11Z","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":1513620,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:55Z"}],"status":"public","publication_status":"published","publisher":"Springer","series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:54Z","intvolume":"      7724","has_accepted_license":"1","date_published":"2013-04-04T00:00:00Z","ddc":["000"],"publist_id":"3784","author":[{"first_name":"Tatiana","last_name":"Tommasi","full_name":"Tommasi, Tatiana"},{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"full_name":"Caputo, Barbara","last_name":"Caputo","first_name":"Barbara"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"ChLa"}],"oa":1,"oa_version":"Submitted Version","date_created":"2018-12-11T12:00:30Z","doi":"10.1007/978-3-642-37331-2_1","_id":"2948","acknowledgement":"This work was supported by the PASCAL 2 Network of Excellence (TT) and by the Newton International Fellowship (NQ)","scopus_import":1,"citation":{"ista":"Tommasi T, Quadrianto N, Caputo B, Lampert C. 2013. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 7724, 1–15.","apa":"Tommasi, T., Quadrianto, N., Caputo, B., &#38; Lampert, C. (2013). Beyond dataset bias: Multi-task unaligned shared knowledge transfer. Presented at the ACCV: Asian Conference on Computer Vision, Daejeon, Korea: Springer. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>","short":"T. Tommasi, N. Quadrianto, B. Caputo, C. Lampert, 7724 (2013) 1–15.","mla":"Tommasi, Tatiana, et al. <i>Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer</i>. Vol. 7724, Springer, 2013, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>.","ieee":"T. Tommasi, N. Quadrianto, B. Caputo, and C. Lampert, “Beyond dataset bias: Multi-task unaligned shared knowledge transfer,” vol. 7724. Springer, pp. 1–15, 2013.","ama":"Tommasi T, Quadrianto N, Caputo B, Lampert C. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 2013;7724:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>","chicago":"Tommasi, Tatiana, Novi Quadrianto, Barbara Caputo, and Christoph Lampert. “Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","type":"conference","conference":{"location":"Daejeon, Korea","name":"ACCV: Asian Conference on Computer Vision","end_date":"2012-11-09","start_date":"2012-11-05"},"page":"1 - 15","file_date_updated":"2020-07-14T12:45:55Z","abstract":[{"text":"Many visual datasets are traditionally used to analyze the performance of different learning techniques. The evaluation is usually done within each dataset, therefore it is questionable if such results are a reliable indicator of true generalization ability. We propose here an algorithm to exploit the existing data resources when learning on a new multiclass problem. Our main idea is to identify an image representation that decomposes orthogonally into two subspaces: a part specific to each dataset, and a part generic to, and therefore shared between, all the considered source sets. This allows us to use the generic representation as un-biased reference knowledge for a novel classification task. By casting the method in the multi-view setting, we also make it possible to use different features for different databases. We call the algorithm MUST, Multitask Unaligned Shared knowledge Transfer. Through extensive experiments on five public datasets, we show that MUST consistently improves the cross-datasets generalization performance.","lang":"eng"}],"volume":7724,"alternative_title":["LNCS"],"title":"Beyond dataset bias: Multi-task unaligned shared knowledge transfer"},{"department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"scopus_import":1,"citation":{"ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","type":"conference","doi":"10.1145/2429069.2429109","date_created":"2018-12-11T11:56:11Z","_id":"2181","publication_identifier":{"isbn":["978-1-4503-1832-7"]},"related_material":{"record":[{"id":"10901","relation":"later_version","status":"deleted"}]},"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2013-01-23","end_date":"2013-01-25","name":"POPL: Principles of Programming Languages","location":"Rome, Italy"},"page":"317 - 328","title":"Quantitative relaxation of concurrent data structures","file_date_updated":"2020-07-14T12:45:31Z","abstract":[{"lang":"eng","text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones."}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","ec_funded":1,"file":[{"file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","file_id":"5086","creator":"system","date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf","file_size":294689,"date_created":"2018-12-12T10:14:33Z","checksum":"adf465e70948f4e80e48057524516456","relation":"main_file","access_level":"open_access"}],"day":"01","year":"2013","publisher":"ACM","date_updated":"2023-02-21T16:06:49Z","status":"public","pubrep_id":"198","publication_status":"published","has_accepted_license":"1","publist_id":"4801","author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"ddc":["000","004"],"date_published":"2013-01-01T00:00:00Z"},{"publication_status":"published","_id":"2182","status":"public","date_created":"2018-12-11T11:56:11Z","doi":"10.1145/2429069.2429085","citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>"},"publisher":"ACM","scopus_import":1,"type":"conference","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:55:21Z","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","year":"2013","department":[{"_id":"ToHe"}],"oa_version":"None","date_published":"2013-01-01T00:00:00Z","corr_author":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed."}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","publist_id":"4800","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"title":"Quantitative abstraction refinement","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"page":"115 - 128","conference":{"name":"POPL: Principles of Programming Languages","location":"Rome, Italy","end_date":"2013-01-25","start_date":"2013-07-23"}},{"series_title":"Leibniz International Proceedings in Informatics","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2024-10-09T20:55:23Z","publication_status":"published","status":"public","pubrep_id":"624","file":[{"creator":"system","file_size":547296,"date_updated":"2020-07-14T12:44:47Z","content_type":"application/pdf","date_created":"2018-12-12T10:13:38Z","checksum":"b7091a3866db573c0db5ec486952255e","relation":"main_file","access_level":"open_access","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","file_id":"5023"}],"day":"01","year":"2013","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël","last_name":"Fijalkow"}],"publist_id":"5837","date_published":"2013-09-01T00:00:00Z","ddc":["000"],"corr_author":"1","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"        23","citation":{"mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” <i>22nd EACSL Annual Conference on Computer Science Logic</i>, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in <i>22nd EACSL Annual Conference on Computer Science Logic</i>, Torino, Italy, 2013, vol. 23, pp. 181–196.","short":"K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In <i>22nd EACSL Annual Conference on Computer Science Logic</i>, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: <i>22nd EACSL Annual Conference on Computer Science Logic</i>. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>","ista":"Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In <i>22nd EACSL Annual Conference on Computer Science Logic</i> (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>"},"scopus_import":1,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","_id":"1374","doi":"10.4230/LIPIcs.CSL.2013.181","date_created":"2018-12-11T11:51:39Z","department":[{"_id":"KrCh"}],"oa":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Infinite-state games with finitary conditions","file_date_updated":"2020-07-14T12:44:47Z","ec_funded":1,"alternative_title":["LIPIcs"],"volume":23,"abstract":[{"text":"We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.","lang":"eng"}],"publication":"22nd EACSL Annual Conference on Computer Science Logic","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"181 - 196","conference":{"location":"Torino, Italy","name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"203-09-02"}},{"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas"}],"publist_id":"5835","date_published":"2013-12-11T00:00:00Z","corr_author":"1","OA_type":"green","day":"11","year":"2013","publisher":"IEEE","date_updated":"2025-06-26T08:33:43Z","status":"public","publication_status":"published","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"start_date":"2013-10-20","end_date":"2013-10-23","location":"Portland, OR, United States","name":"FMCAD: Formal Methods in Computer-Aided Design"},"article_processing_charge":"No","page":"18 - 25","title":"Distributed synthesis for LTL fragments","publication":"13th International Conference on Formal Methods in Computer-Aided Design","abstract":[{"text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.","lang":"eng"}],"ec_funded":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Preprint","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"OA_place":"repository","scopus_import":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>"},"month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_created":"2018-12-11T11:51:40Z","doi":"10.1109/FMCAD.2013.6679386","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5406"}]},"_id":"1376","main_file_link":[{"open_access":"1","url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1"}]},{"scopus_import":"1","citation":{"ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>","mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","type":"conference","date_created":"2018-12-11T11:51:43Z","doi":"10.1109/FMCAD.2013.6679394","_id":"1385","main_file_link":[{"url":"http://arxiv.org/abs/1308.4767","open_access":"1"}],"acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","department":[{"_id":"ToHe"}],"oa":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Synthesizing multiple boolean functions using interpolation on a single proof","abstract":[{"lang":"eng","text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results."}],"publication":"2013 Formal Methods in Computer-Aided Design","ec_funded":1,"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"conference":{"location":"Portland, OR, United States","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","end_date":"2013-10-23"},"external_id":{"arxiv":["1308.4767"]},"page":"77 - 84","arxiv":1,"publisher":"IEEE","date_updated":"2024-10-21T06:02:56Z","status":"public","publication_status":"published","day":"11","year":"2013","publist_id":"5825","author":[{"full_name":"Hofferek, Georg","last_name":"Hofferek","first_name":"Georg"},{"last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"full_name":"Könighofer, Bettina","last_name":"Könighofer","first_name":"Bettina"},{"last_name":"Jiang","first_name":"Jie","full_name":"Jiang, Jie"},{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"}],"date_published":"2013-12-11T00:00:00Z"},{"publist_id":"5823","author":[{"last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"full_name":"Kuperberg, Denis","first_name":"Denis","last_name":"Kuperberg"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"full_name":"Skrzypczak, Michał","first_name":"Michał","last_name":"Skrzypczak"}],"ddc":["000"],"date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","intvolume":"      7966","publisher":"Springer","series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:09Z","publication_status":"published","status":"public","file":[{"checksum":"98bc02e3793072e279ec8d364b381ff3","date_created":"2020-05-15T11:05:50Z","relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:44:48Z","file_size":276982,"file_name":"2013_ICALP_Boker.pdf","file_id":"7857"}],"day":"01","year":"2013","title":"Nondeterminism in the presence of a diverse or unknown future","file_date_updated":"2020-07-14T12:44:48Z","alternative_title":["LNCS"],"volume":7966,"ec_funded":1,"abstract":[{"lang":"eng","text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata."}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"conference":{"end_date":"2013-07-12","start_date":"2013-07-08","location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming"},"page":"89 - 100","article_processing_charge":"No","citation":{"apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>","mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100."},"scopus_import":1,"type":"conference","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1387","doi":"10.1007/978-3-642-39212-2_11","date_created":"2018-12-11T11:51:44Z","acknowledgement":"and ERC Grant QUALITY.","department":[{"_id":"ToHe"}],"oa":1,"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"PART 2"},{"abstract":[{"text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.","lang":"eng"}],"ec_funded":1,"alternative_title":["ISTA Thesis"],"file_date_updated":"2021-11-17T13:47:58Z","title":"Analysis of dynamic message passing programs","page":"134","article_processing_charge":"No","supervisor":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","date_created":"2018-12-11T11:51:50Z","doi":"10.15479/at:ista:1405","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"4361"},{"relation":"part_of_dissertation","status":"public","id":"3251"},{"id":"2847","relation":"part_of_dissertation","status":"public"}]},"_id":"1405","publication_identifier":{"issn":["2663-337X"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"09","type":"dissertation","degree_awarded":"PhD","citation":{"ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.","mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>."},"OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"oa_version":"Published Version","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"corr_author":"1","date_published":"2013-09-05T00:00:00Z","ddc":["000"],"publist_id":"5802","author":[{"orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey"}],"has_accepted_license":"1","status":"public","publication_status":"published","date_updated":"2026-04-09T14:35:24Z","publisher":"Institute of Science and Technology Austria","year":"2013","day":"05","file":[{"content_type":"application/pdf","date_updated":"2021-02-22T11:28:36Z","file_size":1514906,"creator":"dernst","access_level":"open_access","checksum":"ed2d7b52933d134e8dc69d569baa284e","relation":"main_file","date_created":"2021-02-22T11:28:36Z","success":1,"file_id":"9176","file_name":"2013_Zufferey_thesis_final.pdf"},{"date_created":"2021-11-16T14:42:52Z","checksum":"cecc4c4b14225bee973d32e3dba91a55","relation":"main_file","access_level":"closed","creator":"cchlebak","date_updated":"2021-11-17T13:47:58Z","content_type":"application/pdf","file_size":1378313,"file_name":"2013_Zufferey_thesis_final_pdfa.pdf","file_id":"10298"}]},{"publist_id":"5801","author":[{"id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416","last_name":"Campinho","first_name":"Pedro"}],"title":"Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading","date_published":"2013-10-01T00:00:00Z","abstract":[{"lang":"eng","text":"Epithelial spreading is a critical part of various developmental and wound repair processes. Here we use zebrafish epiboly as a model system to study the cellular and molecular mechanisms underlying the spreading of epithelial sheets. During zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the embryo to eventually cover the entire yolk cell by the end of gastrulation. The EVL leading edge is anchored through tight junctions to the yolk syncytial layer (YSL), where directly adjacent to the EVL margin a contractile actomyosin ring is formed that is thought to drive EVL epiboly. The prevalent view in the field was that the contractile ring exerts a pulling force on the EVL margin, which pulls the EVL towards the vegetal pole. However, how this force is generated and how it affects EVL morphology still remains elusive. Moreover, the cellular mechanisms mediating the increase in EVL surface area, while maintaining tissue integrity and function are still unclear. Here we show that the YSL actomyosin ring pulls on the EVL margin by two distinct force-generating mechanisms. One mechanism is based on contraction of the ring around its circumference, as previously proposed. The second mechanism is based on actomyosin retrogade flows, generating force through resistance against the substrate. The latter can function at any epiboly stage even in situations where the contraction-based mechanism is unproductive. Additionally, we demonstrate that during epiboly the EVL is subjected to anisotropic tension, which guides the orientation of EVL cell division along the main axis (animal-vegetal) of tension. The influence of tension in cell division orientation involves cell elongation and requires myosin-2 activity for proper spindle alignment. Strikingly, we reveal that tension-oriented cell divisions release anisotropic tension within the EVL and that in the absence of such divisions, EVL cells undergo ectopic fusions. We conclude that forces applied to the EVL by the action of the YSL actomyosin ring generate a tension anisotropy in the EVL that orients cell divisions, which in turn limit tissue tension increase thereby facilitating tissue spreading."}],"corr_author":"1","alternative_title":["ISTA Thesis"],"page":"123","article_processing_charge":"No","supervisor":[{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"degree_awarded":"PhD","citation":{"ista":"Campinho P. 2013. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. Institute of Science and Technology Austria.","apa":"Campinho, P. (2013). <i>Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading</i>. Institute of Science and Technology Austria.","mla":"Campinho, Pedro. <i>Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading</i>. Institute of Science and Technology Austria, 2013.","ieee":"P. Campinho, “Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading,” Institute of Science and Technology Austria, 2013.","short":"P. Campinho, Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading, Institute of Science and Technology Austria, 2013.","chicago":"Campinho, Pedro. “Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading.” Institute of Science and Technology Austria, 2013.","ama":"Campinho P. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. 2013."},"publisher":"Institute of Science and Technology Austria","month":"10","date_updated":"2026-04-09T14:34:43Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","type":"dissertation","status":"public","date_created":"2018-12-11T11:51:50Z","publication_status":"published","_id":"1406","publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"CaHe"}],"oa_version":"None","day":"01","language":[{"iso":"eng"}],"year":"2013","OA_place":"publisher"}]