[{"month":"01","citation":{"ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>","ama":"Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167-1168. doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd., 2012. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>."},"date_created":"2018-12-11T11:59:55Z","date_updated":"2021-01-12T07:00:13Z","publist_id":"3943","department":[{"_id":"HeEd"}],"intvolume":"        67","volume":67,"file":[{"file_id":"5078","checksum":"44ee8d173487e8ed41a51136816bbeb4","date_updated":"2020-07-14T12:45:51Z","relation":"main_file","date_created":"2018-12-12T10:14:26Z","access_level":"open_access","content_type":"application/pdf","creator":"system","file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf","file_size":392021}],"doi":"10.1070/RM2012v067n06ABEH004820","issue":"6","_id":"2849","date_published":"2012-01-01T00:00:00Z","title":"On the configuration space of Steiner minimal trees","day":"01","publication":"Russian Mathematical Surveys","has_accepted_license":"1","publication_status":"published","quality_controlled":"1","scopus_import":1,"type":"journal_article","publisher":"IOP Publishing Ltd.","page":"1167 - 1168","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Nataliya","last_name":"Strelkova","full_name":"Strelkova, Nataliya"}],"oa_version":"Submitted Version","status":"public","pubrep_id":"546","year":"2012","ddc":["000"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:51Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"day":"05","date_published":"2012-06-05T00:00:00Z","title":"Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","publication_status":"published","type":"journal_article","quality_controlled":0,"publisher":"Royal Society, The","abstract":[{"lang":"eng","text":"Phytohormones are important plant growth regulators that control many developmental processes, such as cell division, cell differentiation, organogenesis and morphogenesis. They regulate a multitude of apparently unrelated physiological processes, often with overlapping roles, and they mutually modulate their effects. These features imply important synergistic and antagonistic interactions between the various plant hormones. Auxin and cytokinin are central hormones involved in the regulation of plant growth and development, including processes determining root architecture, such as root pole establishment during early embryogenesis, root meristem maintenance and lateral root organogenesis. Thus, to control root development both pathways put special demands on the mechanisms that balance their activities and mediate their interactions. Here, we summarize recent knowledge on the role of auxin and cytokinin in the regulation of root architecture with special focus on lateral root organogenesis, discuss the latest findings on the molecular mechanisms of their interactions, and present forward genetic screen as a tool to identify novel molecular components of the auxin and cytokinin crosstalk."}],"author":[{"first_name":"Agnieszka","full_name":"Bielach, Agnieszka","last_name":"Bielach"},{"full_name":"Duclercq, Jérôme","last_name":"Duclercq","first_name":"Jérôme"},{"full_name":"Peter Marhavy","last_name":"Marhavy","orcid":"0000-0001-5227-5741","first_name":"Peter","id":"3F45B078-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Eva Benková","last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"}],"page":"1469 - 1478","month":"06","citation":{"ista":"Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 367(1595), 1469–1478.","ama":"Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2012;367(1595):1469-1478. doi:<a href=\"https://doi.org/10.1098/rstb.2011.0233\">10.1098/rstb.2011.0233</a>","apa":"Bielach, A., Duclercq, J., Marhavý, P., &#38; Benková, E. (2012). Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rstb.2011.0233\">https://doi.org/10.1098/rstb.2011.0233</a>","short":"A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478.","mla":"Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:<a href=\"https://doi.org/10.1098/rstb.2011.0233\">10.1098/rstb.2011.0233</a>.","ieee":"A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478, 2012.","chicago":"Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The, 2012. <a href=\"https://doi.org/10.1098/rstb.2011.0233\">https://doi.org/10.1098/rstb.2011.0233</a>."},"publist_id":"3887","date_updated":"2021-01-12T07:00:25Z","date_created":"2018-12-11T12:00:05Z","intvolume":"       367","status":"public","volume":367,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/","open_access":"1"}],"doi":"10.1098/rstb.2011.0233","issue":"1595","year":"2012","_id":"2875","extern":1},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","language":[{"iso":"eng"}],"ddc":["004"],"oa":1,"pubrep_id":"805","year":"2012","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"ec_funded":1,"oa_version":"Published Version","status":"public","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"page":"362 - 373","scopus_import":1,"type":"conference","publication_status":"published","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"has_accepted_license":"1","day":"01","title":"Approximate determinization of quantitative automata","date_published":"2012-12-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2012-12-17","start_date":"2012-12-15","location":"Hyderabad, India"},"_id":"2891","file":[{"creator":"system","file_size":559069,"file_name":"IST-2017-805-v1+1_34.pdf","date_created":"2018-12-12T10:10:37Z","access_level":"open_access","date_updated":"2020-07-14T12:45:52Z","relation":"main_file","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_id":"4826","content_type":"application/pdf"}],"volume":18,"doi":"10.4230/LIPIcs.FSTTCS.2012.362","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"ToHe"}],"publist_id":"3867","date_created":"2018-12-11T12:00:10Z","date_updated":"2021-01-12T07:00:31Z","intvolume":"        18","month":"12","citation":{"apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>."},"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata."},{"type":"journal_article","quality_controlled":"1","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Russian Academy of Sciences","abstract":[{"text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. ","lang":"eng"}],"article_processing_charge":"No","oa":1,"day":"01","title":"Fractal and computational geometry for generalizing cartographic objects","date_published":"2012-12-01T00:00:00Z","language":[{"iso":"rus"}],"publication":"Modeling and Analysis of Information Systems","main_file_link":[{"open_access":"1","url":"http://mi.mathnet.ru/eng/mais280"}],"volume":19,"issue":"6","year":"2012","_id":"2902","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Musin, Oleg","last_name":"Musin","first_name":"Oleg"},{"first_name":"Alexey","last_name":"Ukhalov","full_name":"Ukhalov, Alexey"},{"last_name":"Yakimova","full_name":"Yakimova, Olga","first_name":"Olga"},{"first_name":"Vladislav","last_name":"Alexeev","full_name":"Alexeev, Vladislav"},{"first_name":"Victoriya","full_name":"Bogaevskaya, Victoriya","last_name":"Bogaevskaya"},{"first_name":"Andrey","last_name":"Gorohov","full_name":"Gorohov, Andrey"},{"first_name":"Margarita","last_name":"Preobrazhenskaya","full_name":"Preobrazhenskaya, Margarita"}],"month":"12","page":"152 - 160","article_type":"original","citation":{"ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. 2012;19(6):152-160.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences.","ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences, 2012.","mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.","short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.","ieee":"H. Edelsbrunner <i>et al.</i>, “Fractal and computational geometry for generalizing cartographic objects,” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012."},"oa_version":"Published Version","department":[{"_id":"HeEd"}],"publist_id":"3845","date_created":"2018-12-11T12:00:15Z","date_updated":"2023-10-18T07:34:45Z","intvolume":"        19","status":"public"},{"day":"06","title":"The adaptive topology of a digital image","date_published":"2012-08-06T00:00:00Z","quality_controlled":"1","publication_status":"published","scopus_import":1,"type":"conference","publisher":"IEEE","has_accepted_license":"1","publist_id":"3844","department":[{"_id":"HeEd"},{"_id":"MaJö"}],"date_created":"2018-12-11T12:00:15Z","date_updated":"2021-01-12T07:00:35Z","month":"08","citation":{"short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.","mla":"Edelsbrunner, Herbert, and Olga Symonova. <i>The Adaptive Topology of a Digital Image</i>. IEEE, 2012, pp. 41–48, doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>.","ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>.","ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>","apa":"Edelsbrunner, H., &#38; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>"},"conference":{"start_date":"2012-06-27","location":"New Brunswick, NJ, USA ","end_date":"2012-06-29","name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering"},"_id":"2903","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:09:41Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:52Z","checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_id":"4765","file_size":760548,"file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","creator":"system"}],"doi":"10.1109/ISVD.2012.11","language":[{"iso":"eng"}],"ddc":["000"],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","oa_version":"Submitted Version","status":"public","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga","full_name":"Symonova, Olga","last_name":"Symonova"}],"page":"41 - 48","pubrep_id":"545","year":"2012"},{"ddc":["510"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","abstract":[{"text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences.","lang":"eng"},{"text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i)  =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.","lang":"fre"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"729 - 749","author":[{"last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","status":"public","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"year":"2012","date_published":"2012-01-01T00:00:00Z","title":"Weak multipliers for generalized van der Corput sequences","day":"01","publication":"Journal de Theorie des Nombres des Bordeaux","has_accepted_license":"1","type":"journal_article","publication_status":"published","quality_controlled":"1","scopus_import":"1","publisher":"Université de Bordeaux","article_type":"original","month":"01","citation":{"short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>.","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” <i>Journal de Theorie des Nombres des Bordeaux</i>, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux, 2012. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>.","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.","ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie des Nombres des Bordeaux</i>. 2012;24(3):729-749. doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>","apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>"},"date_created":"2018-12-11T12:00:15Z","date_updated":"2023-10-18T07:53:47Z","department":[{"_id":"HeEd"}],"publist_id":"3843","intvolume":"        24","volume":24,"file":[{"file_id":"7819","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","relation":"main_file","date_created":"2020-05-11T12:40:39Z","access_level":"open_access","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","creator":"dernst","file_size":819275,"file_name":"JTNB_2012__24_3_729_0.pdf"}],"doi":"10.5802/jtnb.819","issue":"3","_id":"2904"},{"ec_funded":1,"year":"2012","related_material":{"record":[{"id":"1733","relation":"later_version","status":"public"}]},"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"page":"29 - 42","status":"public","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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 quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, 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, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}],"external_id":{"arxiv":["1210.2450"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4204/EPTCS.96.3","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"volume":96,"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"conference":{"location":"Napoli, Italy","start_date":"2012-09-06","end_date":"2012-09-08","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"_id":"2916","citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42."},"month":"10","intvolume":"        96","publist_id":"3827","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2018-12-11T12:00:19Z","date_updated":"2023-02-23T10:12:05Z","arxiv":1,"publisher":"EPTCS","type":"conference","quality_controlled":"1","scopus_import":1,"publication_status":"published","publication":"Electronic Proceedings in Theoretical Computer Science","day":"07","date_published":"2012-10-07T00:00:00Z","title":"Interface Simulation Distances"},{"oa":1,"day":"29","date_published":"2012-05-29T00:00:00Z","title":"Generalized sequential tree-reweighted message passing","language":[{"iso":"eng"}],"publication":"arXiv","arxiv":1,"type":"preprint","publication_status":"published","external_id":{"arxiv":["1205.6352"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ArXiv","article_processing_charge":"No","abstract":[{"lang":"eng","text":"     This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. "}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"first_name":"Thomas","last_name":"Schoenemann","full_name":"Schoenemann, Thomas"}],"month":"05","page":"16","citation":{"ista":"Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, .","apa":"Kolmogorov, V., &#38; Schoenemann, T. (2012). Generalized sequential tree-reweighted message passing. <i>arXiv</i>. ArXiv.","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. 2012.","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” <i>arXiv</i>. ArXiv, 2012.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, ArXiv, 2012.","short":"V. Kolmogorov, T. Schoenemann, ArXiv (2012).","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>. ArXiv, 2012."},"department":[{"_id":"VlKo"}],"oa_version":"Preprint","publist_id":"3809","date_created":"2018-12-11T12:00:23Z","date_updated":"2021-01-12T07:00:45Z","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.6352"}],"year":"2012","_id":"2928"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7213"}],"_id":"2929","year":"2012","extern":1,"month":"01","author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"citation":{"ieee":"V. Kolmogorov, <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown, 2012.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","chicago":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p.","apa":"Kolmogorov, V. (2012). <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown.","ama":"Kolmogorov V. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown; 2012."},"date_updated":"2019-04-26T07:22:21Z","date_created":"2018-12-11T12:00:24Z","publist_id":"3807","status":"public","type":"report","publication_status":"published","quality_controlled":0,"publisher":"Unknown","oa":1,"date_published":"2012-01-01T00:00:00Z","title":"The power of linear programming for valued CSPs: a constructive characterization","day":"01"},{"citation":{"mla":"Huber, Anna, and Vladimir Kolmogorov. <i>Towards Minimizing K-Submodular Functions</i>. Vol. 7422, Springer, 2012, pp. 451–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>.","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.","ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>","apa":"Huber, A., &#38; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>"},"acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","month":"04","intvolume":"      7422","department":[{"_id":"VlKo"}],"publist_id":"3806","date_updated":"2021-01-12T07:00:46Z","date_created":"2018-12-11T12:00:24Z","doi":"10.1007/978-3-642-32147-4_40","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"volume":7422,"conference":{"name":"ISCO: International Symposium on Combinatorial Optimization","end_date":"2012-04-21","location":"Athens, Greece","start_date":"2012-04-19"},"_id":"2930","day":"01","title":"Towards minimizing k-submodular functions","date_published":"2012-04-01T00:00:00Z","alternative_title":["LNCS"],"publisher":"Springer","scopus_import":1,"publication_status":"published","type":"conference","quality_controlled":"1","author":[{"full_name":"Huber, Anna","last_name":"Huber","first_name":"Anna"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"page":"451 - 462","status":"public","oa_version":"Preprint","year":"2012","oa":1,"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n","lang":"eng"}]},{"date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"3799","month":"10","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","citation":{"ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>roceedings of the tenth ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>roceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>."},"_id":"2936","conference":{"end_date":"2012-10-12","name":"EMSOFT: Embedded Software ","location":"Tampere, Finland","start_date":"2012-10-07"},"main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/2380356.2380370","title":"Finite automata with time delay blocks","date_published":"2012-10-01T00:00:00Z","day":"01","publication":"roceedings of the tenth ACM international conference on Embedded software","publication_status":"published","quality_controlled":"1","scopus_import":1,"type":"conference","publisher":"ACM","oa_version":"Preprint","status":"public","page":"43 - 52","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Prabhu","full_name":"Prabhu, Vinayak","first_name":"Vinayak"}],"year":"2012","ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"publication":"Proceedings of the 2012 ACM conference on Computer and communications security","language":[{"iso":"eng"}],"day":"01","title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","date_published":"2012-10-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","abstract":[{"lang":"eng","text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system."}],"type":"conference","quality_controlled":"1","scopus_import":1,"publication_status":"published","citation":{"ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in <i>Proceedings of the 2012 ACM conference on Computer and communications security</i>, Raleigh, NC, USA, 2012, pp. 488–500.","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, ACM, 2012, pp. 488–500, doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>.","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, 488–500. ACM, 2012. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>.","ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Computer and Communications Security, 488–500.","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., &#38; Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In <i>Proceedings of the 2012 ACM conference on Computer and communications security</i> (pp. 488–500). Raleigh, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>","ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>. ACM; 2012:488-500. doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>"},"acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","author":[{"first_name":"José","full_name":"Almeida, José","last_name":"Almeida"},{"first_name":"Manuel","full_name":"Barbosa, Manuel","last_name":"Barbosa"},{"first_name":"Endre","full_name":"Bangerter, Endre","last_name":"Bangerter"},{"last_name":"Barthe","full_name":"Barthe, Gilles","first_name":"Gilles"},{"first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan","last_name":"Krenn","orcid":"0000-0003-2835-9093"},{"full_name":"Béguelin, Santiago","last_name":"Béguelin","first_name":"Santiago"}],"page":"488 - 500","month":"10","status":"public","oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"publist_id":"3798","date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","doi":"10.1145/2382196.2382249","main_file_link":[{"url":"https://eprint.iacr.org/2012/258","open_access":"1"}],"conference":{"name":"CCS: Computer and Communications Security","end_date":"2012-10-18","start_date":"2012-10-16","location":"Raleigh, NC, USA"},"_id":"2937","year":"2012"},{"year":"2012","pubrep_id":"132","status":"public","oa_version":"Submitted Version","author":[{"first_name":"Nikolai","full_name":"Dolbilin, Nikolai","last_name":"Dolbilin"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Musin","full_name":"Musin, Oleg","first_name":"Oleg"}],"page":"781 - 783","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:45:55Z","language":[{"iso":"eng"}],"oa":1,"ddc":["510"],"_id":"2941","issue":"4","doi":"10.1070/RM2012v067n04ABEH004807","file":[{"creator":"system","file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf","file_size":253816,"date_updated":"2020-07-14T12:45:55Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:16:49Z","file_id":"5239","checksum":"389a5ae53d6347de36c3468034f2821d","content_type":"application/pdf"}],"volume":67,"intvolume":"        67","publist_id":"3792","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:00:28Z","date_updated":"2021-01-12T07:39:55Z","citation":{"chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>.","mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>.","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. 2012;67(4):781-783. doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>","apa":"Dolbilin, N., Edelsbrunner, H., &#38; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>","ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783."},"month":"11","publisher":"IOP Publishing","scopus_import":1,"publication_status":"published","quality_controlled":"1","type":"journal_article","has_accepted_license":"1","publication":"Russian Mathematical Surveys","day":"01","date_published":"2012-11-01T00:00:00Z","title":"On the optimality of functionals over triangulations of Delaunay sets"},{"year":"2012","status":"public","oa_version":"Submitted Version","page":"1318 - 1333","author":[{"first_name":"Nastaran","full_name":"Hadizadeh Yazdi, Nastaran","last_name":"Hadizadeh Yazdi"},{"full_name":"Guet, Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Reid","last_name":"Johnson","full_name":"Johnson, Reid"},{"first_name":"John","full_name":"Marko, John","last_name":"Marko"}],"abstract":[{"lang":"eng","text":"We examine whether the Escherichia coli chromosome is folded into a self-adherent nucleoprotein complex, or alternately is a confined but otherwise unconstrained self-avoiding polymer. We address this through in vivo visualization, using an inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically decorate the entire chromosome. For a range of different growth conditions, the chromosome is a compact structure that does not fill the volume of the cell, and which moves from the new pole to the cell centre. During rapid growth, chromosome segregation occurs well before cell division, with daughter chromosomes coupled by a thin inter-daughter filament before complete segregation, whereas during slow growth chromosomes stay adjacent until cell division occurs. Image correlation analysis indicates that sub-nucleoid structure is stable on a 1min timescale, comparable to the timescale for redistribution time measured for GFP-Fis after photobleaching. Optical deconvolution and writhe calculation analysis indicate that the nucleoid has a large-scale coiled organization rather than being an amorphous mass. Our observations are consistent with the chromosome having a self-adherent filament organization."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa":1,"_id":"2943","issue":"6","doi":"10.1111/mmi.12071","volume":86,"main_file_link":[{"url":"http://europepmc.org/articles/pmc3524407","open_access":"1"}],"intvolume":"        86","date_updated":"2021-01-12T07:39:56Z","date_created":"2018-12-11T12:00:28Z","publist_id":"3790","department":[{"_id":"CaGu"}],"acknowledgement":"We thank Professor Philippe Cluzel and Mr Lance Min for providing advice and materials. Jeannette Chau provided technical support. Work at NU was supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262 (NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical Consortium with support from the Searle Funds at the Chicago Community Trust. Work at UCLA was supported by NIH Grant GM038509.","citation":{"chicago":"Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>.","ieee":"N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions,” <i>Molecular Microbiology</i>, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333, 2012.","mla":"Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>, vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>.","short":"N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology 86 (2012) 1318–1333.","apa":"Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., &#38; Marko, J. (2012). Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>","ama":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. 2012;86(6):1318-1333. doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>","ista":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. 86(6), 1318–1333."},"month":"11","publisher":"Wiley-Blackwell","publication_status":"published","quality_controlled":"1","scopus_import":1,"type":"journal_article","publication":"Molecular Microbiology","title":"Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions","date_published":"2012-11-09T00:00:00Z","day":"09"},{"ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:55Z","abstract":[{"lang":"eng","text":"MicroRNAs (miRNAs) are small noncoding RNAs that function in literally all cellular processes. miRNAs interact with Argonaute (Ago) proteins and guide them to specific target sites located in the 3′-untranslated region (3′-UTR) of target mRNAs leading to translational repression and deadenylation-induced mRNA degradation. Most miRNAs are processed from hairpin-structured precursors by the consecutive action of the RNase III enzymes Drosha and Dicer. However, processing of miR-451 is Dicer independent and cleavage is mediated by the endonuclease Ago2. Here we have characterized miR-451 sequence and structure requirements for processing as well as sorting of miRNAs into different Ago proteins. Pre-miR-451 appears to be optimized for Ago2 cleavage and changes result in reduced processing. In addition, we show that the mature miR-451 only associates with Ago2 suggesting that mature miRNAs are not exchanged between different members of the Ago protein family. Based on cloning and deep sequencing of endogenous miRNAs associated with Ago1-3, we do not find evidence for miRNA sorting in human cells. However, Ago identity appears to influence the length of some miRNAs, while others remain unaffected."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"9850 - 9862","author":[{"last_name":"Dueck","full_name":"Dueck, Anne","first_name":"Anne"},{"full_name":"Ziegler, Christian","last_name":"Ziegler","first_name":"Christian"},{"first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander","last_name":"Eichner"},{"full_name":"Berezikov, Eugène","last_name":"Berezikov","first_name":"Eugène"},{"full_name":"Meister, Gunter","last_name":"Meister","first_name":"Gunter"}],"oa_version":"Published Version","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"pubrep_id":"383","year":"2012","date_published":"2012-10-01T00:00:00Z","title":"MicroRNAs associated with the different human Argonaute proteins","license":"https://creativecommons.org/licenses/by-nc/4.0/","day":"01","publication":"Nucleic Acids Research","has_accepted_license":"1","scopus_import":1,"publication_status":"published","quality_controlled":"1","type":"journal_article","publisher":"Oxford University Press","month":"10","acknowledgement":"Deutsche Forschungsgemeinschaft (DFG) (SFB 960 and FOR855); European Research Council (ERC grant ‘sRNAs’); European Union (FP7 project ‘ONCOMIRs’); German Bundesministerium für Bildung und Forschung (BMBF, NGFN+, FKZ PIM-01GS0804-5); Bavarian Genome Research Network (BayGene to G.M.); The Netherlands Organization for Scientific Research (NWO, VIDI grant to E.B.). Funding for open access charge: DFG via the open access publishing program. \r\n\r\nWe thank Sigrun Ammon and Corinna Friederich for technical assistance and Sebastian Petri and Daniel Schraivogel for helpful discussions.","citation":{"apa":"Dueck, A., Ziegler, C., Eichner, A., Berezikov, E., &#38; Meister, G. (2012). MicroRNAs associated with the different human Argonaute proteins. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gks705\">https://doi.org/10.1093/nar/gks705</a>","ama":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. MicroRNAs associated with the different human Argonaute proteins. <i>Nucleic Acids Research</i>. 2012;40(19):9850-9862. doi:<a href=\"https://doi.org/10.1093/nar/gks705\">10.1093/nar/gks705</a>","ista":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. 2012. MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids Research. 40(19), 9850–9862.","chicago":"Dueck, Anne, Christian Ziegler, Alexander Eichner, Eugène Berezikov, and Gunter Meister. “MicroRNAs Associated with the Different Human Argonaute Proteins.” <i>Nucleic Acids Research</i>. Oxford University Press, 2012. <a href=\"https://doi.org/10.1093/nar/gks705\">https://doi.org/10.1093/nar/gks705</a>.","ieee":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, and G. Meister, “MicroRNAs associated with the different human Argonaute proteins,” <i>Nucleic Acids Research</i>, vol. 40, no. 19. Oxford University Press, pp. 9850–9862, 2012.","short":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids Research 40 (2012) 9850–9862.","mla":"Dueck, Anne, et al. “MicroRNAs Associated with the Different Human Argonaute Proteins.” <i>Nucleic Acids Research</i>, vol. 40, no. 19, Oxford University Press, 2012, pp. 9850–62, doi:<a href=\"https://doi.org/10.1093/nar/gks705\">10.1093/nar/gks705</a>."},"date_created":"2018-12-11T12:00:29Z","date_updated":"2021-01-12T07:39:57Z","publist_id":"3786","department":[{"_id":"MiSi"}],"intvolume":"        40","volume":40,"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:55Z","relation":"main_file","date_created":"2018-12-12T10:13:12Z","file_id":"4993","checksum":"1bb8d1ff894014b481657a21083c941c","content_type":"application/pdf","creator":"system","file_size":8126936,"file_name":"IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf"}],"doi":"10.1093/nar/gks705","issue":"19","_id":"2946"},{"_id":"2947","conference":{"start_date":"2012-10-03","location":"Thiruvananthapuram, India","name":" ATVA: Automated Technology for Verification and Analysis","end_date":"2012-10-06"},"volume":7561,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.4140"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1007/978-3-642-33386-6_30","date_updated":"2021-01-12T07:39:58Z","date_created":"2018-12-11T12:00:29Z","publist_id":"3785","department":[{"_id":"KrCh"}],"intvolume":"      7561","month":"06","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","citation":{"ieee":"K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the  ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.","short":"K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.","mla":"Chatterjee, Krishnendu, et al. <i>Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games</i>. Vol. 7561, Springer, 2012, pp. 385–99, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">10.1007/978-3-642-33386-6_30</a>.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">https://doi.org/10.1007/978-3-642-33386-6_30</a>.","ista":"Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games.  ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.","apa":"Chatterjee, K., Chmelik, M., &#38; Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the  ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">https://doi.org/10.1007/978-3-642-33386-6_30</a>","ama":"Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">10.1007/978-3-642-33386-6_30</a>"},"publication_status":"published","quality_controlled":"1","scopus_import":1,"type":"conference","publisher":"Springer","alternative_title":["LNCS"],"title":"Equivalence of games with probabilistic uncertainty and partial observation games","date_published":"2012-06-01T00:00:00Z","day":"01","year":"2012","ec_funded":1,"oa_version":"Preprint","status":"public","page":"385 - 399","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"abstract":[{"text":"We introduce games with probabilistic uncertainty, a model for controller synthesis in which the controller observes the state through imprecise sensors that provide correct information about the current state with a fixed probability. That is, in each step, the sensors return an observed state, and given the observed state, there is a probability distribution (due to the estimation error) over the actual current state. The controller must base its decision on the observed state (rather than the actual current state, which it does not know). On the other hand, we assume that the environment can perfectly observe the current state. We show that controller synthesis for qualitative ω-regular objectives in our model can be reduced in polynomial time to standard partial-observation stochastic games, and vice-versa. As a consequence we establish the precise decidability frontier for the new class of games, and establish optimal complexity results for all the decidable problems.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa":1},{"publication":"Biophysical Journal","date_published":"2012-10-03T00:00:00Z","title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","day":"03","publisher":"Biophysical","scopus_import":1,"publication_status":"published","quality_controlled":"1","type":"journal_article","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","citation":{"ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical Journal</i>, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439.","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical, 2012, pp. 1429–39, doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>.","chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>. Biophysical, 2012. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>.","ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38; Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. Biophysical. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>","ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439. doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>"},"month":"10","intvolume":"       103","date_created":"2018-12-11T12:00:32Z","date_updated":"2021-01-12T07:40:01Z","publist_id":"3774","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"doi":"10.1016/j.bpj.2012.08.039","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/"}],"volume":103,"_id":"2954","issue":"7","oa":1,"language":[{"iso":"eng"}],"pmid":1,"abstract":[{"lang":"eng","text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23062335"]},"page":"1429 - 1439","author":[{"last_name":"Pernia-Andrade","full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","first_name":"Alejandro"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","last_name":"Goswami","full_name":"Goswami, Sarit"},{"last_name":"Stickler","full_name":"Stickler, Yvonne","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1","first_name":"Yvonne"},{"last_name":"Fröbe","full_name":"Fröbe, Ulrich","first_name":"Ulrich"},{"last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"status":"public","oa_version":"Submitted Version","year":"2012"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"2211"},{"relation":"earlier_version","status":"public","id":"5381"}]},"oa_version":"Preprint","status":"public","ec_funded":1,"year":"2012","oa":1,"language":[{"iso":"eng"}],"article_number":"6280436","external_id":{"arxiv":["1107.2141"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and 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, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure 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. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive 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 result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"month":"08","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280436, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia, 2012.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>","ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436."},"acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","publist_id":"3771","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:00:32Z","date_updated":"2023-02-23T12:23:43Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"doi":"10.1109/LICS.2012.28","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"LICS: Logic in Computer Science","end_date":"2012-06-28","location":"Dubrovnik, Croatia","start_date":"2012-06-25"},"_id":"2955","day":"23","title":"Partial-observation stochastic games: How to win when belief fails","date_published":"2012-08-23T00:00:00Z","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","arxiv":1,"type":"conference","quality_controlled":"1","publication_status":"published","scopus_import":1,"publisher":"IEEE"},{"article_number":"6280437","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound."}],"external_id":{"arxiv":["1107.2091"]},"oa":1,"language":[{"iso":"eng"}],"ec_funded":1,"year":"2012","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5384"}]},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","full_name":"Tracol, Mathieu","last_name":"Tracol"}],"status":"public","oa_version":"Preprint","arxiv":1,"publisher":"IEEE","scopus_import":1,"quality_controlled":"1","type":"conference","publication_status":"published","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"23","title":"Decidable problems for probabilistic automata on infinite words","date_published":"2012-08-23T00:00:00Z","doi":"10.1109/LICS.2012.29","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1107.2091","open_access":"1"}],"conference":{"name":"LICS: Logic in Computer Science","end_date":"2012-06-28","start_date":"2012-06-25","location":"Dubrovnik, Croatia "},"_id":"2957","citation":{"ista":"Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.","apa":"Chatterjee, K., &#38; Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>","ama":"Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>","ieee":"K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280437, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>.","short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>."},"month":"08","department":[{"_id":"KrCh"}],"publist_id":"3769","date_updated":"2023-02-23T12:23:51Z","date_created":"2018-12-11T12:00:33Z"},{"pmid":1,"language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["23077060"]},"abstract":[{"lang":"eng","text":"The activity of hippocampal pyramidal cells reflects both the current position of the animal and information related to its current behavior. Here we investigated whether single hippocampal neurons can encode several independent features defining trials during a memory task. We also tested whether task-related information is represented by partial remapping of the place cell population or, instead, via firing rate modulation of spatially stable place cells. To address these two questions, the activity of hippocampal neurons was recorded in rats performing a conditional discrimination task on a modified T-maze in which the identity of a food reward guided behavior. When the rat was on the central arm of the maze, the firing rate of pyramidal cells changed depending on two independent factors: (1) the identity of the food reward given to the animal and (2) the previous location of the animal on the maze. Importantly, some pyramidal cells encoded information relative to both factors. This trial-type specific and retrospective coding did not interfere with the spatial representation of the maze: hippocampal cells had stable place fields and their theta-phase precession profiles were unaltered during the task, indicating that trial-related information was encoded via rate remapping. During error trials, encoding of both trial-related information and spatial location was impaired. Finally, we found that pyramidal cells also encode trial-related information via rate remapping during the continuous version of the rewarded alternation task without delays. These results suggest that hippocampal neurons can encode several task-related cognitive aspects via rate remapping."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","status":"public","page":"14752 - 14766","author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"first_name":"J Nick","last_name":"Rawlins","full_name":"Rawlins, J Nick"},{"last_name":"Bannerman","full_name":"Bannerman, David","first_name":"David"},{"full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"year":"2012","ec_funded":1,"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","date_published":"2012-10-17T00:00:00Z","day":"17","publication":"Journal of Neuroscience","scopus_import":1,"quality_controlled":"1","type":"journal_article","publication_status":"published","publisher":"Society for Neuroscience","date_created":"2018-12-11T12:00:33Z","date_updated":"2021-01-12T07:40:03Z","publist_id":"3768","department":[{"_id":"JoCs"}],"intvolume":"        32","month":"10","acknowledgement":"J.C. was supported by a MRC Intramural Programme Grant (U138197111) and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers. D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).","citation":{"ista":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 32(42), 14752–14766.","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. 2012;32(42):14752-14766. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>","apa":"Allen, K., Rawlins, J. N., Bannerman, D., &#38; Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>.","short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” <i>Journal of Neuroscience</i>, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>."},"issue":"42","_id":"2958","volume":32,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/"}],"project":[{"_id":"257A4776-B435-11E9-9278-68D0E5697425","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","grant_number":"281511","call_identifier":"FP7"}],"doi":"10.1523/JNEUROSCI.6175-11.2012"}]