[{"date_created":"2018-12-11T11:56:35Z","date_updated":"2022-08-25T14:45:42Z","oa_version":"None","volume":105,"author":[{"last_name":"Phadke","first_name":"Sujal","full_name":"Phadke, Sujal"},{"first_name":"Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago"},{"last_name":"Pham","first_name":"Tuan","full_name":"Pham, Tuan"},{"last_name":"Pham","first_name":"Stephanie","full_name":"Pham, Stephanie"},{"full_name":"Zufall, Rebecca","last_name":"Zufall","first_name":"Rebecca"}],"title":"Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila","publication_status":"published","status":"public","department":[{"_id":"NiBa"}],"intvolume":" 105","publisher":"Oxford University Press","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2252","year":"2014","abstract":[{"lang":"eng","text":"The pattern of inheritance and mechanism of sex determination can have important evolutionary consequences. We studied probabilistic sex determination in the ciliate Tetrahymena thermophila, which was previously shown to cause evolution of skewed sex ratios. We find that the genetic background alters the sex determination patterns of mat alleles in heterozygotes and that allelic interaction can differentially influence the expression probability of the 7 sexes. We quantify the dominance relationships between several mat alleles and find that A-type alleles, which specify sex I, are indeed recessive to B-type alleles, which are unable to specify that sex. Our results provide additional support for the presence of modifier loci and raise implications for the dynamics of sex ratios in populations of T. thermophila."}],"publist_id":"4695","issue":"1","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2014-01-01T00:00:00Z","doi":"10.1093/jhered/est063","quality_controlled":"1","page":"130 - 135","publication":"Journal of Heredity","citation":{"ama":"Phadke S, Paixao T, Pham T, Pham S, Zufall R. Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. Journal of Heredity. 2014;105(1):130-135. doi:10.1093/jhered/est063","ieee":"S. Phadke, T. Paixao, T. Pham, S. Pham, and R. Zufall, “Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila,” Journal of Heredity, vol. 105, no. 1. Oxford University Press, pp. 130–135, 2014.","apa":"Phadke, S., Paixao, T., Pham, T., Pham, S., & Zufall, R. (2014). Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. Journal of Heredity. Oxford University Press. https://doi.org/10.1093/jhered/est063","ista":"Phadke S, Paixao T, Pham T, Pham S, Zufall R. 2014. Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. Journal of Heredity. 105(1), 130–135.","short":"S. Phadke, T. Paixao, T. Pham, S. Pham, R. Zufall, Journal of Heredity 105 (2014) 130–135.","mla":"Phadke, Sujal, et al. “Genetic Background Alters Dominance Relationships between Mat Alleles in the Ciliate Tetrahymena Thermophila.” Journal of Heredity, vol. 105, no. 1, Oxford University Press, 2014, pp. 130–35, doi:10.1093/jhered/est063.","chicago":"Phadke, Sujal, Tiago Paixao, Tuan Pham, Stephanie Pham, and Rebecca Zufall. “Genetic Background Alters Dominance Relationships between Mat Alleles in the Ciliate Tetrahymena Thermophila.” Journal of Heredity. Oxford University Press, 2014. https://doi.org/10.1093/jhered/est063."},"month":"01","day":"01","article_processing_charge":"No","publication_identifier":{"issn":["00221503"]},"scopus_import":"1"},{"quality_controlled":"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"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1093/nar/gkt1290","month":"03","department":[{"_id":"SiHi"}],"publisher":"Oxford University Press","publication_status":"published","year":"2014","acknowledgement":"California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]. Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]\r\nCC BY 3,0","volume":42,"date_created":"2018-12-11T11:56:38Z","date_updated":"2021-01-12T06:56:22Z","author":[{"full_name":"Zhu, Fangfang","last_name":"Zhu","first_name":"Fangfang"},{"last_name":"Gamboa","first_name":"Matthew","full_name":"Gamboa, Matthew"},{"full_name":"Farruggio, Alfonso","last_name":"Farruggio","first_name":"Alfonso"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon"},{"last_name":"Tasic","first_name":"Bosiljka","full_name":"Tasic, Bosiljka"},{"first_name":"Birgitt","last_name":"Schüle","full_name":"Schüle, Birgitt"},{"last_name":"Chen Tsai","first_name":"Yanru","full_name":"Chen Tsai, Yanru"},{"first_name":"Michele","last_name":"Calos","full_name":"Calos, Michele"}],"article_number":"e34","publist_id":"4684","file_date_updated":"2020-07-14T12:45:35Z","citation":{"ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 2014;42(5). doi:10.1093/nar/gkt1290","ista":"Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 42(5), e34.","apa":"Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B., … Calos, M. (2014). DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkt1290","ieee":"F. Zhu et al., “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no. 5. Oxford University Press, 2014.","mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290.","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","chicago":"Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290."},"publication":"Nucleic Acids Research","date_published":"2014-03-05T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"05","intvolume":" 42","title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","ddc":["571","610"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2261","oa_version":"Preprint","file":[{"file_id":"4738","relation":"main_file","date_updated":"2020-07-14T12:45:35Z","date_created":"2018-12-12T10:09:15Z","checksum":"e9268f5f96a820f04d7ebbf85927c3cb","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":11044478}],"pubrep_id":"961","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus."}]},{"page":"1 - 24","quality_controlled":"1","citation":{"ama":"Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1","ieee":"S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in Cellular and Molecular Control of Neuronal Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.","apa":"Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1","ista":"Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.","short":"S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24.","mla":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.","chicago":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014. https://doi.org/10.1007/978-94-007-7687-6_1."},"publication":" Cellular and Molecular Control of Neuronal Migration","language":[{"iso":"eng"}],"doi":"10.1007/978-94-007-7687-6_1","date_published":"2014-01-01T00:00:00Z","scopus_import":1,"month":"01","day":"01","publisher":"Springer","intvolume":" 800","department":[{"_id":"SiHi"}],"editor":[{"full_name":"Nguyen, Laurent","first_name":"Laurent","last_name":"Nguyen"}],"title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","publication_status":"published","status":"public","_id":"2265","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2014","oa_version":"None","volume":800,"date_created":"2018-12-11T11:56:39Z","date_updated":"2021-01-12T06:56:23Z","author":[{"first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"}],"alternative_title":["Advances in Experimental Medicine and Biology"],"type":"book_chapter","publist_id":"4679","abstract":[{"text":"Coordinated migration of newly-born neurons to their target territories is essential for correct neuronal circuit assembly in the developing brain. Although a cohort of signaling pathways has been implicated in the regulation of cortical projection neuron migration, the precise molecular mechanisms and how a balanced interplay of cell-autonomous and non-autonomous functions of candidate signaling molecules controls the discrete steps in the migration process, are just being revealed. In this chapter, I will focally review recent advances that improved our understanding of the cell-autonomous and possible cell-nonautonomous functions of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential steps of cortical projection neuron migration. I will then elaborate on the emerging concept that the Reelin signaling pathway, acts exactly at precise stages in the course of cortical projection neuron migration. Lastly, I will discuss how finely tuned transcriptional programs and downstream effectors govern particular aspects in driving radial migration at discrete stages and how they regulate the precise positioning of cortical projection neurons in the developing cerebral cortex.","lang":"eng"}]},{"type":"conference","abstract":[{"lang":"eng","text":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. \r\nThis partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. \r\nOur main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.\r\n"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2275","status":"public","ddc":["000"],"title":"Partial enumeration and curvature regularization","pubrep_id":"566","file":[{"checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","date_updated":"2020-07-14T12:45:36Z","date_created":"2018-12-12T10:09:30Z","file_id":"4754","relation":"main_file","creator":"system","file_size":378601,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf"}],"oa_version":"Submitted Version","scopus_import":1,"has_accepted_license":"1","day":"03","citation":{"ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.","apa":"Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365","ieee":"C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365","chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.","mla":"Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.","short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943."},"page":"2936 - 2943","date_published":"2014-03-03T00:00:00Z","publist_id":"4669","file_date_updated":"2020-07-14T12:45:36Z","year":"2014","department":[{"_id":"VlKo"}],"publisher":"IEEE","publication_status":"published","author":[{"full_name":"Olsson, Carl","first_name":"Carl","last_name":"Olsson"},{"last_name":"Ulen","first_name":"Johannes","full_name":"Ulen, Johannes"},{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"}],"date_created":"2018-12-11T11:56:42Z","date_updated":"2021-01-12T06:56:28Z","month":"03","oa":1,"quality_controlled":"1","doi":"10.1109/ICCV.2013.365","conference":{"end_date":"2013-12-08","start_date":"2013-12-01","location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision"},"language":[{"iso":"eng"}]},{"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"quality_controlled":"1","doi":"10.1002/hipo.22214","language":[{"iso":"eng"}],"month":"02","year":"2014","acknowledgement":"Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505, SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation); Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript. They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical assistance.","department":[{"_id":"PeJo"}],"publisher":"Wiley-Blackwell","publication_status":"published","author":[{"last_name":"Hosp","first_name":"Jonas","full_name":"Hosp, Jonas"},{"full_name":"Strüber, Michael","last_name":"Strüber","first_name":"Michael"},{"last_name":"Yanagawa","first_name":"Yuchio","full_name":"Yanagawa, Yuchio"},{"last_name":"Obata","first_name":"Kunihiko","full_name":"Obata, Kunihiko"},{"full_name":"Vida, Imre","last_name":"Vida","first_name":"Imre"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bartos, Marlene","first_name":"Marlene","last_name":"Bartos"}],"volume":23,"date_updated":"2021-01-12T06:56:32Z","date_created":"2018-12-11T11:56:46Z","publist_id":"4646","file_date_updated":"2020-07-14T12:45:37Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","citation":{"ista":"Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 23(2), 189–203.","ieee":"J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014.","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., & Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214","ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203. doi:10.1002/hipo.22214","chicago":"Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida, Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214.","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:10.1002/hipo.22214.","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203."},"publication":"Hippocampus","page":"189 - 203","date_published":"2014-02-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","_id":"2285","intvolume":" 23","status":"public","title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","ddc":["570"],"pubrep_id":"461","oa_version":"Published Version","file":[{"checksum":"ff6bc75a79dbc985a2e31b79253e6444","date_created":"2018-12-12T10:15:54Z","date_updated":"2020-07-14T12:45:37Z","file_id":"5178","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":801589,"access_level":"open_access","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf"}],"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity."}]},{"type":"journal_article","extern":"1","issue":"1-2","publist_id":"4519","abstract":[{"text":"Two definitions of the effective mass of a particle interacting with a quantum field, such as a polaron, are considered and shown to be equal in models similar to the Fröhlich polaron model. These are: 1. the mass defined by the low momentum energy E(P)≈E(0)+P2/2 M of the translation invariant system constrained to have momentum P and 2. the mass M of a simple particle in an arbitrary slowly varying external potential, V, described by the nonrelativistic Schrödinger equation, whose ground state energy equals that of the combined particle/field system in a bound state in the same V.","lang":"eng"}],"intvolume":" 154","publisher":"Springer","status":"public","publication_status":"published","title":"Equivalence of two definitions of the effective mass of a polaron","_id":"2407","year":"2014","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":154,"oa_version":"Submitted Version","date_updated":"2021-01-12T06:57:18Z","date_created":"2018-12-11T11:57:29Z","author":[{"full_name":"Lieb, Élliott","first_name":"Élliott","last_name":"Lieb"},{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"month":"01","day":"01","page":"51 - 57","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"quality_controlled":"1","oa":1,"citation":{"ieee":"É. Lieb and R. Seiringer, “Equivalence of two definitions of the effective mass of a polaron,” Journal of Statistical Physics, vol. 154, no. 1–2. Springer, pp. 51–57, 2014.","apa":"Lieb, É., & Seiringer, R. (2014). Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-013-0791-z","ista":"Lieb É, Seiringer R. 2014. Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. 154(1–2), 51–57.","ama":"Lieb É, Seiringer R. Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. 2014;154(1-2):51-57. doi:10.1007/s10955-013-0791-z","chicago":"Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” Journal of Statistical Physics. Springer, 2014. https://doi.org/10.1007/s10955-013-0791-z.","short":"É. Lieb, R. Seiringer, Journal of Statistical Physics 154 (2014) 51–57.","mla":"Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” Journal of Statistical Physics, vol. 154, no. 1–2, Springer, 2014, pp. 51–57, doi:10.1007/s10955-013-0791-z."},"main_file_link":[{"url":"http://arxiv.org/abs/1304.1780","open_access":"1"}],"publication":"Journal of Statistical Physics","language":[{"iso":"eng"}],"date_published":"2014-01-01T00:00:00Z","doi":"10.1007/s10955-013-0791-z"},{"author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning"},{"last_name":"Matthiesen","first_name":"Lilian","full_name":"Matthiesen, Lilian"},{"full_name":"Skorobogatov, Alexei N","last_name":"Skorobogatov","first_name":"Alexei"}],"date_updated":"2021-01-12T06:57:44Z","date_created":"2018-12-11T11:45:25Z","volume":180,"acknowledgement":"While working on this paper the first two authors were supported by EPSRC grant EP/E053262/1, and the first author was further supported by ERC grant 306457.","_id":"248","year":"2014","publication_status":"published","status":"public","title":"Rational points on pencils of conics and quadrics with many degenerate fibres","publisher":"John Hopkins University Press","intvolume":" 180","abstract":[{"lang":"eng","text":"For any pencil of conics or higher-dimensional quadrics over ℚ, with all degenerate fibres defined over ℚ, we show that the Brauer–Manin obstruction controls weak approximation. The proof is based on the Hasse principle and weak approximation for some special intersections of quadrics over ℚ, which is a consequence of recent advances in additive combinatorics."}],"publist_id":"7655","issue":"1","extern":1,"type":"journal_article","date_published":"2014-07-01T00:00:00Z","doi":"https://doi.org/10.4007/annals.2014.180.1.8","publication":"Annals of Mathematics","citation":{"ama":"Browning TD, Matthiesen L, Skorobogatov A. Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. 2014;180(1):381-402. doi:https://doi.org/10.4007/annals.2014.180.1.8","ieee":"T. D. Browning, L. Matthiesen, and A. Skorobogatov, “Rational points on pencils of conics and quadrics with many degenerate fibres,” Annals of Mathematics, vol. 180, no. 1. John Hopkins University Press, pp. 381–402, 2014.","apa":"Browning, T. D., Matthiesen, L., & Skorobogatov, A. (2014). Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. John Hopkins University Press. https://doi.org/10.4007/annals.2014.180.1.8","ista":"Browning TD, Matthiesen L, Skorobogatov A. 2014. Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. 180(1), 381–402.","short":"T.D. Browning, L. Matthiesen, A. Skorobogatov, Annals of Mathematics 180 (2014) 381–402.","mla":"Browning, Timothy D., et al. “Rational Points on Pencils of Conics and Quadrics with Many Degenerate Fibres.” Annals of Mathematics, vol. 180, no. 1, John Hopkins University Press, 2014, pp. 381–402, doi:https://doi.org/10.4007/annals.2014.180.1.8.","chicago":"Browning, Timothy D, Lilian Matthiesen, and Alexei Skorobogatov. “Rational Points on Pencils of Conics and Quadrics with Many Degenerate Fibres.” Annals of Mathematics. John Hopkins University Press, 2014. https://doi.org/10.4007/annals.2014.180.1.8."},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1209.0207","open_access":"1"}],"quality_controlled":0,"page":"381 - 402","month":"07","day":"01"},{"month":"07","day":"01","doi":"10.1215/00127094-2738530","date_published":"2014-07-01T00:00:00Z","page":"1825 - 1883","quality_controlled":0,"citation":{"chicago":"Browning, Timothy D, and Pankaj Vishe. “Cubic Hypersurfaces and a Version of the Circle Method for Number Fields.” Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2738530.","mla":"Browning, Timothy D., and Pankaj Vishe. “Cubic Hypersurfaces and a Version of the Circle Method for Number Fields.” Duke Mathematical Journal, vol. 163, no. 10, Duke University Press, 2014, pp. 1825–83, doi:10.1215/00127094-2738530.","short":"T.D. Browning, P. Vishe, Duke Mathematical Journal 163 (2014) 1825–1883.","ista":"Browning TD, Vishe P. 2014. Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. 163(10), 1825–1883.","ieee":"T. D. Browning and P. Vishe, “Cubic hypersurfaces and a version of the circle method for number fields,” Duke Mathematical Journal, vol. 163, no. 10. Duke University Press, pp. 1825–1883, 2014.","apa":"Browning, T. D., & Vishe, P. (2014). Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2738530","ama":"Browning TD, Vishe P. Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. 2014;163(10):1825-1883. doi:10.1215/00127094-2738530"},"publication":"Duke Mathematical Journal","extern":1,"publist_id":"7653","issue":"10","abstract":[{"text":"A version of the Hardy-Littlewood circle method is developed for number fields K/ℚ and is used to show that nonsingular projective cubic hypersurfaces over K always have a K-rational point when they have dimension at least 8. ","lang":"eng"}],"type":"journal_article","volume":163,"date_updated":"2021-01-12T06:57:47Z","date_created":"2018-12-11T11:45:26Z","author":[{"full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"first_name":"Pankaj","last_name":"Vishe","full_name":"Vishe, Pankaj"}],"publisher":"Duke University Press","intvolume":" 163","publication_status":"published","title":"Cubic hypersurfaces and a version of the circle method for number fields","status":"public","_id":"249","year":"2014"},{"day":"01","month":"01","publication":"Acta Arithmetica","citation":{"ama":"Browning TD, Jones M. Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. 2014;163(3):271-298. doi:10.4064/aa163-3-6","ieee":"T. D. Browning and M. Jones, “Counting rational points on del Pezzo surfaces with a conic bundle structure,” Acta Arithmetica, vol. 163, no. 3. Instytut Matematyczny, pp. 271–298, 2014.","apa":"Browning, T. D., & Jones, M. (2014). Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa163-3-6","ista":"Browning TD, Jones M. 2014. Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. 163(3), 271–298.","short":"T.D. Browning, M. Jones, Acta Arithmetica 163 (2014) 271–298.","mla":"Browning, Timothy D., and Michael Jones. “Counting Rational Points on Del Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica, vol. 163, no. 3, Instytut Matematyczny, 2014, pp. 271–98, doi:10.4064/aa163-3-6.","chicago":"Browning, Timothy D, and Michael Jones. “Counting Rational Points on Del Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica. Instytut Matematyczny, 2014. https://doi.org/10.4064/aa163-3-6."},"quality_controlled":0,"page":"271 - 298","doi":"10.4064/aa163-3-6","date_published":"2014-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.","lang":"eng"}],"publist_id":"7650","issue":"3","extern":1,"year":"2014","_id":"252","status":"public","title":"Counting rational points on del Pezzo surfaces with a conic bundle structure","publication_status":"published","publisher":"Instytut Matematyczny","intvolume":" 163","author":[{"full_name":"Timothy Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"last_name":"Jones","first_name":"Michael","full_name":"Jones, Michael S"}],"date_created":"2018-12-11T11:45:26Z","date_updated":"2021-01-12T06:57:59Z","volume":163},{"abstract":[{"lang":"eng","text":"A new "polynomial sieve" is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3."}],"publist_id":"7648","issue":"7","extern":1,"type":"journal_article","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"}],"date_created":"2018-12-11T11:45:27Z","date_updated":"2021-01-12T06:58:07Z","volume":2015,"_id":"254","year":"2014","acknowledgement":"While working on this paper, the author was supported by ERC grant 306457 and a Philip Leverhulme Prize.","status":"public","title":"The polynomial sieve and equal sums of like polynomials","publication_status":"published","publisher":"Oxford University Press","intvolume":" 2015","day":"31","month":"01","doi":"10.1093/imrn/rnt350","date_published":"2014-01-31T00:00:00Z","publication":"International Mathematics Research Notices","citation":{"short":"T.D. Browning, International Mathematics Research Notices 2015 (2014) 1987–2019.","mla":"Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” International Mathematics Research Notices, vol. 2015, no. 7, Oxford University Press, 2014, pp. 1987–2019, doi:10.1093/imrn/rnt350.","chicago":"Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” International Mathematics Research Notices. Oxford University Press, 2014. https://doi.org/10.1093/imrn/rnt350.","ama":"Browning TD. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2014;2015(7):1987-2019. doi:10.1093/imrn/rnt350","apa":"Browning, T. D. (2014). The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnt350","ieee":"T. D. Browning, “The polynomial sieve and equal sums of like polynomials,” International Mathematics Research Notices, vol. 2015, no. 7. Oxford University Press, pp. 1987–2019, 2014.","ista":"Browning TD. 2014. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2015(7), 1987–2019."},"quality_controlled":0,"page":"1987 - 2019"},{"article_processing_charge":"No","day":"05","month":"01","language":[{"iso":"eng"}],"doi":"10.1017/S1474748014000127","date_published":"2014-01-05T00:00:00Z","page":"703 - 749","citation":{"ista":"Browning TD, Dietmann R, Heath Brown R. 2014. Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. 14(4), 703–749.","apa":"Browning, T. D., Dietmann, R., & Heath Brown, R. (2014). Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748014000127","ieee":"T. D. Browning, R. Dietmann, and R. Heath Brown, “Rational points on intersections of cubic and quadric hypersurfaces,” Journal of the Institute of Mathematics of Jussieu, vol. 14, no. 4. Cambridge University Press, pp. 703–749, 2014.","ama":"Browning TD, Dietmann R, Heath Brown R. Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. 2014;14(4):703-749. doi:10.1017/S1474748014000127","chicago":"Browning, Timothy D, Rainer Dietmann, and Roger Heath Brown. “Rational Points on Intersections of Cubic and Quadric Hypersurfaces.” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2014. https://doi.org/10.1017/S1474748014000127.","mla":"Browning, Timothy D., et al. “Rational Points on Intersections of Cubic and Quadric Hypersurfaces.” Journal of the Institute of Mathematics of Jussieu, vol. 14, no. 4, Cambridge University Press, 2014, pp. 703–49, doi:10.1017/S1474748014000127.","short":"T.D. Browning, R. Dietmann, R. Heath Brown, Journal of the Institute of Mathematics of Jussieu 14 (2014) 703–749."},"publication":"Journal of the Institute of Mathematics of Jussieu","extern":"1","publist_id":"7647","issue":"4","abstract":[{"text":"We investigate the Hasse principle for complete intersections cut out by a quadric hypersurface and a cubic hypersurface defined over the rational numbers.","lang":"eng"}],"type":"journal_article","oa_version":"None","volume":14,"date_created":"2018-12-11T11:45:27Z","date_updated":"2021-11-16T08:07:06Z","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1017/S1474748014000279"}]},"author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"full_name":"Dietmann, Rainer","last_name":"Dietmann","first_name":"Rainer"},{"full_name":"Heath Brown, Roger","last_name":"Heath Brown","first_name":"Roger"}],"intvolume":" 14","publisher":"Cambridge University Press","status":"public","title":"Rational points on intersections of cubic and quadric hypersurfaces","publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"255","year":"2014"},{"language":[{"iso":"eng"}],"date_published":"2014-04-01T00:00:00Z","doi":"10.1215/00127094-2649752","quality_controlled":"1","page":"1127 - 1190","publication":"Duke Mathematical Journal","oa":1,"citation":{"ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752","apa":"Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752","ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190.","short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752."},"main_file_link":[{"url":"http://arxiv.org/abs/1104.2272","open_access":"1"}],"day":"01","month":"04","scopus_import":1,"date_created":"2018-12-11T11:59:08Z","date_updated":"2021-01-12T06:59:07Z","oa_version":"Preprint","volume":163,"author":[{"full_name":"Erdös, László","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"}],"publication_status":"published","status":"public","title":"Universality of general β-ensembles","publisher":"Duke University Press","intvolume":" 163","department":[{"_id":"LaEr"}],"_id":"2699","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","year":"2014","abstract":[{"text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.","lang":"eng"}],"publist_id":"4197","issue":"6","type":"journal_article"},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2014-06-01T00:00:00Z","publication":"Acta Informatica","citation":{"ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","apa":"Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6."},"article_type":"original","page":"129 - 163","abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"issue":"3-4","type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2716","status":"public","title":"Strategy synthesis for multi-dimensional quantitative objectives","intvolume":" 51","month":"06","doi":"10.1007/s00236-013-0182-6","language":[{"iso":"eng"}],"external_id":{"arxiv":["1201.5073"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"publist_id":"4176","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10904"}]},"date_created":"2018-12-11T11:59:14Z","date_updated":"2023-02-21T16:06:56Z","volume":51,"acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","year":"2014","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}]},{"abstract":[{"text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions.","lang":"eng"}],"type":"conference","pubrep_id":"544","oa_version":"Submitted Version","file":[{"creator":"system","content_type":"application/pdf","file_size":435320,"file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:16:43Z","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","file_id":"5232","relation":"main_file"}],"_id":"2905","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Persistent homology: Theory and practice","status":"public","ddc":["000"],"has_accepted_license":"1","article_processing_charge":"No","day":"01","date_published":"2014-01-01T00:00:00Z","citation":{"ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","apa":"Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3."},"page":"31 - 50","publist_id":"3842","file_date_updated":"2020-07-14T12:45:52Z","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Morozovy, Dmitriy","last_name":"Morozovy","first_name":"Dmitriy"}],"date_created":"2018-12-11T12:00:16Z","date_updated":"2021-01-12T07:00:36Z","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","year":"2014","department":[{"_id":"HeEd"}],"publisher":"European Mathematical Society Publishing House","publication_status":"published","month":"01","doi":"10.4171/120-1/3","conference":{"name":"ECM: European Congress of Mathematics","end_date":"2012-07-07","location":"Kraków, Poland","start_date":"2012-07-02"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1"},{"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1016/j.tcs.2014.08.019","language":[{"iso":"eng"}],"month":"12","year":"2014","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Elsevier","publication_status":"published","related_material":{"record":[{"id":"2916","status":"public","relation":"earlier_version"}]},"author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"volume":560,"date_updated":"2023-02-23T11:04:00Z","date_created":"2018-12-11T11:53:43Z","publist_id":"5392","ec_funded":1,"citation":{"ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019."},"publication":"Theoretical Computer Science","page":"348 - 363","date_published":"2014-12-04T00:00:00Z","scopus_import":1,"day":"04","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"1733","intvolume":" 560","title":"Interface simulation distances","status":"public","oa_version":"Submitted Version","type":"journal_article","issue":"3","abstract":[{"text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}]},{"type":"journal_article","abstract":[{"lang":"eng","text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m>n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem."}],"issue":"3","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"2141","status":"public","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","intvolume":" 61","oa_version":"Submitted Version","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Journal of the ACM","citation":{"ista":"Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","apa":"Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. https://doi.org/10.1145/2597631","ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 2014;61(3). doi:10.1145/2597631","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014)."},"date_published":"2014-05-01T00:00:00Z","article_number":"a15","publist_id":"4883","ec_funded":1,"year":"2014","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"ACM","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"}],"related_material":{"record":[{"id":"3165","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-11T11:55:57Z","date_updated":"2023-02-23T11:15:12Z","volume":61,"month":"05","oa":1,"main_file_link":[{"url":"https://eprints.cs.univie.ac.at/3933/","open_access":"1"}],"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/2597631","language":[{"iso":"eng"}]},{"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","_id":"3263","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","status":"public","ddc":["570"],"intvolume":" 9","pubrep_id":"432","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":1568524,"creator":"system","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:13:28Z","checksum":"1d5816b343abe5eadc3eb419bcece971","relation":"main_file","file_id":"5011"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution."}],"issue":"1","publication":"PLoS One","citation":{"ista":"Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.","apa":"Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:10.1371/journal.pone.0085841.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014)."},"date_published":"2014-01-21T00:00:00Z","scopus_import":1,"day":"21","has_accepted_license":"1","acknowledgement":"This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n","year":"2014","publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","author":[{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Ghosh, Anandamohan","first_name":"Anandamohan","last_name":"Ghosh"},{"full_name":"Schneidman, Elad","first_name":"Elad","last_name":"Schneidman"},{"full_name":"Segev, Ronen","first_name":"Ronen","last_name":"Segev"}],"date_created":"2018-12-11T12:02:20Z","date_updated":"2021-01-12T07:42:14Z","volume":9,"article_number":"e85841","file_date_updated":"2020-07-14T12:46:06Z","publist_id":"3385","oa":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"},"quality_controlled":"1","doi":"10.1371/journal.pone.0085841","language":[{"iso":"eng"}],"month":"01"},{"abstract":[{"lang":"eng","text":"Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting. "}],"issue":"26","publist_id":"7513","extern":"1","type":"journal_article","author":[{"last_name":"Yu","first_name":"Xuelian","full_name":"Yu, Xuelian"},{"last_name":"Shavel","first_name":"Alexey","full_name":"Shavel, Alexey"},{"full_name":"An, Xiaoqiang","first_name":"Xiaoqiang","last_name":"An"},{"full_name":"Luo, Zhishan","last_name":"Luo","first_name":"Zhishan"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"date_created":"2018-12-11T11:45:52Z","date_updated":"2021-01-12T07:42:37Z","volume":136,"oa_version":"None","_id":"332","year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation","intvolume":" 136","publisher":"ACS","day":"11","month":"06","article_processing_charge":"No","doi":"10.1021/ja502076b","date_published":"2014-06-11T00:00:00Z","language":[{"iso":"eng"}],"publication":"Journal of the American Chemical Society","citation":{"ama":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239. doi:10.1021/ja502076b","ista":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 136(26), 9236–9239.","ieee":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation,” Journal of the American Chemical Society, vol. 136, no. 26. ACS, pp. 9236–9239, 2014.","apa":"Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja502076b","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society, vol. 136, no. 26, ACS, 2014, pp. 9236–39, doi:10.1021/ja502076b.","short":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American Chemical Society 136 (2014) 9236–9239.","chicago":"Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society. ACS, 2014. https://doi.org/10.1021/ja502076b."},"article_type":"original","quality_controlled":"1","page":"9236 - 9239"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where 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. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games."}],"intvolume":" 8704","title":"Qualitative concurrent parity games: Bounded rationality","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2054","oa_version":"None","day":"01","page":"544 - 559","citation":{"apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.","ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37."},"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_published":"2014-09-01T00:00:00Z","publist_id":"4992","ec_funded":1,"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"full_name":"Gorla, Daniele","last_name":"Gorla","first_name":"Daniele"}],"publication_status":"published","year":"2014","volume":8704,"date_created":"2018-12-11T11:55:27Z","date_updated":"2023-02-23T11:23:36Z","related_material":{"record":[{"id":"3354","relation":"earlier_version","status":"public"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"month":"09","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-44584-6_37","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2014-09-02","location":"Rome, Italy","end_date":"2014-09-05"}},{"day":"21","month":"07","article_processing_charge":"No","publication":"International Journal of Nanotechnology","citation":{"mla":"Ortega, Silvia, et al. “Bottom up Processing of PbTe PbS Thermoelectric Nanocomposites.” International Journal of Nanotechnology, vol. 11, no. 9–11, Inderscience Enterprises Limited , 2014, pp. 955–70, doi:10.1504/IJNT.2014.063802.","short":"S. Ortega, M. Ibáñez, D. Cadavid, A. Cabot, International Journal of Nanotechnology 11 (2014) 955–970.","chicago":"Ortega, Silvia, Maria Ibáñez, Doris Cadavid, and Andreu Cabot. “Bottom up Processing of PbTe PbS Thermoelectric Nanocomposites.” International Journal of Nanotechnology. Inderscience Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063802.","ama":"Ortega S, Ibáñez M, Cadavid D, Cabot A. Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. 2014;11(9-11):955-970. doi:10.1504/IJNT.2014.063802","ista":"Ortega S, Ibáñez M, Cadavid D, Cabot A. 2014. Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. 11(9–11), 955–970.","ieee":"S. Ortega, M. Ibáñez, D. Cadavid, and A. Cabot, “Bottom up processing of PbTe PbS thermoelectric nanocomposites,” International Journal of Nanotechnology, vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 955–970, 2014.","apa":"Ortega, S., Ibáñez, M., Cadavid, D., & Cabot, A. (2014). Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. Inderscience Enterprises Limited . https://doi.org/10.1504/IJNT.2014.063802"},"article_type":"original","quality_controlled":"1","page":"955 - 970","doi":"10.1504/IJNT.2014.063802","date_published":"2014-07-21T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Thermoelectricity is a key technology with the potential to improve the efficiency of energy conversion processes, which may strongly benefit from advances in the field of nanotechnology. Nanostructured materials are very appealing for thermoelectric applications, but the full development of their potential requires precise control of their properties at the nanoscale. Bottom-up assembly of nanoparticles provides access to a three-dimensional composition control at the nanoscale not attainable in any other technology. In particular, colloidal nanoheterostructures are especially interesting building blocks for the bottom-up production of functional nanomaterials. In the present work, we use PbTe@PbS core-shell nanoparticles as building blocks for the bottom-up production of PbTe-PbS nanocomposites. We used a ligand exchange strategy and a hot press process to promote the electrical conductivity of the nanocomposite and to increase its density. These two approaches allowed us to improve the performance of bottom-up assembled PbTe-PbS bulk nanostructured materials. ","lang":"eng"}],"issue":"9-11","publist_id":"7477","extern":"1","_id":"349","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","publication_status":"published","title":"Bottom up processing of PbTe PbS thermoelectric nanocomposites","status":"public","intvolume":" 11","publisher":"Inderscience Enterprises Limited ","author":[{"full_name":"Ortega, Silvia","last_name":"Ortega","first_name":"Silvia"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"date_created":"2018-12-11T11:45:57Z","date_updated":"2021-01-12T07:43:48Z","volume":11,"oa_version":"None"}]