[{"intvolume":"         2","type":"journal_article","doi":"10.1038/ncomms1231","author":[{"first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"},{"full_name":"Sandoz, Guillaume","last_name":"Sandoz","first_name":"Guillaume"},{"full_name":"Isacoff, Ehud","last_name":"Isacoff","first_name":"Ehud"}],"date_created":"2018-12-11T12:03:09Z","publisher":"Nature Publishing Group","_id":"3405","file":[{"date_updated":"2020-07-14T12:46:12Z","creator":"system","file_name":"IST-2017-832-v1+1_janovjak.pdf","date_created":"2018-12-12T10:11:36Z","relation":"main_file","checksum":"6b68d65aadd97c18d663eb117a0a9d35","file_id":"4891","content_type":"application/pdf","access_level":"open_access","file_size":387654}],"publication_status":"published","abstract":[{"text":"Glutamate is the major excitatory neurotransmitter in the mammalian central nervous system and gates non-selective cation channels. The origins of glutamate receptors are not well understood as they differ structurally and functionally from simple bacterial ligand-gated ion channels. Here we report the discovery of an ionotropic glutamate receptor that combines the typical eukaryotic domain architecture with the 'TXVGYG' signature sequence of the selectivity filter found in K+ channels. This receptor exhibits functional properties intermediate between bacterial and eukaryotic glutamate-gated ion channels, suggesting a link in the evolution of ionotropic glutamate receptors.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:12Z","publist_id":"2997","oa":1,"year":"2011","date_published":"2011-03-08T00:00:00Z","volume":2,"month":"03","has_accepted_license":"1","day":"08","external_id":{"isi":["000289982600022"]},"oa_version":"Submitted Version","article_processing_charge":"No","date_updated":"2025-09-30T08:40:22Z","title":"Modern ionotropic glutamate receptor with a K+ selectivity signature sequence","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","isi":1,"publication":"Nature Communications","citation":{"ama":"Janovjak HL, Sandoz G, Isacoff E. Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. <i>Nature Communications</i>. 2011;2(232):1-6. doi:<a href=\"https://doi.org/10.1038/ncomms1231\">10.1038/ncomms1231</a>","apa":"Janovjak, H. L., Sandoz, G., &#38; Isacoff, E. (2011). Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms1231\">https://doi.org/10.1038/ncomms1231</a>","ieee":"H. L. Janovjak, G. Sandoz, and E. Isacoff, “Modern ionotropic glutamate receptor with a K+ selectivity signature sequence,” <i>Nature Communications</i>, vol. 2, no. 232. Nature Publishing Group, pp. 1–6, 2011.","chicago":"Janovjak, Harald L, Guillaume Sandoz, and Ehud Isacoff. “Modern Ionotropic Glutamate Receptor with a K+ Selectivity Signature Sequence.” <i>Nature Communications</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/ncomms1231\">https://doi.org/10.1038/ncomms1231</a>.","mla":"Janovjak, Harald L., et al. “Modern Ionotropic Glutamate Receptor with a K+ Selectivity Signature Sequence.” <i>Nature Communications</i>, vol. 2, no. 232, Nature Publishing Group, 2011, pp. 1–6, doi:<a href=\"https://doi.org/10.1038/ncomms1231\">10.1038/ncomms1231</a>.","ista":"Janovjak HL, Sandoz G, Isacoff E. 2011. Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. Nature Communications. 2(232), 1–6.","short":"H.L. Janovjak, G. Sandoz, E. Isacoff, Nature Communications 2 (2011) 1–6."},"page":"1 - 6","status":"public","pubrep_id":"832","department":[{"_id":"HaJa"}],"issue":"232","corr_author":"1","ddc":["570","571"]},{"article_processing_charge":"No","date_updated":"2025-09-30T08:39:51Z","acknowledgement":"This work was supported by the Beckman Institute and Biological Imaging Center at the California Institute of Technology and by the NHGRI Center of Excellence in Genomic Science grant P50HG004071.","title":"Oct4 kinetics predict cell lineage patterning in the early mammalian embryo","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","isi":1,"publication":"Nature Cell Biology","citation":{"short":"N. Plachta, M.T. Bollenbach, S. Pease, S. Fraser, P. Pantazis, Nature Cell Biology 13 (2011) 117–123.","chicago":"Plachta, Nicolas, Mark Tobias Bollenbach, Shirley Pease, Scott Fraser, and Periklis Pantazis. “Oct4 Kinetics Predict Cell Lineage Patterning in the Early Mammalian Embryo.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/ncb2154\">https://doi.org/10.1038/ncb2154</a>.","ista":"Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. 2011. Oct4 kinetics predict cell lineage patterning in the early mammalian embryo. Nature Cell Biology. 13(2), 117–123.","mla":"Plachta, Nicolas, et al. “Oct4 Kinetics Predict Cell Lineage Patterning in the Early Mammalian Embryo.” <i>Nature Cell Biology</i>, vol. 13, no. 2, Nature Publishing Group, 2011, pp. 117–23, doi:<a href=\"https://doi.org/10.1038/ncb2154\">10.1038/ncb2154</a>.","apa":"Plachta, N., Bollenbach, M. T., Pease, S., Fraser, S., &#38; Pantazis, P. (2011). Oct4 kinetics predict cell lineage patterning in the early mammalian embryo. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb2154\">https://doi.org/10.1038/ncb2154</a>","ama":"Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. Oct4 kinetics predict cell lineage patterning in the early mammalian embryo. <i>Nature Cell Biology</i>. 2011;13(2):117-123. doi:<a href=\"https://doi.org/10.1038/ncb2154\">10.1038/ncb2154</a>","ieee":"N. Plachta, M. T. Bollenbach, S. Pease, S. Fraser, and P. Pantazis, “Oct4 kinetics predict cell lineage patterning in the early mammalian embryo,” <i>Nature Cell Biology</i>, vol. 13, no. 2. Nature Publishing Group, pp. 117–123, 2011."},"page":"117 - 123","status":"public","department":[{"_id":"ToBo"}],"issue":"2","intvolume":"        13","type":"journal_article","doi":"10.1038/ncb2154","date_created":"2018-12-11T12:03:17Z","author":[{"first_name":"Nicolas","last_name":"Plachta","full_name":"Plachta, Nicolas"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias"},{"first_name":"Shirley","last_name":"Pease","full_name":"Pease, Shirley"},{"full_name":"Fraser, Scott","last_name":"Fraser","first_name":"Scott"},{"full_name":"Pantazis, Periklis","first_name":"Periklis","last_name":"Pantazis"}],"publisher":"Nature Publishing Group","_id":"3429","publication_status":"published","abstract":[{"lang":"eng","text":"Transcription factors are central to sustaining pluripotency, yet little is known about transcription factor dynamics in defining pluripotency in the early mammalian embryo. Here, we establish a fluorescence decay after photoactivation (FDAP) assay to quantitatively study the kinetic behaviour of Oct4, a key transcription factor controlling pre-implantation development in the mouse embryo. FDAP measurements reveal that each cell in a developing embryo shows one of two distinct Oct4 kinetics, before there are any morphologically distinguishable differences or outward signs of lineage patterning. The differences revealed by FDAP are due to differences in the accessibility of Oct4 to its DNA binding sites in the nucleus. Lineage tracing of the cells in the two distinct sub-populations demonstrates that the Oct4 kinetics predict lineages of the early embryo. Cells with slower Oct4 kinetics are more likely to give rise to the pluripotent cell lineage that contributes to the inner cell mass. Those with faster Oct4 kinetics contribute mostly to the extra-embryonic lineage. Our findings identify Oct4 kinetics, rather than differences in total transcription factor expression levels, as a predictive measure of developmental cell lineage patterning in the early mouse embryo."}],"publist_id":"2971","year":"2011","volume":13,"date_published":"2011-01-23T00:00:00Z","month":"01","day":"23","external_id":{"isi":["000286805900004"]},"oa_version":"None"},{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2026-06-18T18:46:10Z","title":"In vitro analysis of chemotactic leukocyte migration in 3D environments","department":[{"_id":"MiSi"}],"ddc":["570"],"corr_author":"1","scopus_import":"1","publication":"Cell Migration","citation":{"apa":"Sixt, M. K., &#38; Lämmermann, T. (2011). In vitro analysis of chemotactic leukocyte migration in 3D environments. <i>Cell Migration</i>. Springer. <a href=\"https://doi.org/10.1007/978-1-61779-207-6_11\">https://doi.org/10.1007/978-1-61779-207-6_11</a>","ama":"Sixt MK, Lämmermann T. In vitro analysis of chemotactic leukocyte migration in 3D environments. <i>Cell Migration</i>. 2011;769:149-165. doi:<a href=\"https://doi.org/10.1007/978-1-61779-207-6_11\">10.1007/978-1-61779-207-6_11</a>","ieee":"M. K. Sixt and T. Lämmermann, “In vitro analysis of chemotactic leukocyte migration in 3D environments,” <i>Cell Migration</i>, vol. 769. Springer, pp. 149–165, 2011.","chicago":"Sixt, Michael K, and Tim Lämmermann. “In Vitro Analysis of Chemotactic Leukocyte Migration in 3D Environments.” <i>Cell Migration</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/978-1-61779-207-6_11\">https://doi.org/10.1007/978-1-61779-207-6_11</a>.","ista":"Sixt MK, Lämmermann T. 2011. In vitro analysis of chemotactic leukocyte migration in 3D environments. Cell Migration. 769, 149–165.","mla":"Sixt, Michael K., and Tim Lämmermann. “In Vitro Analysis of Chemotactic Leukocyte Migration in 3D Environments.” <i>Cell Migration</i>, vol. 769, Springer, 2011, pp. 149–65, doi:<a href=\"https://doi.org/10.1007/978-1-61779-207-6_11\">10.1007/978-1-61779-207-6_11</a>.","short":"M.K. Sixt, T. Lämmermann, Cell Migration 769 (2011) 149–165."},"page":"149 - 165","status":"public","publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://pure.mpg.de/pubman/item/item_3219628_1/component/file_3219630/Sixt%20et%20al..pdf"}],"_id":"3505","intvolume":"       769","type":"journal_article","doi":"10.1007/978-1-61779-207-6_11","author":[{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"},{"full_name":"Lämmermann, Tim","last_name":"Lämmermann","first_name":"Tim"}],"date_created":"2018-12-11T12:03:41Z","month":"05","day":"17","oa_version":"Published Version","article_type":"original","publication_status":"published","abstract":[{"text":"Cell migration on two-dimensional (2D) substrates follows entirely different rules than cell migration in three-dimensional (3D) environments. This is especially relevant for leukocytes that are able to migrate in the absence of adhesion receptors within the confined geometry of artificial 3D extracellular matrix scaffolds and within the interstitial space in vivo. Here, we describe in detail a simple and economical protocol to visualize dendritic cell migration in 3D collagen scaffolds along chemotactic gradients. This method can be adapted to other cell types and may serve as a physiologically relevant paradigm for the directed locomotion of most amoeboid cells.","lang":"eng"}],"publist_id":"2882","year":"2011","oa":1,"volume":769,"date_published":"2011-05-17T00:00:00Z","alternative_title":["Methods in Molecular Biology"]},{"article_processing_charge":"No","date_updated":"2025-09-30T08:39:13Z","title":"Patterns of diversification in two species of short-tailed bats (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","isi":1,"publication":"Biological Journal of the Linnean Society","citation":{"chicago":"Pavan, Ana, Felipe Martins, Fabrício Santos, Albert Ditchfield, and Rodrigo A Fernandes Redondo. “Patterns of Diversification in Two Species of Short-Tailed Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian Rainforests.” <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1095-8312.2010.01601.x\">https://doi.org/10.1111/j.1095-8312.2010.01601.x</a>.","mla":"Pavan, Ana, et al. “Patterns of Diversification in Two Species of Short-Tailed Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian Rainforests.” <i>Biological Journal of the Linnean Society</i>, vol. 102, no. 3, Wiley-Blackwell, 2011, pp. 527–39, doi:<a href=\"https://doi.org/10.1111/j.1095-8312.2010.01601.x\">10.1111/j.1095-8312.2010.01601.x</a>.","ista":"Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. 2011. Patterns of diversification in two species of short-tailed bats (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests. Biological Journal of the Linnean Society. 102(3), 527–539.","short":"A. Pavan, F. Martins, F. Santos, A. Ditchfield, R.A. Fernandes Redondo, Biological Journal of the Linnean Society 102 (2011) 527–539.","apa":"Pavan, A., Martins, F., Santos, F., Ditchfield, A., &#38; Fernandes Redondo, R. A. (2011). Patterns of diversification in two species of short-tailed bats (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests. <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1095-8312.2010.01601.x\">https://doi.org/10.1111/j.1095-8312.2010.01601.x</a>","ama":"Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. Patterns of diversification in two species of short-tailed bats (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests. <i>Biological Journal of the Linnean Society</i>. 2011;102(3):527-539. doi:<a href=\"https://doi.org/10.1111/j.1095-8312.2010.01601.x\">10.1111/j.1095-8312.2010.01601.x</a>","ieee":"A. Pavan, F. Martins, F. Santos, A. Ditchfield, and R. A. Fernandes Redondo, “Patterns of diversification in two species of short-tailed bats (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.,” <i>Biological Journal of the Linnean Society</i>, vol. 102, no. 3. Wiley-Blackwell, pp. 527–539, 2011."},"page":"527 - 539","status":"public","department":[{"_id":"FyKo"}],"issue":"3","corr_author":"1","intvolume":"       102","type":"journal_article","doi":"10.1111/j.1095-8312.2010.01601.x","author":[{"full_name":"Pavan, Ana","first_name":"Ana","last_name":"Pavan"},{"last_name":"Martins","first_name":"Felipe","full_name":"Martins, Felipe"},{"last_name":"Santos","first_name":"Fabrício","full_name":"Santos, Fabrício"},{"full_name":"Ditchfield, Albert","first_name":"Albert","last_name":"Ditchfield"},{"first_name":"Rodrigo A","last_name":"Fernandes Redondo","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","full_name":"Fernandes Redondo, Rodrigo A","orcid":"0000-0002-5837-2793"}],"date_created":"2018-12-11T12:05:05Z","publisher":"Wiley-Blackwell","_id":"3771","publication_status":"published","abstract":[{"lang":"eng","text":"The small-sized frugivorous bat Carollia perspicillata is an understory specialist and occurs in a wide range of lowland habitats, tending to be more common in tropical dry or moist forests of South and Central America. Its sister species, Carollia brevicauda, occurs almost exclusively in the Amazon rainforest. A recent phylogeographic study proposed a hypothesis of origin and subsequent diversification for C. perspicillata along the Atlantic coastal forest of Brazil. Additionally, it also found two allopatric clades for C. brevicauda separated by the Amazon Basin. We used cytochrome b gene sequences and a more extensive sampling to test hypotheses related to the origin and diversification of C. perspicillata plus C. brevicauda clade in South America. The results obtained indicate that there are two sympatric evolutionary lineages within each species. In C. perspicillata, one lineage is limited to the Southern Atlantic Forest, whereas the other is widely distributed. Coalescent analysis points to a simultaneous origin for C. perspicillata and C. brevicauda, although no place for the diversification of each species can be firmly suggested. The phylogeographic pattern shown by C. perspicillata is also congruent with the Pleistocene refugia hypothesis as a likely vicariant phenomenon shaping the present distribution of its intraspecific lineages."}],"publist_id":"2456","year":"2011","volume":102,"date_published":"2011-02-10T00:00:00Z","month":"02","day":"10","external_id":{"isi":["000287193800005"]},"oa_version":"None"},{"doi":"10.1038/hdy.2010.67","author":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:05:07Z","intvolume":"       106","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3183869/"}],"publisher":"Nature Publishing Group","_id":"3778","date_published":"2011-02-01T00:00:00Z","volume":106,"oa":1,"year":"2011","publication_status":"published","publist_id":"2449","day":"01","oa_version":"Submitted Version","external_id":{"pmid":["20502479"],"isi":["000286375300002"]},"month":"02","date_updated":"2025-09-30T08:38:46Z","title":"Estimating linkage disequilibria","article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","isi":1,"scopus_import":"1","citation":{"chicago":"Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/hdy.2010.67\">https://doi.org/10.1038/hdy.2010.67</a>.","ista":"Barton NH. 2011. Estimating linkage disequilibria. Heredity. 106(2), 205–206.","mla":"Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>, vol. 106, no. 2, Nature Publishing Group, 2011, pp. 205–06, doi:<a href=\"https://doi.org/10.1038/hdy.2010.67\">10.1038/hdy.2010.67</a>.","short":"N.H. Barton, Heredity 106 (2011) 205–206.","ama":"Barton NH. Estimating linkage disequilibria. <i>Heredity</i>. 2011;106(2):205-206. doi:<a href=\"https://doi.org/10.1038/hdy.2010.67\">10.1038/hdy.2010.67</a>","apa":"Barton, N. H. (2011). Estimating linkage disequilibria. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2010.67\">https://doi.org/10.1038/hdy.2010.67</a>","ieee":"N. H. Barton, “Estimating linkage disequilibria,” <i>Heredity</i>, vol. 106, no. 2. Nature Publishing Group, pp. 205–206, 2011."},"page":"205 - 206","publication":"Heredity","corr_author":"1","issue":"2","pmid":1,"department":[{"_id":"NiBa"}]},{"doi":"10.1017/S0025315410000287","date_created":"2018-12-11T12:05:09Z","author":[{"first_name":"Ferran","last_name":"Palero","id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","full_name":"Palero, Ferran","orcid":"0000-0002-0343-8329"},{"full_name":"Guerao, Guillermo","first_name":"Guillermo","last_name":"Guerao"},{"full_name":"Clark, Paul","last_name":"Clark","first_name":"Paul"},{"full_name":"Abello, Pere","first_name":"Pere","last_name":"Abello"}],"intvolume":"        91","type":"journal_article","publisher":"Cambridge University Press","main_file_link":[{"open_access":"1","url":"https://digital.csic.es/bitstream/10261/32783/3/Palero_et_al_2011.pdf"}],"_id":"3784","oa":1,"year":"2011","volume":91,"date_published":"2011-03-01T00:00:00Z","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"Advanced stages of Scyllarus phyllosoma larvae were collected by demersal trawling during fishery research surveys in the western Mediterranean Sea in 2003–2005. Nucleotide sequence analysis of the mitochondrial 16S rDNA gene allowed the final-stage phyllosoma of Scyllarus arctus to be identified among these larvae. Its morphology is described and illustrated. This constitutes the second complete description of a Scyllaridae phyllosoma with its specific identity being validated by molecular techniques (the first was S. pygmaeus). These results also solved a long lasting taxonomic anomaly of several species assigned to the ancient genus Phyllosoma Leach, 1814. Detailed examination indicated that the final-stage phyllosoma of S. arctus shows closer affinities with the American scyllarid Scyllarus depressus or with the Australian Scyllarus sp. b (sensu Phillips et al., 1981) than to its sympatric species S. pygmaeus."}],"publist_id":"2443","day":"01","external_id":{"isi":["000287940400022"]},"oa_version":"Published Version","month":"03","date_updated":"2026-06-18T18:46:40Z","title":"Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","isi":1,"publication":"Journal of the Marine Biological Association of the United Kingdom","page":"485 - 492","citation":{"chicago":"Palero, Ferran, Guillermo Guerao, Paul Clark, and Pere Abello. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.” <i>Journal of the Marine Biological Association of the United Kingdom</i>. Cambridge University Press, 2011. <a href=\"https://doi.org/10.1017/S0025315410000287\">https://doi.org/10.1017/S0025315410000287</a>.","mla":"Palero, Ferran, et al. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.” <i>Journal of the Marine Biological Association of the United Kingdom</i>, vol. 91, no. 2, Cambridge University Press, 2011, pp. 485–92, doi:<a href=\"https://doi.org/10.1017/S0025315410000287\">10.1017/S0025315410000287</a>.","ista":"Palero F, Guerao G, Clark P, Abello P. 2011. Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. Journal of the Marine Biological Association of the United Kingdom. 91(2), 485–492.","short":"F. Palero, G. Guerao, P. Clark, P. Abello, Journal of the Marine Biological Association of the United Kingdom 91 (2011) 485–492.","ama":"Palero F, Guerao G, Clark P, Abello P. Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. <i>Journal of the Marine Biological Association of the United Kingdom</i>. 2011;91(2):485-492. doi:<a href=\"https://doi.org/10.1017/S0025315410000287\">10.1017/S0025315410000287</a>","apa":"Palero, F., Guerao, G., Clark, P., &#38; Abello, P. (2011). Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. <i>Journal of the Marine Biological Association of the United Kingdom</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0025315410000287\">https://doi.org/10.1017/S0025315410000287</a>","ieee":"F. Palero, G. Guerao, P. Clark, and P. Abello, “Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description,” <i>Journal of the Marine Biological Association of the United Kingdom</i>, vol. 91, no. 2. Cambridge University Press, pp. 485–492, 2011."},"issue":"2","corr_author":"1","ddc":["570"],"department":[{"_id":"NiBa"}]},{"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2025-09-30T08:37:44Z","title":"Cell sorting in development","department":[{"_id":"CaHe"}],"corr_author":"1","scopus_import":"1","isi":1,"publication":"Forces and Tension in Development","page":"189 - 213","citation":{"short":"G. Krens, C.-P.J. Heisenberg, in:, M. Labouesse (Ed.), Forces and Tension in Development, Elsevier, 2011, pp. 189–213.","chicago":"Krens, Gabriel, and Carl-Philipp J Heisenberg. “Cell Sorting in Development.” In <i>Forces and Tension in Development</i>, edited by Michel Labouesse, 95:189–213. Elsevier, 2011. <a href=\"https://doi.org/10.1016/B978-0-12-385065-2.00006-2\">https://doi.org/10.1016/B978-0-12-385065-2.00006-2</a>.","mla":"Krens, Gabriel, and Carl-Philipp J. Heisenberg. “Cell Sorting in Development.” <i>Forces and Tension in Development</i>, edited by Michel Labouesse, vol. 95, Elsevier, 2011, pp. 189–213, doi:<a href=\"https://doi.org/10.1016/B978-0-12-385065-2.00006-2\">10.1016/B978-0-12-385065-2.00006-2</a>.","ista":"Krens G, Heisenberg C-PJ. 2011.Cell sorting in development. In: Forces and Tension in Development. Current Topics in Developmental Biology, vol. 95, 189–213.","ama":"Krens G, Heisenberg C-PJ. Cell sorting in development. In: Labouesse M, ed. <i>Forces and Tension in Development</i>. Vol 95. Elsevier; 2011:189-213. doi:<a href=\"https://doi.org/10.1016/B978-0-12-385065-2.00006-2\">10.1016/B978-0-12-385065-2.00006-2</a>","apa":"Krens, G., &#38; Heisenberg, C.-P. J. (2011). Cell sorting in development. In M. Labouesse (Ed.), <i>Forces and Tension in Development</i> (Vol. 95, pp. 189–213). Elsevier. <a href=\"https://doi.org/10.1016/B978-0-12-385065-2.00006-2\">https://doi.org/10.1016/B978-0-12-385065-2.00006-2</a>","ieee":"G. Krens and C.-P. J. Heisenberg, “Cell sorting in development,” in <i>Forces and Tension in Development</i>, vol. 95, M. Labouesse, Ed. Elsevier, 2011, pp. 189–213."},"status":"public","publisher":"Elsevier","_id":"3791","type":"book_chapter","intvolume":"        95","doi":"10.1016/B978-0-12-385065-2.00006-2","date_created":"2018-12-11T12:05:11Z","author":[{"first_name":"Gabriel","last_name":"Krens","id":"2B819732-F248-11E8-B48F-1D18A9856A87","full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"editor":[{"last_name":"Labouesse","first_name":"Michel","full_name":"Labouesse, Michel"}],"month":"01","day":"01","external_id":{"isi":["000290454200007"]},"oa_version":"None","publication_status":"published","abstract":[{"text":"During the development of multicellular organisms, cell fate specification is followed by the sorting of different cell types into distinct domains from where the different tissues and organs are formed. Cell sorting involves both the segregation of a mixed population of cells with different fates and properties into distinct domains, and the active maintenance of their segregated state. Because of its biological importance and apparent resemblance to fluid segregation in physics, cell sorting was extensively studied by both biologists and physicists over the last decades. Different theories were developed that try to explain cell sorting on the basis of the physical properties of the constituent cells. However, only recently the molecular and cellular mechanisms that control the physical properties driving cell sorting, have begun to be unraveled. In this review, we will provide an overview of different cell-sorting processes in development and discuss how these processes can be explained by the different sorting theories, and how these theories in turn can be connected to the molecular and cellular mechanisms driving these processes.","lang":"eng"}],"publist_id":"2436","year":"2011","date_published":"2011-01-01T00:00:00Z","volume":95,"alternative_title":["Current Topics in Developmental Biology"]},{"corr_author":"1","ddc":["000"],"department":[{"_id":"HeEd"}],"status":"public","pubrep_id":"539","scopus_import":"1","publication":"Rainbow of Computer Science","citation":{"short":"H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.), Rainbow of Computer Science, Springer, 2011, pp. 20–35.","ista":"Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” <i>Rainbow of Computer Science</i>, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">10.1007/978-3-642-19391-0_2</a>.","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” In <i>Rainbow of Computer Science</i>, edited by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">https://doi.org/10.1007/978-3-642-19391-0_2</a>.","ieee":"H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in <i>Rainbow of Computer Science</i>, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &#38; A. Salomaa (Eds.), <i>Rainbow of Computer Science</i> (Vol. 6570, pp. 20–35). Springer. <a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">https://doi.org/10.1007/978-3-642-19391-0_2</a>","ama":"Edelsbrunner H, Kerber M. Covering and packing with spheres by diagonal distortion in R^n. In: Calude C, Rozenberg G, Salomaa A, eds. <i>Rainbow of Computer Science</i>. Vol 6570. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer; 2011:20-35. doi:<a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">10.1007/978-3-642-19391-0_2</a>"},"page":"20 - 35","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T06:03:02Z","title":"Covering and packing with spheres by diagonal distortion in R^n","day":"03","oa_version":"Submitted Version","month":"05","has_accepted_license":"1","series_title":"Dedicated to Hermann Maurer on the Occasion of His 70th Birthday","year":"2011","oa":1,"date_published":"2011-05-03T00:00:00Z","volume":6570,"alternative_title":["LNCS"],"publication_status":"published","abstract":[{"lang":"eng","text":"We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest lattice coverings in dimensions 2 to 5. We also consider the problem of packing congruent balls in ℝ n , for which we give a closed formula for the packing density as well. Again we observe that our family contains optimal configurations, this time densest packings in dimensions 2 and 3."}],"file_date_updated":"2020-07-14T12:46:16Z","publist_id":"2427","file":[{"date_updated":"2020-07-14T12:46:16Z","file_name":"IST-2016-539-v1+1_2011-B-01-CoveringPacking.pdf","date_created":"2018-12-12T10:07:42Z","creator":"system","checksum":"aaf22b4d7bd4277ffe8db532119cf474","relation":"main_file","file_id":"4640","content_type":"application/pdf","access_level":"open_access","file_size":436875}],"publisher":"Springer","_id":"3796","doi":"10.1007/978-3-642-19391-0_2","editor":[{"full_name":"Calude, Cristian","first_name":"Cristian","last_name":"Calude"},{"first_name":"Grzegorz","last_name":"Rozenberg","full_name":"Rozenberg, Grzegorz"},{"full_name":"Salomaa, Arto","first_name":"Arto","last_name":"Salomaa"}],"date_created":"2018-12-11T12:05:13Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","first_name":"Michael"}],"type":"book_chapter","intvolume":"      6570"},{"_id":"3965","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"journal_article","intvolume":"        16","title":"Computing elevation maxima by searching the Gauss sphere","date_created":"2018-12-11T12:06:09Z","author":[{"full_name":"Wang, Bei","last_name":"Wang","first_name":"Bei"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Morozov, Dmitriy","first_name":"Dmitriy","last_name":"Morozov"}],"date_updated":"2021-01-12T07:53:31Z","doi":"10.1145/1963190.1970375","department":[{"_id":"HeEd"}],"month":"05","oa_version":"None","day":"01","issue":"2.2","publist_id":"2161","page":"1 - 13","citation":{"ista":"Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.","mla":"Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.” <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:<a href=\"https://doi.org/10.1145/1963190.1970375\">10.1145/1963190.1970375</a>.","chicago":"Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation Maxima by Searching the Gauss Sphere.” <i>Journal of Experimental Algorithmics</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1963190.1970375\">https://doi.org/10.1145/1963190.1970375</a>.","short":"B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics 16 (2011) 1–13.","ieee":"B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2. ACM, pp. 1–13, 2011.","apa":"Wang, B., Edelsbrunner, H., &#38; Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. ACM. <a href=\"https://doi.org/10.1145/1963190.1970375\">https://doi.org/10.1145/1963190.1970375</a>","ama":"Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. 2011;16(2.2):1-13. doi:<a href=\"https://doi.org/10.1145/1963190.1970375\">10.1145/1963190.1970375</a>"},"publication":"Journal of Experimental Algorithmics","abstract":[{"lang":"eng","text":"The elevation function on a smoothly embedded 2-manifold in R-3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in identifying coarse docking configurations for protein pairs. Transporting the concept from the smooth to the piecewise linear category, this paper describes an algorithm for finding all local maxima. While its worst-case running time is the same as of the algorithm used in prior work, its performance in practice is orders of magnitudes superior. We cast light on this improvement by relating the running time to the total absolute Gaussian curvature of the 2-manifold."}],"scopus_import":1,"publication_status":"published","date_published":"2011-05-01T00:00:00Z","volume":16,"status":"public","year":"2011"},{"type":"journal_article","intvolume":"         7","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"date_created":"2018-12-11T12:02:37Z","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"}],"doi":"10.2168/LMCS-7(4:8)2011","_id":"3315","publisher":"International Federation for Computational Logic","file":[{"relation":"main_file","checksum":"3480e1594bbef25ff7462fa93a8a814e","file_id":"5231","content_type":"application/pdf","access_level":"open_access","file_size":588863,"date_updated":"2020-07-14T12:46:07Z","creator":"system","date_created":"2018-12-12T10:16:42Z","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf"}],"related_material":{"record":[{"id":"3876","status":"public","relation":"earlier_version"}]},"publist_id":"3324","file_date_updated":"2020-07-14T12:46:07Z","abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"publication_status":"published","volume":7,"date_published":"2011-12-14T00:00:00Z","year":"2011","oa":1,"has_accepted_license":"1","month":"12","oa_version":"Published Version","ec_funded":1,"day":"14","article_processing_charge":"No","title":"Timed parity games: Complexity and robustness","date_updated":"2026-07-06T13:25:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation for Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation for Computational Logic, 2011."},"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"publication":"Logical Methods in Computer Science","scopus_import":"1","das_tickbox":"1","pubrep_id":"506","status":"public","license":"https://creativecommons.org/licenses/by-nd/4.0/","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"corr_author":"1","ddc":["000","005"],"issue":"4"},{"author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"72A86902-E99F-11E9-9F62-915534D1B916","full_name":"Singh, Anmol","first_name":"Anmol","last_name":"Singh"},{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"date_created":"2018-12-11T12:02:33Z","type":"conference","file":[{"content_type":"application/pdf","file_size":232770,"access_level":"open_access","relation":"main_file","checksum":"21a461ac004bb535c83320fe79b30375","file_id":"5333","date_updated":"2020-07-14T12:46:06Z","creator":"system","file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","date_created":"2018-12-12T10:18:14Z"}],"publisher":"Usenix Association","_id":"3302","date_published":"2011-06-14T00:00:00Z","year":"2011","oa":1,"abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"publication_status":"published","publist_id":"3338","file_date_updated":"2020-07-14T12:46:06Z","day":"14","oa_version":"Submitted Version","has_accepted_license":"1","month":"06","date_updated":"2026-07-07T06:07:16Z","title":"Static scheduling in clouds","article_processing_charge":"No","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","location":"Portland, OR, United States","end_date":"2011-06-15","start_date":"2011-06-14"},"pubrep_id":"90","status":"public","das_tickbox":"1","citation":{"short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.","mla":"Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Usenix Association, 2011, pp. 1–6.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds.” In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, 1–6. Usenix Association, 2011.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” in <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Portland, OR, United States, 2011, pp. 1–6.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>. Usenix Association; 2011:1-6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Static scheduling in clouds. In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i> (pp. 1–6). Portland, OR, United States: Usenix Association."},"page":"1 - 6","publication":"3rd USENIX Workshop on Hot Topics in Cloud Computing","ddc":["000","005"],"corr_author":"1","department":[{"_id":"ToHe"}]},{"title":"Temporal specifications with accumulative values","date_updated":"2026-07-07T14:01:43Z","article_processing_charge":"No","article_number":"5970226","conference":{"start_date":"2011-06-21","name":"LICS: Logic in Computer Science","location":"Toronto, Canada","end_date":"2011-06-24"},"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","pubrep_id":"83","citation":{"mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>"},"isi":1,"scopus_import":"1","ddc":["000","004"],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"date_created":"2018-12-11T12:02:52Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1109/LICS.2011.33","type":"conference","file":[{"date_updated":"2020-07-14T12:46:09Z","creator":"system","date_created":"2018-12-12T10:12:42Z","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","relation":"main_file","checksum":"792128f5455f0f40f1105f0398e05fa9","file_id":"4960","content_type":"application/pdf","file_size":225426,"access_level":"open_access"}],"_id":"3356","publisher":"IEEE","date_published":"2011-06-21T00:00:00Z","year":"2011","oa":1,"publist_id":"3259","related_material":{"record":[{"status":"public","id":"5385","relation":"earlier_version"},{"id":"2038","status":"public","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:46:09Z","abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"publication_status":"published","oa_version":"Submitted Version","ec_funded":1,"external_id":{"isi":["000297350400007"]},"day":"21","has_accepted_license":"1","month":"06"},{"date_updated":"2026-07-07T14:01:43Z","publication_identifier":{"issn":["2664-1690"]},"title":"Temporal specifications with accumulative values","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"14","citation":{"chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011."},"pubrep_id":"21","status":"public","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ddc":["000","004"],"type":"technical_report","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT:IST-2011-0003","author":[{"last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"date_created":"2018-12-12T11:39:02Z","publisher":"IST Austria","_id":"5385","file":[{"file_name":"IST-2011-0003_IST-2011-0003.pdf","date_created":"2018-12-12T11:53:00Z","creator":"system","date_updated":"2020-07-14T12:46:41Z","access_level":"open_access","file_size":366281,"content_type":"application/pdf","file_id":"5461","relation":"main_file","checksum":"8491d0d48c4911620ecd5350b413c11e"}],"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"publication_status":"published","related_material":{"record":[{"status":"public","id":"3356","relation":"later_version"},{"id":"2038","status":"public","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:46:41Z","date_published":"2011-04-04T00:00:00Z","year":"2011","oa":1,"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","month":"04","day":"04","oa_version":"Published Version","ec_funded":1},{"publisher":"IST Austria","_id":"5381","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"file":[{"checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","relation":"main_file","file_id":"5488","content_type":"application/pdf","access_level":"open_access","file_size":574055,"date_updated":"2020-07-14T12:46:39Z","creator":"system","date_created":"2018-12-12T11:53:27Z","file_name":"IST-2011-0007_IST-2011-0007.pdf"}],"type":"technical_report","doi":"10.15479/AT:IST-2011-0007","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2026-07-07T14:01:25Z","date_created":"2018-12-12T11:39:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"title":"Partial-observation stochastic games: How to win when belief fails","month":"07","has_accepted_license":"1","department":[{"_id":"KrCh"}],"day":"05","ddc":["000","005"],"oa_version":"Published Version","publication_status":"published","abstract":[{"text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:39Z","page":"43","related_material":{"record":[{"id":"1903","status":"public","relation":"later_version"},{"relation":"later_version","id":"2955","status":"public"},{"status":"public","id":"2211","relation":"later_version"}]},"citation":{"ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011."},"oa":1,"year":"2011","status":"public","pubrep_id":"17","date_published":"2011-07-05T00:00:00Z","alternative_title":["IST Austria Technical Report"]},{"day":"01","oa_version":"Submitted Version","external_id":{"isi":["000292766400003"]},"ec_funded":1,"has_accepted_license":"1","month":"07","date_published":"2011-07-01T00:00:00Z","volume":33,"oa":1,"year":"2011","abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"publication_status":"published","publist_id":"3263","file_date_updated":"2020-07-14T12:46:09Z","file":[{"file_size":775662,"access_level":"open_access","content_type":"application/pdf","file_id":"5235","relation":"main_file","checksum":"5d44a8aa81e33210649beae507602138","creator":"system","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","date_created":"2018-12-12T10:16:45Z","date_updated":"2020-07-14T12:46:09Z"}],"publisher":"ACM","_id":"3353","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"doi":"10.1145/1985342.1985345","author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"first_name":"Ben","last_name":"Lickly","full_name":"Lickly, Ben"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Edward","last_name":"Lee","full_name":"Lee, Edward"}],"date_created":"2018-12-11T12:02:51Z","intvolume":"        33","type":"journal_article","ddc":["000","005"],"issue":"4","department":[{"_id":"ToHe"}],"pubrep_id":"85","status":"public","das_tickbox":"1","isi":1,"scopus_import":"1","citation":{"apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4. ACM, 2011.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems 33 (2011)."},"publication":"ACM Transactions on Programming Languages and Systems","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-07T14:03:34Z","title":"A theory of synchronous relational interfaces","article_number":"14","article_processing_charge":"No"},{"external_id":{"isi":["000296202300006"]},"oa_version":"None","day":"04","month":"07","year":"2011","date_published":"2011-07-04T00:00:00Z","volume":12,"publist_id":"3262","related_material":{"record":[{"id":"2054","status":"public","relation":"later_version"}]},"publication_status":"published","abstract":[{"lang":"eng","text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory."}],"_id":"3354","publisher":"ACM","date_created":"2018-12-11T12:02:51Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"doi":"10.1145/1970398.1970404","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"intvolume":"        12","type":"journal_article","issue":"4","corr_author":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"das_tickbox":"1","status":"public","publication":"ACM Transactions on Computational Logic","citation":{"ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4. ACM, 2011.","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic 12 (2011).","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 12(4), 28.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>."},"scopus_import":"1","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Qualitative concurrent parity games","date_updated":"2026-07-07T14:02:38Z","article_processing_charge":"No","article_number":"28"},{"_id":"3396","publisher":"Company of Biologists","file":[{"creator":"dernst","file_name":"2011_Development_Stockinger.pdf","date_created":"2019-10-07T14:19:42Z","date_updated":"2020-07-14T12:46:12Z","access_level":"open_access","file_size":4672439,"content_type":"application/pdf","file_id":"6930","checksum":"ca12b79e01ef36c1ef1aea31cf7e7139","relation":"main_file"}],"type":"journal_article","intvolume":"       138","date_created":"2018-12-11T12:03:06Z","author":[{"id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra","first_name":"Petra","last_name":"Stockinger"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","last_name":"Maître","first_name":"Jean-Léon"}],"doi":"10.1242/dev.071233","month":"11","has_accepted_license":"1","external_id":{"isi":["000296060100011"]},"oa_version":"Published Version","day":"01","file_date_updated":"2020-07-14T12:46:12Z","publist_id":"3210","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"publication_status":"published","article_type":"original","abstract":[{"text":"Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain undergo a characteristic tangential migration from rhombomere (r) 4, where they are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium such that they move apically between NCs towards the midline of the neuroepithelium instead of tangentially along the basal side of the neuroepithelium towards r6/7. However, direct experimental evaluation of this hypothesis is still lacking. Here, we have used a combination of biophysical cell adhesion measurements and high-resolution time-lapse microscopy to determine the role of NC cohesion in FBMN migration. We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity results in FBMNs positioned at the basal side of the neuroepithelium moving apically towards the neural tube midline instead of tangentially towards r6/7. In embryos with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results in fusion of the bilateral FBMN clusters over the apical midline of the neural tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin 2 (Cntn2) expression in these cells has little effect on apical FBMN movement, but reduces the fusion of the bilateral FBMN clusters in embryos with strongly diminished NC cohesion. These data provide direct experimental evidence that NC cohesion functions in tangential FBMN migration by restricting their apical movement.","lang":"eng"}],"year":"2011","oa":1,"date_published":"2011-11-01T00:00:00Z","volume":138,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","article_processing_charge":"No","title":"Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube","date_updated":"2026-07-28T08:23:30Z","acknowledgement":"We thank C. Moens and J. Geiger for critical reading of earlier versions of this manuscript and members of the Heisenberg laboratory for discussions. We are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting; and the fish facility of the MPI-CBG and IST Austria for excellent fish care.","department":[{"_id":"CaHe"}],"issue":"21","corr_author":"1","ddc":["570"],"publication":"Development","page":"4673 - 4683","citation":{"ieee":"P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011.","apa":"Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>","ama":"Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. 2011;138(21):4673-4683. doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>","ista":"Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. Development. 138(21), 4673–4683.","mla":"Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>, vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>.","chicago":"Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>.","short":"P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683."},"scopus_import":"1","isi":1,"keyword":["Epithelial cohesion","Hindbrain","Neuronal migration","Zebrafish"],"status":"public"},{"das_tickbox":"1","status":"public","publication":"Developmental Biology","citation":{"short":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman, Developmental Biology 354 (2011) 102–110.","chicago":"Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>.","ista":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. Developmental Biology. 354(1), 102–110.","mla":"Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>, vol. 354, no. 1, Elsevier, 2011, pp. 102–10, doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>.","apa":"Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &#38; Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>","ama":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. 2011;354(1):102-110. doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>","ieee":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D. Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail,” <i>Developmental Biology</i>, vol. 354, no. 1. Elsevier, pp. 102–110, 2011."},"page":"102 - 110","scopus_import":"1","isi":1,"issue":"1","pmid":1,"department":[{"_id":"CaHe"}],"title":"Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail","acknowledgement":"We thank David Grunwald for providing the spadetail-myc fusion construct. This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R. was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183, from the National Institute of Child Health and Human Development. B.L.M. was supported by an American Cancer Society fellowship (PF-07-048-01-DDC).","date_updated":"2026-07-28T08:31:27Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","OA_type":"green","oa":1,"year":"2011","volume":354,"date_published":"2011-06-01T00:00:00Z","publist_id":"3228","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"The process of gastrulation is highly conserved across vertebrates on both the genetic and morphological levels, despite great variety in embryonic shape and speed of development. This mechanism spatially separates the germ layers and establishes the organizational foundation for future development. Mesodermal identity is specified in a superficial layer of cells, the epiblast, where cells maintain an epithelioid morphology. These cells involute to join the deeper hypoblast layer where they adopt a migratory, mesenchymal morphology. Expression of a cascade of related transcription factors orchestrates the parallel genetic transition from primitive to mature mesoderm. Although the early and late stages of this process are increasingly well understood, the transition between them has remained largely mysterious. We present here the first high resolution in vivo observations of the blebby transitional morphology of involuting mesodermal cells in a vertebrate embryo. We further demonstrate that the zebrafish spadetail mutation creates a reversible block in the maturation program, stalling cells in the transition state. This mutation creates an ideal system for dissecting the specific properties of cells undergoing the morphological transition of maturing mesoderm, as we demonstrate with a direct measurement of cell–cell adhesion."}],"external_id":{"isi":["000290550500010"],"pmid":["21463614"]},"oa_version":"Submitted Version","OA_place":"repository","day":"01","month":"06","date_created":"2018-12-11T12:03:00Z","author":[{"full_name":"Row, Richard","first_name":"Richard","last_name":"Row"},{"last_name":"Maître","first_name":"Jean-Léon","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Martin, Benjamin","first_name":"Benjamin","last_name":"Martin"},{"id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra","last_name":"Stockinger","first_name":"Petra"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kimelman","first_name":"David","full_name":"Kimelman, David"}],"doi":"10.1016/j.ydbio.2011.03.025","intvolume":"       354","type":"journal_article","_id":"3379","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/"}],"publisher":"Elsevier"},{"das_tickbox":"1","status":"public","page":"359 - 367","citation":{"chicago":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>.","mla":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67, doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>.","ista":"Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum Mathematicarum. 77(1–2), 359–367.","short":"B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367.","ama":"Fasy BT. The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. 2011;77(1-2):359-367. doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>","apa":"Fasy, B. T. (2011). The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. Springer Nature. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>","ieee":"B. T. Fasy, “The difference in length of curves in R^n,” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011."},"publication":"Acta Scientiarum Mathematicarum","corr_author":"1","issue":"1-2","department":[{"_id":"HeEd"}],"title":"The difference in length of curves in R^n","acknowledgement":"Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship. The author would like to thank Herbert Edelsbrunner for his discussions and guidance.","date_updated":"2026-07-28T08:11:07Z","publication_identifier":{"eissn":["2064-8316"],"issn":["0001-6969"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","OA_type":"closed access","date_published":"2011-06-01T00:00:00Z","volume":77,"year":"2011","publist_id":"2446","abstract":[{"lang":"eng","text":"We bound the difference in length of two curves in terms of their total curvatures and the Fréchet distance. The bound is independent of the dimension of the ambient Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and it generalizes a result by Fáry and Chakerian."}],"article_type":"original","publication_status":"published","oa_version":"None","day":"01","month":"06","date_created":"2018-12-11T12:05:08Z","author":[{"last_name":"Fasy","first_name":"Brittany Terese","full_name":"Fasy, Brittany Terese","id":"F65D502E-E68D-11E9-9252-C644099818F6"}],"doi":"10.1007/BF03651375","type":"journal_article","intvolume":"        77","_id":"3781","publisher":"Springer Nature"},{"month":"07","day":"01","OA_place":"publisher","oa_version":"Published Version","publication_status":"published","publist_id":"3224","date_published":"2011-07-01T00:00:00Z","volume":278,"oa":1,"year":"2011","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1111/j.1742-4658.2011.08136.x","open_access":"1"}],"_id":"3383","type":"conference_abstract","intvolume":"       278","doi":"10.1111/j.1742-4658.2011.08136.x","author":[{"first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"date_created":"2018-12-11T12:03:01Z","department":[{"_id":"CaHe"}],"corr_author":"1","issue":"S1","page":"24 - 24","citation":{"ama":"Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: <i>The FEBS Journal</i>. Vol 278. Wiley; 2011:24-24. doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>","apa":"Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In <i>The FEBS Journal</i> (Vol. 278, pp. 24–24). Torino, Italy: Wiley. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>","ieee":"C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in <i>The FEBS Journal</i>, Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24.","short":"C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.","chicago":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In <i>The FEBS Journal</i>, 278:24–24. Wiley, 2011. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>.","ista":"Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal. FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.","mla":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” <i>The FEBS Journal</i>, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>."},"publication":"The FEBS Journal","status":"public","OA_type":"free access","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2011-06-30","location":"Torino, Italy","name":"FEBS Congress on Biochemistry for Tomorrow's Medicine","start_date":"2011-06-25"},"language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2026-07-28T08:27:55Z","title":"Invited Lectures ‐ Symposia Area"}]