[{"doi":"10.1111/tpj.12369","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/tpj.12369"}],"scopus_import":1,"article_type":"original","publication_identifier":{"issn":["09607412"]},"publication_status":"published","title":"Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth","oa_version":"Published Version","article_processing_charge":"No","year":"2014","citation":{"ama":"Bailly A, Wang B, Zwiewka M, et al. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. <i>Plant Journal</i>. 2014;77(1):108-118. doi:<a href=\"https://doi.org/10.1111/tpj.12369\">10.1111/tpj.12369</a>","ieee":"A. Bailly <i>et al.</i>, “Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth,” <i>Plant Journal</i>, vol. 77, no. 1. Wiley-Blackwell, pp. 108–118, 2014.","ista":"Bailly A, Wang B, Zwiewka M, Pollmann S, Schenck D, Lüthen H, Schulz A, Friml J, Geisler M. 2014. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. Plant Journal. 77(1), 108–118.","mla":"Bailly, Aurélien, et al. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” <i>Plant Journal</i>, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 108–18, doi:<a href=\"https://doi.org/10.1111/tpj.12369\">10.1111/tpj.12369</a>.","chicago":"Bailly, Aurélien, Bangjun Wang, Marta Zwiewka, Stephan Pollmann, Daniel Schenck, Hartwig Lüthen, Alexander Schulz, Jiří Friml, and Markus Geisler. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” <i>Plant Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1111/tpj.12369\">https://doi.org/10.1111/tpj.12369</a>.","short":"A. Bailly, B. Wang, M. Zwiewka, S. Pollmann, D. Schenck, H. Lüthen, A. Schulz, J. Friml, M. Geisler, Plant Journal 77 (2014) 108–118.","apa":"Bailly, A., Wang, B., Zwiewka, M., Pollmann, S., Schenck, D., Lüthen, H., … Geisler, M. (2014). Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/tpj.12369\">https://doi.org/10.1111/tpj.12369</a>"},"abstract":[{"lang":"eng","text":"Plant growth is achieved predominantly by cellular elongation, which is thought to be controlled on several levels by apoplastic auxin. Auxin export into the apoplast is achieved by plasma membrane efflux catalysts of the PIN-FORMED (PIN) and ATP-binding cassette protein subfamily B/phosphor- glycoprotein (ABCB/PGP) classes; the latter were shown to depend on interaction with the FKBP42, TWISTED DWARF1 (TWD1). Here by using a transgenic approach in combination with phenotypical, biochemical and cell biological analyses we demonstrate the importance of a putative C-terminal in-plane membrane anchor of TWD1 in the regulation of ABCB-mediated auxin transport. In contrast with dwarfed twd1 loss-of-function alleles, TWD1 gain-of-function lines that lack a putative in-plane membrane anchor (HA-TWD1-Ct) show hypermorphic plant architecture, characterized by enhanced stem length and leaf surface but reduced shoot branching. Greater hypocotyl length is the result of enhanced cell elongation that correlates with reduced polar auxin transport capacity for HA-TWD1-Ct. As a consequence, HA-TWD1-Ct displays higher hypocotyl auxin accumulation, which is shown to result in elevated auxin-induced cell elongation rates. Our data highlight the importance of C-terminal membrane anchoring for TWD1 action, which is required for specific regulation of ABCB-mediated auxin transport. These data support a model in which TWD1 controls lateral ABCB1-mediated export into the apoplast, which is required for auxin-mediated cell elongation."}],"_id":"2253","date_created":"2018-12-11T11:56:35Z","author":[{"full_name":"Bailly, Aurélien","last_name":"Bailly","first_name":"Aurélien"},{"first_name":"Bangjun","last_name":"Wang","full_name":"Wang, Bangjun"},{"first_name":"Marta","last_name":"Zwiewka","full_name":"Zwiewka, Marta"},{"full_name":"Pollmann, Stephan","last_name":"Pollmann","first_name":"Stephan"},{"full_name":"Schenck, Daniel","first_name":"Daniel","last_name":"Schenck"},{"last_name":"Lüthen","first_name":"Hartwig","full_name":"Lüthen, Hartwig"},{"first_name":"Alexander","last_name":"Schulz","full_name":"Schulz, Alexander"},{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí"},{"full_name":"Geisler, Markus","last_name":"Geisler","first_name":"Markus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":77,"intvolume":"        77","department":[{"_id":"JiFr"}],"publication":"Plant Journal","date_updated":"2021-01-12T06:56:18Z","page":"108 - 118","day":"01","quality_controlled":"1","issue":"1","project":[{"_id":"256BDAB0-B435-11E9-9278-68D0E5697425","name":"Innovationsförderung in der Grenzregion Österreich – Tschechische Republik durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur"}],"publisher":"Wiley-Blackwell","date_published":"2014-01-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"month":"01","status":"public","publist_id":"4694"},{"abstract":[{"lang":"eng","text":"Theta-gamma network oscillations are thought to represent key reference signals for information processing in neuronal ensembles, but the underlying synaptic mechanisms remain unclear. To address this question, we performed whole-cell (WC) patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials at low frequency, consistent with sparse coding in the dentate gyrus. GCs were exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs), primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents (IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence with the field potential predominantly in the theta frequency band, whereas IPSCs showed coherence primarily in the gamma range. Action potentials in GCs were phase locked to network oscillations. Thus, theta-gamma-modulated synaptic currents may provide a framework for sparse temporal coding of information in the dentate gyrus."}],"year":"2014","citation":{"mla":"Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>.","short":"A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.","chicago":"Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>.","apa":"Pernia-Andrade, A., &#38; Jonas, P. M. (2014). Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>","ieee":"A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations,” <i>Neuron</i>, vol. 81, no. 1. Elsevier, pp. 140–152, 2014.","ista":"Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. 81(1), 140–152.","ama":"Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. 2014;81(1):140-152. doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>"},"_id":"2254","date_created":"2018-12-11T11:56:35Z","file":[{"content_type":"application/pdf","file_id":"4773","creator":"system","checksum":"438547cfcd9045a22f065f2019f07849","access_level":"open_access","file_name":"IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf","date_updated":"2020-07-14T12:45:35Z","file_size":4373072,"date_created":"2018-12-12T10:09:48Z","relation":"main_file"}],"publication_identifier":{"issn":["08966273"]},"doi":"10.1016/j.neuron.2013.09.046","scopus_import":1,"file_date_updated":"2020-07-14T12:45:35Z","oa_version":"Published Version","publication_status":"published","title":"Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations","intvolume":"        81","publication":"Neuron","ec_funded":1,"date_updated":"2021-01-12T06:56:19Z","department":[{"_id":"PeJo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade","first_name":"Alejandro"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas"}],"oa":1,"volume":81,"pubrep_id":"422","project":[{"call_identifier":"FP7","grant_number":"268548","_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons"},{"call_identifier":"FWF","grant_number":"P24909-B24","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","name":"Mechanisms of transmitter release at GABAergic synapses"}],"has_accepted_license":"1","issue":"1","day":"08","page":"140 - 152","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["570"],"status":"public","publist_id":"4692","month":"01","publisher":"Elsevier","date_published":"2014-01-08T00:00:00Z","type":"journal_article"},{"citation":{"ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. 2014;50(1):164-177. doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1. Springer, pp. 164–177, 2014.","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>.","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","apa":"Edelsbrunner, H., &#38; Pausinger, F. (2014). Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>"},"year":"2014","abstract":[{"lang":"eng","text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm."}],"date_created":"2018-12-11T11:56:36Z","file":[{"date_updated":"2020-07-14T12:45:35Z","date_created":"2018-12-12T10:16:18Z","file_size":3941391,"relation":"main_file","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","access_level":"open_access","checksum":"2f93f3e63a38a85cd4404d7953913b14","creator":"system","file_id":"5204","content_type":"application/pdf"}],"_id":"2255","scopus_import":1,"doi":"10.1007/s10851-013-0468-x","publication_identifier":{"issn":["09249907"]},"publication_status":"published","title":"Stable length estimates of tube-like shapes","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:35Z","intvolume":"        50","department":[{"_id":"HeEd"}],"date_updated":"2023-09-07T11:41:25Z","ec_funded":1,"publication":"Journal of Mathematical Imaging and Vision","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","first_name":"Florian","last_name":"Pausinger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":50,"related_material":{"record":[{"id":"2843","status":"public","relation":"earlier_version"},{"id":"1399","relation":"dissertation_contains","status":"public"}]},"oa":1,"pubrep_id":"549","issue":"1","project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493"}],"has_accepted_license":"1","page":"164 - 177","day":"01","quality_controlled":"1","ddc":["000"],"language":[{"iso":"eng"}],"month":"09","publist_id":"4691","status":"public","publisher":"Springer","type":"journal_article","date_published":"2014-09-01T00:00:00Z"},{"main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/436","open_access":"1"}],"doi":"10.1371/journal.pcbi.1003408","scopus_import":1,"publication_identifier":{"issn":["1553734X"]},"acknowledgement":"\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508, the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation, ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES: ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651.","title":"Searching for collective behavior in a large network of sensory neurons","publication_status":"published","file_date_updated":"2020-07-14T12:45:35Z","oa_version":"Published Version","article_number":"e1003408","year":"2014","citation":{"ieee":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching for collective behavior in a large network of sensory neurons,” <i>PLoS Computational Biology</i>, vol. 10, no. 1. Public Library of Science, 2014.","ista":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 10(1), e1003408.","ama":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>","mla":"Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>, vol. 10, no. 1, e1003408, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>.","chicago":"Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>.","short":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014).","apa":"Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., &#38; Berry, M. (2014). Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>"},"abstract":[{"lang":"eng","text":"Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population's capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction."}],"_id":"2257","file":[{"content_type":"application/pdf","file_id":"4965","creator":"system","checksum":"c720222c5e924a4acb17f23b9381a6ca","access_level":"open_access","file_name":"IST-2016-436-v1+1_journal.pcbi.1003408.pdf","date_created":"2018-12-12T10:12:46Z","file_size":2194790,"date_updated":"2020-07-14T12:45:35Z","relation":"main_file"}],"date_created":"2018-12-11T11:56:36Z","author":[{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Amodei, Dario","last_name":"Amodei","first_name":"Dario"},{"last_name":"Schneidman","first_name":"Elad","full_name":"Schneidman, Elad"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"5562","status":"public","relation":"popular_science"}]},"oa":1,"volume":10,"intvolume":"        10","department":[{"_id":"GaTk"}],"publication":"PLoS Computational Biology","date_updated":"2024-02-21T13:46:14Z","day":"02","quality_controlled":"1","pubrep_id":"436","issue":"1","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"publisher":"Public Library of Science","date_published":"2014-01-02T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"ddc":["570"],"month":"01","status":"public","publist_id":"4689"},{"volume":42,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Zhu","first_name":"Fangfang","full_name":"Zhu, Fangfang"},{"last_name":"Gamboa","first_name":"Matthew","full_name":"Gamboa, Matthew"},{"full_name":"Farruggio, Alfonso","first_name":"Alfonso","last_name":"Farruggio"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"},{"last_name":"Tasic","first_name":"Bosiljka","full_name":"Tasic, Bosiljka"},{"first_name":"Birgitt","last_name":"Schüle","full_name":"Schüle, Birgitt"},{"full_name":"Chen Tsai, Yanru","last_name":"Chen Tsai","first_name":"Yanru"},{"last_name":"Calos","first_name":"Michele","full_name":"Calos, Michele"}],"date_updated":"2021-01-12T06:56:22Z","publication":"Nucleic Acids Research","department":[{"_id":"SiHi"}],"intvolume":"        42","oa_version":"Preprint","file_date_updated":"2020-07-14T12:45:35Z","title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","publication_status":"published","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","scopus_import":1,"doi":"10.1093/nar/gkt1290","date_created":"2018-12-11T11:56:38Z","file":[{"checksum":"e9268f5f96a820f04d7ebbf85927c3cb","content_type":"application/pdf","creator":"system","file_id":"4738","relation":"main_file","date_updated":"2020-07-14T12:45:35Z","file_size":11044478,"date_created":"2018-12-12T10:09:15Z","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","access_level":"open_access"}],"_id":"2261","abstract":[{"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.","lang":"eng"}],"citation":{"mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>.","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. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>","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.” <i>Nucleic Acids Research</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>.","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","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.","ieee":"F. Zhu <i>et al.</i>, “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” <i>Nucleic Acids Research</i>, vol. 42, no. 5. Oxford University Press, 2014.","ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. 2014;42(5). doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>"},"year":"2014","article_number":"e34","type":"journal_article","date_published":"2014-03-05T00:00:00Z","publisher":"Oxford University Press","publist_id":"4684","status":"public","month":"03","ddc":["571","610"],"language":[{"iso":"eng"}],"quality_controlled":"1","day":"05","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"issue":"5","pubrep_id":"961"},{"day":"01","page":"1 - 24","doi":"10.1007/978-94-007-7687-6_1","scopus_import":1,"oa_version":"None","quality_controlled":"1","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","publication_status":"published","abstract":[{"lang":"eng","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."}],"year":"2014","citation":{"mla":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” <i> Cellular and Molecular Control of Neuronal Migration</i>, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">10.1007/978-94-007-7687-6_1</a>.","chicago":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In <i> Cellular and Molecular Control of Neuronal Migration</i>, edited by Laurent Nguyen, 800:1–24. Springer, 2014. <a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">https://doi.org/10.1007/978-94-007-7687-6_1</a>.","short":"S. Hippenmeyer, in:, L. Nguyen (Ed.),  Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24.","apa":"Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), <i> Cellular and Molecular Control of Neuronal Migration</i> (Vol. 800, pp. 1–24). Springer. <a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">https://doi.org/10.1007/978-94-007-7687-6_1</a>","ieee":"S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in <i> Cellular and Molecular Control of Neuronal Migration</i>, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.","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.","ama":"Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. <i> Cellular and Molecular Control of Neuronal Migration</i>. Vol 800. Springer; 2014:1-24. doi:<a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">10.1007/978-94-007-7687-6_1</a>"},"_id":"2265","date_created":"2018-12-11T11:56:39Z","editor":[{"last_name":"Nguyen","first_name":"Laurent","full_name":"Nguyen, Laurent"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","author":[{"last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"volume":800,"date_published":"2014-01-01T00:00:00Z","type":"book_chapter","alternative_title":["Advances in Experimental Medicine and Biology"],"intvolume":"       800","language":[{"iso":"eng"}],"publication":" Cellular and Molecular Control of Neuronal Migration","status":"public","date_updated":"2021-01-12T06:56:23Z","publist_id":"4679","month":"01","department":[{"_id":"SiHi"}]},{"has_accepted_license":"1","pubrep_id":"566","quality_controlled":"1","page":"2936 - 2943","day":"03","month":"03","publist_id":"4669","status":"public","ddc":["000"],"language":[{"iso":"eng"}],"type":"conference","date_published":"2014-03-03T00:00:00Z","publisher":"IEEE","conference":{"name":"ICCV: International Conference on Computer Vision","location":"Sydney, Australia","end_date":"2013-12-08","start_date":"2013-12-01"},"date_created":"2018-12-11T11:56:42Z","file":[{"file_size":378601,"relation":"main_file","date_created":"2018-12-12T10:09:30Z","date_updated":"2020-07-14T12:45:36Z","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf","access_level":"open_access","checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","content_type":"application/pdf","creator":"system","file_id":"4754"}],"_id":"2275","citation":{"short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.","chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>.","apa":"Olsson, C., Ulen, J., Boykov, Y., &#38; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>","mla":"Olsson, Carl, et al. <i>Partial Enumeration and Curvature Regularization</i>. IEEE, 2014, pp. 2936–43, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>","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.","ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943."},"year":"2014","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"}],"title":"Partial enumeration and curvature regularization","publication_status":"published","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:36Z","scopus_import":1,"doi":"10.1109/ICCV.2013.365","department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T06:56:28Z","oa":1,"author":[{"full_name":"Olsson, Carl","last_name":"Olsson","first_name":"Carl"},{"first_name":"Johannes","last_name":"Ulen","full_name":"Ulen, Johannes"},{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":104,"oa":1,"author":[{"full_name":"Guo, Yujin","last_name":"Guo","first_name":"Yujin"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"date_updated":"2024-02-14T12:19:42Z","publication":"Letters in Mathematical Physics","arxiv":1,"intvolume":"       104","publication_status":"published","title":"On the mass concentration for Bose-Einstein condensates with attractive interactions","oa_version":"Preprint","article_processing_charge":"No","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1301.5682","open_access":"1"}],"doi":"10.1007/s11005-013-0667-9","article_type":"original","date_created":"2018-12-11T11:56:44Z","_id":"2281","citation":{"ista":"Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156.","ieee":"Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2. Springer, pp. 141–156, 2014.","ama":"Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. 2014;104(2):141-156. doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>","short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","chicago":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>.","apa":"Guo, Y., &#38; Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>","mla":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>."},"year":"2014","abstract":[{"lang":"eng","text":"We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential."}],"type":"journal_article","date_published":"2014-02-01T00:00:00Z","external_id":{"arxiv":["1301.5682"]},"publisher":"Springer","month":"02","publist_id":"4653","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","page":"141 - 156","day":"01","issue":"2"},{"quality_controlled":"1","page":"189 - 203","day":"01","issue":"2","has_accepted_license":"1","license":"https://creativecommons.org/licenses/by-nc/4.0/","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","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"pubrep_id":"461","type":"journal_article","date_published":"2014-02-01T00:00:00Z","publisher":"Wiley-Blackwell","month":"02","publist_id":"4646","status":"public","ddc":["570"],"language":[{"iso":"eng"}],"publication_status":"published","title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:37Z","scopus_import":1,"doi":"10.1002/hipo.22214","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.","date_created":"2018-12-11T11:56:46Z","file":[{"content_type":"application/pdf","creator":"system","file_id":"5178","checksum":"ff6bc75a79dbc985a2e31b79253e6444","access_level":"open_access","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","file_size":801589,"relation":"main_file","date_created":"2018-12-12T10:15:54Z","date_updated":"2020-07-14T12:45:37Z"}],"_id":"2285","citation":{"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.” <i>Hippocampus</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>.","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &#38; Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203.","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>.","ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. 2014;23(2):189-203. doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>","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 <i>et al.</i>, “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” <i>Hippocampus</i>, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014."},"year":"2014","abstract":[{"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.","lang":"eng"}],"volume":23,"oa":1,"author":[{"full_name":"Hosp, Jonas","last_name":"Hosp","first_name":"Jonas"},{"last_name":"Strüber","first_name":"Michael","full_name":"Strüber, Michael"},{"first_name":"Yuchio","last_name":"Yanagawa","full_name":"Yanagawa, Yuchio"},{"full_name":"Obata, Kunihiko","last_name":"Obata","first_name":"Kunihiko"},{"full_name":"Vida, Imre","last_name":"Vida","first_name":"Imre"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas"},{"first_name":"Marlene","last_name":"Bartos","full_name":"Bartos, Marlene"}],"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"PeJo"}],"date_updated":"2021-01-12T06:56:32Z","publication":"Hippocampus","intvolume":"        23"},{"date_published":"2014-04-01T00:00:00Z","type":"journal_article","oa":1,"volume":163,"publisher":"Duke University Press","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"},{"first_name":"Paul","last_name":"Bourgade","full_name":"Bourgade, Paul"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"}],"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","month":"04","department":[{"_id":"LaEr"}],"status":"public","publication":"Duke Mathematical Journal","date_updated":"2021-01-12T06:59:07Z","publist_id":"4197","language":[{"iso":"eng"}],"intvolume":"       163","title":"Universality of general β-ensembles","quality_controlled":"1","publication_status":"published","oa_version":"Preprint","page":"1127 - 1190","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2272"}],"doi":"10.1215/00127094-2649752","scopus_import":1,"day":"01","issue":"6","_id":"2699","date_created":"2018-12-11T11:59:08Z","year":"2014","citation":{"ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. 2014;163(6):1127-1190. doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190.","ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” <i>Duke Mathematical Journal</i>, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>.","apa":"Erdös, L., Bourgade, P., &#38; Yau, H. (2014). Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>","short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>. Duke University Press, 2014. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>."},"abstract":[{"lang":"eng","text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β &gt;\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles."}]},{"publist_id":"4176","status":"public","month":"06","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2014-06-01T00:00:00Z","external_id":{"arxiv":["1201.5073"]},"publisher":"Springer","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"}],"issue":"3-4","quality_controlled":"1","day":"01","page":"129 - 163","date_updated":"2023-02-21T16:06:56Z","publication":"Acta Informatica","department":[{"_id":"KrCh"}],"intvolume":"        51","arxiv":1,"volume":51,"oa":1,"related_material":{"record":[{"id":"10904","relation":"earlier_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"date_created":"2018-12-11T11:59:14Z","_id":"2716","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"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. 2014;51(3-4):129-163. doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>","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,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 129–163, 2014."},"year":"2014","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","title":"Strategy synthesis for multi-dimensional quantitative objectives","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. ","article_type":"original","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"doi":"10.1007/s00236-013-0182-6"},{"author":[{"full_name":"Fischlin, Marc","first_name":"Marc","last_name":"Fischlin"},{"full_name":"Lehmann, Anja","first_name":"Anja","last_name":"Lehmann"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"publisher":"Springer","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_published":"2014-07-01T00:00:00Z","volume":27,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3225"}]},"language":[{"iso":"eng"}],"intvolume":"        27","department":[{"_id":"KrPi"}],"month":"07","publist_id":"3940","date_updated":"2023-02-23T11:17:53Z","status":"public","publication":"Journal of Cryptology","scopus_import":1,"page":"397 - 428","doi":"10.1007/s00145-013-9148-7","day":"01","quality_controlled":"1","publication_status":"published","title":"Robust multi-property combiners for hash functions","oa_version":"None","citation":{"mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>.","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","apa":"Fischlin, M., Lehmann, A., &#38; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>.","ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. 2014;27(3):397-428. doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>","ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” <i>Journal of Cryptology</i>, vol. 27, no. 3. Springer, pp. 397–428, 2014.","ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428."},"year":"2014","abstract":[{"lang":"eng","text":"A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length."}],"issue":"3","date_created":"2018-12-11T11:59:56Z","_id":"2852"},{"file":[{"relation":"main_file","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:16:43Z","file_size":435320,"file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","access_level":"open_access","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","content_type":"application/pdf","creator":"system","file_id":"5232"}],"date_created":"2018-12-11T12:00:16Z","_id":"2905","conference":{"end_date":"2012-07-07","name":"ECM: European Congress of Mathematics","location":"Kraków, Poland","start_date":"2012-07-02"},"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"}],"citation":{"ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","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. <i>Persistent Homology: Theory and Practice</i>. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","apa":"Edelsbrunner, H., &#38; 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. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>","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. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>."},"year":"2014","oa_version":"Submitted Version","article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:52Z","publication_status":"published","title":"Persistent homology: Theory and practice","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.","doi":"10.4171/120-1/3","date_updated":"2021-01-12T07:00:36Z","department":[{"_id":"HeEd"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Morozovy, Dmitriy","first_name":"Dmitriy","last_name":"Morozovy"}],"has_accepted_license":"1","pubrep_id":"544","quality_controlled":"1","day":"01","page":"31 - 50","publist_id":"3842","status":"public","month":"01","ddc":["000"],"language":[{"iso":"eng"}],"type":"conference","date_published":"2014-01-01T00:00:00Z","publisher":"European Mathematical Society Publishing House"},{"date_published":"2014-01-21T00:00:00Z","type":"journal_article","publisher":"Public Library of Science","status":"public","publist_id":"3385","month":"01","language":[{"iso":"eng"}],"ddc":["570"],"quality_controlled":"1","day":"21","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","issue":"1","pubrep_id":"432","oa":1,"volume":9,"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper"},{"first_name":"Anandamohan","last_name":"Ghosh","full_name":"Ghosh, Anandamohan"},{"full_name":"Schneidman, Elad","first_name":"Elad","last_name":"Schneidman"},{"last_name":"Segev","first_name":"Ronen","full_name":"Segev, Ronen"}],"publication":"PLoS One","date_updated":"2021-01-12T07:42:14Z","department":[{"_id":"GaTk"}],"intvolume":"         9","file_date_updated":"2020-07-14T12:46:06Z","oa_version":"Published Version","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","publication_status":"published","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","doi":"10.1371/journal.pone.0085841","scopus_import":1,"_id":"3263","file":[{"content_type":"application/pdf","creator":"system","file_id":"5011","checksum":"1d5816b343abe5eadc3eb419bcece971","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","access_level":"open_access","date_created":"2018-12-12T10:13:28Z","file_size":1568524,"date_updated":"2020-07-14T12:46:06Z","relation":"main_file"}],"date_created":"2018-12-11T12:02:20Z","abstract":[{"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.","lang":"eng"}],"article_number":"e85841","year":"2014","citation":{"mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).","apa":"Tkačik, G., Ghosh, A., Schneidman, E., &#38; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","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."}},{"year":"2014","citation":{"mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>.","apa":"Aminof, B., &#38; Rubin, S. (2014). First cycle games. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 146:83–90. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","ieee":"B. Aminof and S. Rubin, “First cycle games,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Grenoble, France, 2014, vol. 146, pp. 83–90.","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","ama":"Aminof B, Rubin S. First cycle games. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 146. Open Publishing Association; 2014:83-90. doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>"},"abstract":[{"text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. ","lang":"eng"}],"conference":{"location":"Grenoble, France","name":"SR: Strategic Reasoning","end_date":"2014-04-06","start_date":"2014-04-05"},"_id":"475","date_created":"2018-12-11T11:46:41Z","file":[{"relation":"main_file","file_size":100115,"date_created":"2018-12-12T10:17:08Z","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","checksum":"4d7b4ab82980cca2b96ac7703992a8c8","creator":"system","file_id":"5260","content_type":"application/pdf"}],"doi":"10.4204/EPTCS.146.11","scopus_import":1,"title":"First cycle games","publication_status":"published","file_date_updated":"2020-07-14T12:46:35Z","oa_version":"Published Version","intvolume":"       146","department":[{"_id":"KrCh"}],"publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","ec_funded":1,"date_updated":"2021-01-12T08:00:53Z","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin","first_name":"Benjamin","last_name":"Aminof"},{"first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":146,"pubrep_id":"952","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","page":"83 - 90","day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["004"],"alternative_title":["EPTCS"],"month":"04","status":"public","publist_id":"7345","publisher":"Open Publishing Association","date_published":"2014-04-01T00:00:00Z","type":"conference"},{"day":"01","page":"457 - 492","quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"issue":"3","publisher":"Springer","type":"journal_article","date_published":"2014-11-01T00:00:00Z","external_id":{"arxiv":["1604.08234"]},"language":[{"iso":"eng"}],"publist_id":"7282","status":"public","month":"11","article_type":"original","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"doi":"10.1007/s00453-013-9843-7","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","title":"Polynomial-time algorithms for energy games with special weight structures","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. 2014;70(3):457-492. doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>","ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” <i>Algorithmica</i>, vol. 70, no. 3. Springer, pp. 457–492, 2014."},"year":"2014","date_created":"2018-12-11T11:47:01Z","_id":"535","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"volume":70,"oa":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10905"}]},"intvolume":"        70","arxiv":1,"ec_funded":1,"date_updated":"2023-09-05T14:09:29Z","publication":"Algorithmica","department":[{"_id":"KrCh"}]},{"citation":{"ama":"Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. 2014;4(15):3139-3145. doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>","ista":"Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145.","ieee":"R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” <i>Ecology and Evolution</i>, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.","chicago":"Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>.","short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.","apa":"Prizak, R., Ezard, T., &#38; Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>","mla":"Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>."},"year":"2014","abstract":[{"lang":"eng","text":"Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring."}],"date_created":"2018-12-11T11:47:02Z","file":[{"file_id":"4886","creator":"system","content_type":"application/pdf","checksum":"e32abf75a248e7a11811fd7f60858769","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf","access_level":"open_access","relation":"main_file","file_size":621582,"date_created":"2018-12-12T10:11:31Z","date_updated":"2020-07-14T12:46:38Z"}],"_id":"537","scopus_import":1,"doi":"10.1002/ece3.1150","publication_status":"published","title":"Fitness consequences of maternal and grandmaternal effects","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:38Z","intvolume":"         4","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"date_updated":"2021-01-12T08:01:30Z","publication":"Ecology and Evolution","author":[{"id":"4456104E-F248-11E8-B48F-1D18A9856A87","full_name":"Prizak, Roshan","first_name":"Roshan","last_name":"Prizak"},{"full_name":"Ezard, Thomas","last_name":"Ezard","first_name":"Thomas"},{"full_name":"Hoyle, Rebecca","first_name":"Rebecca","last_name":"Hoyle"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":4,"oa":1,"pubrep_id":"934","issue":"15","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"page":"3139 - 3145","day":"19","ddc":["530","571"],"language":[{"iso":"eng"}],"month":"07","publist_id":"7280","status":"public","publisher":"Wiley-Blackwell","type":"journal_article","date_published":"2014-07-19T00:00:00Z"},{"abstract":[{"text":"As sessile organisms, plants have to be able to adapt to a continuously changing environment. Plants that perceive some of these changes as stress signals activate signaling pathways to modulate their development and to enable them to survive. The complex responses to environmental cues are to a large extent mediated by plant hormones that together orchestrate the final plant response. The phytohormone cytokinin is involved in many plant developmental processes. Recently, it has been established that cytokinin plays an important role in stress responses, but does not act alone. Indeed, the hormonal control of plant development and stress adaptation is the outcome of a complex network of multiple synergistic and antagonistic interactions between various hormones. Here, we review the recent findings on the cytokinin function as part of this hormonal network. We focus on the importance of the crosstalk between cytokinin and other hormones, such as abscisic acid, jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development and stress adaptation. Finally, the impact of the current research in the biotechnological industry will be discussed.","lang":"eng"}],"citation":{"ieee":"J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic stress responses,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","ista":"O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic stress responses. Frontiers in Plant Science. 4, 451.","ama":"O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>","mla":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>, vol. 4, 451, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>.","apa":"O’Brien, J., &#38; Benková, E. (2013). Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>","short":"J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).","chicago":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>."},"article_number":"451","year":"2013","file":[{"checksum":"fdc25ddd1bf9a99b99f662cdbafeddd4","content_type":"application/pdf","file_id":"5903","creator":"dernst","file_size":953299,"relation":"main_file","date_updated":"2020-07-14T12:48:11Z","date_created":"2019-01-31T10:40:38Z","access_level":"open_access","file_name":"2013_FrontiersPlant_OBrien.pdf"}],"date_created":"2018-12-11T11:48:43Z","_id":"827","scopus_import":1,"doi":"10.3389/fpls.2013.00451","oa_version":"Published Version","file_date_updated":"2020-07-14T12:48:11Z","title":"Cytokinin cross talking during biotic and abiotic stress responses","publication_status":"published","intvolume":"         4","date_updated":"2021-01-12T08:17:50Z","ec_funded":1,"publication":"Frontiers in Plant Science","department":[{"_id":"EvBe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"O'Brien","first_name":"José","full_name":"O'Brien, José"},{"full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"}],"volume":4,"oa":1,"project":[{"call_identifier":"FP7","grant_number":"207362","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","name":"Hormonal cross-talk in plant organogenesis"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","day":"19","quality_controlled":"1","ddc":["580"],"language":[{"iso":"eng"}],"publist_id":"6821","status":"public","month":"11","publisher":"Frontiers Research Foundation","type":"journal_article","date_published":"2013-11-19T00:00:00Z"},{"publisher":"Frontiers Research Foundation","date_published":"2013-12-26T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"ddc":["580"],"status":"public","publist_id":"6820","month":"12","day":"26","quality_controlled":"1","project":[{"name":"Hormonal cross-talk in plant organogenesis","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"207362"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Cuesta, Candela","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1923-2410","last_name":"Cuesta","first_name":"Candela"},{"full_name":"Wabnik, Krzysztof T","orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","last_name":"Wabnik","first_name":"Krzysztof T"},{"last_name":"Benková","first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"volume":4,"intvolume":"         4","publication":"Frontiers in Plant Science","ec_funded":1,"date_updated":"2021-01-12T08:17:52Z","department":[{"_id":"EvBe"}],"doi":"10.3389/fpls.2013.00537","scopus_import":1,"file_date_updated":"2020-07-14T12:48:11Z","oa_version":"Published Version","title":"Systems approaches to study root architecture dynamics","publication_status":"published","abstract":[{"lang":"eng","text":"The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation. Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how LRs and thereby root system architecture is established and developed."}],"year":"2013","article_number":"537","citation":{"short":"C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).","chicago":"Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>.","apa":"Cuesta, C., Wabnik, K. T., &#38; Benková, E. (2013). Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>","mla":"Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>, vol. 4, 537, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>.","ama":"Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>","ista":"Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture dynamics. Frontiers in Plant Science. 4, 537.","ieee":"C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root architecture dynamics,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013."},"_id":"828","file":[{"file_name":"2013_FrontiersPlant_Cuesta.pdf","access_level":"open_access","date_created":"2019-01-31T10:36:43Z","relation":"main_file","date_updated":"2020-07-14T12:48:11Z","file_size":710835,"creator":"dernst","file_id":"5902","content_type":"application/pdf","checksum":"0185b3c4d7df9a94bd3ce5a66d213506"}],"date_created":"2018-12-11T11:48:43Z"},{"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"101 - 106","day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"month":"01","status":"public","publist_id":"5077","publisher":"Springer","external_id":{"arxiv":["1303.5251"]},"date_published":"2013-01-01T00:00:00Z","type":"conference","year":"2013","citation":{"ieee":"J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.","ista":"Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.","ama":"Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression. In: <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>. Vol 8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>","mla":"Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, vol. 8044, Springer, 2013, pp. 101–06, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>.","apa":"Reiter, J., Božić, I., Chatterjee, K., &#38; Nowak, M. (2013). TTP: Tool for tumor progression. In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i> (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>","short":"J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.","chicago":"Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.” In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>."},"abstract":[{"lang":"eng","text":"In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics."}],"conference":{"name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia","end_date":"2013-07-19","start_date":"2013-07-13"},"_id":"2000","date_created":"2018-12-11T11:55:08Z","doi":"10.1007/978-3-642-39799-8_6","main_file_link":[{"url":"https://arxiv.org/abs/1303.5251","open_access":"1"}],"scopus_import":1,"publication_status":"published","title":"TTP: Tool for tumor progression","oa_version":"Preprint","arxiv":1,"intvolume":"      8044","department":[{"_id":"KrCh"}],"publication":"Proceedings of 25th Int. Conf. on Computer Aided Verification","ec_funded":1,"date_updated":"2023-09-07T11:40:43Z","author":[{"first_name":"Johannes","last_name":"Reiter","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes"},{"full_name":"Božić, Ivana","first_name":"Ivana","last_name":"Božić"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"Lecture Notes in Computer Science","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5399"},{"relation":"dissertation_contains","status":"public","id":"1400"}]},"oa":1,"volume":8044}]