[{"publication_identifier":{"issn":["1742-5468"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.4516"}],"intvolume":"      2014","isi":1,"author":[{"last_name":"Song","full_name":"Song, Baofang","id":"a79e57f5-e8a5-11ec-9dc9-83fb8c81cf72","first_name":"Baofang"},{"full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"}],"scopus_import":"1","publication":"Journal of Statistical Mechanics Theory and Experiment","quality_controlled":"1","volume":2014,"article_number":"P02001","abstract":[{"lang":"eng","text":"The purpose of this contribution is to summarize and discuss recent advances regarding the onset of turbulence in shear flows. The absence of a clear-cut instability mechanism, the spatio-temporal intermittent character and extremely long lived transients are some of the major difficulties encountered in these flows and have hindered progress towards understanding the transition process. We will show for the case of pipe flow that concepts from nonlinear dynamics and statistical physics can help to explain the onset of turbulence. In particular, the turbulent structures (puffs) observed close to onset are spatially localized chaotic transients and their lifetimes increase super-exponentially with Reynolds number. At the same time fluctuations of individual turbulent puffs can (although very rarely) lead to the nucleation of new puffs. The competition between these two stochastic processes gives rise to a non-equilibrium phase transition where turbulence changes from a super-transient to a sustained state."}],"publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","date_created":"2018-12-11T11:56:28Z","external_id":{"isi":["000332098100001"],"arxiv":["1403.4516"]},"department":[{"_id":"BjHo"}],"status":"public","issue":"2","day":"01","publisher":"IOP Publishing","type":"journal_article","date_updated":"2025-09-29T11:22:37Z","year":"2014","oa_version":"Submitted Version","date_published":"2014-02-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"02","title":"Deterministic and stochastic aspects of the transition to turbulence","_id":"2232","citation":{"ista":"Song B, Hof B. 2014. Deterministic and stochastic aspects of the transition to turbulence. Journal of Statistical Mechanics Theory and Experiment. 2014(2), P02001.","chicago":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing, 2014. <a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">https://doi.org/10.1088/1742-5468/2014/02/P02001</a>.","apa":"Song, B., &#38; Hof, B. (2014). Deterministic and stochastic aspects of the transition to turbulence. <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">https://doi.org/10.1088/1742-5468/2014/02/P02001</a>","ama":"Song B, Hof B. Deterministic and stochastic aspects of the transition to turbulence. <i>Journal of Statistical Mechanics Theory and Experiment</i>. 2014;2014(2). doi:<a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">10.1088/1742-5468/2014/02/P02001</a>","ieee":"B. Song and B. Hof, “Deterministic and stochastic aspects of the transition to turbulence,” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2014, no. 2. IOP Publishing, 2014.","short":"B. Song, B. Hof, Journal of Statistical Mechanics Theory and Experiment 2014 (2014).","mla":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2014, no. 2, P02001, IOP Publishing, 2014, doi:<a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">10.1088/1742-5468/2014/02/P02001</a>."},"article_processing_charge":"No","arxiv":1,"article_type":"original","doi":"10.1088/1742-5468/2014/02/P02001","publist_id":"4729"},{"file":[{"relation":"main_file","access_level":"open_access","file_id":"4643","date_created":"2018-12-12T10:07:45Z","file_name":"IST-2015-389-v1+1_1401.3957.pdf","creator":"system","file_size":550936,"content_type":"application/pdf","checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","date_updated":"2020-07-14T12:45:34Z"}],"oa":1,"publication_identifier":{"issn":["1860-5974"]},"file_date_updated":"2020-07-14T12:45:34Z","publication":"Logical Methods in Computer Science","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"scopus_import":"1","isi":1,"intvolume":"        10","ec_funded":1,"abstract":[{"lang":"eng","text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. "}],"volume":10,"quality_controlled":"1","date_created":"2018-12-11T11:56:28Z","external_id":{"isi":["000333744700015"]},"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1","day":"13","publisher":"International Federation of Computational Logic","type":"journal_article","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","date_published":"2014-02-13T00:00:00Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"date_updated":"2025-09-29T11:22:08Z","year":"2014","oa_version":"Published Version","article_processing_charge":"No","citation":{"apa":"Boker, U., &#38; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>","ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>.","mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>.","short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014."},"_id":"2233","month":"02","title":"Exact and approximate determinization of discounted-sum automata","doi":"10.2168/LMCS-10(1:10)2014","publist_id":"4728","ddc":["000"],"pubrep_id":"389"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","date_published":"2014-02-14T00:00:00Z","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_updated":"2025-09-29T11:21:40Z","oa_version":"Published Version","year":"2014","issue":"1","publisher":"International Federation of Computational Logic","type":"journal_article","day":"14","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publist_id":"4727","doi":"10.2168/LMCS-10(1:13)2014","ddc":["000"],"pubrep_id":"428","article_processing_charge":"No","citation":{"apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>","ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>.","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014."},"_id":"2234","month":"02","title":"Markov decision processes with multiple long-run average objectives","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"first_name":"Václav","last_name":"Brožek","full_name":"Brožek, Václav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"}],"scopus_import":"1","publication":"Logical Methods in Computer Science","file_date_updated":"2020-07-14T12:45:34Z","isi":1,"intvolume":"        10","ec_funded":1,"file":[{"access_level":"open_access","relation":"main_file","checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_name":"IST-2016-428-v1+1_1104.3489.pdf","creator":"system","date_created":"2018-12-12T10:07:57Z","file_id":"4656","file_size":375388}],"oa":1,"publication_identifier":{"issn":["1860-5974"]},"date_created":"2018-12-11T11:56:29Z","department":[{"_id":"KrCh"}],"external_id":{"isi":["000333744700001"]},"language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε &gt; 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε &gt; 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results."}],"volume":10,"quality_controlled":"1"},{"publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","date_created":"2018-12-11T11:56:29Z","external_id":{"isi":["000331477800040"]},"department":[{"_id":"SyCr"}],"quality_controlled":"1","volume":506,"abstract":[{"lang":"eng","text":"Emerging infectious diseases (EIDs) pose a risk to human welfare, both directly and indirectly, by affecting managed livestock and wildlife that provide valuable resources and ecosystem services, such as the pollination of crops. Honeybees (Apis mellifera), the prevailing managed insect crop pollinator, suffer from a range of emerging and exotic high-impact pathogens, and population maintenance requires active management by beekeepers to control them. Wild pollinators such as bumblebees (Bombus spp.) are in global decline, one cause of which may be pathogen spillover from managed pollinators like honeybees or commercial colonies of bumblebees. Here we use a combination of infection experiments and landscape-scale field data to show that honeybee EIDs are indeed widespread infectious agents within the pollinator assemblage. The prevalence of deformed wing virus (DWV) and the exotic parasite Nosema ceranae in honeybees and bumblebees is linked; as honeybees have higher DWV prevalence, and sympatric bumblebees and honeybees are infected by the same DWV strains, Apis is the likely source of at least one major EID in wild pollinators. Lessons learned from vertebrates highlight the need for increased pathogen control in managed bee species to maintain wild pollinators, as declines in native pollinators may be caused by interspecies pathogen transmission originating from managed pollinators."}],"isi":1,"intvolume":"       506","publication":"Nature","scopus_import":"1","author":[{"last_name":"Fürst","full_name":"Fürst, Matthias","first_name":"Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3712-925X"},{"full_name":"Mcmahon, Dino","last_name":"Mcmahon","first_name":"Dino"},{"first_name":"Juliet","last_name":"Osborne","full_name":"Osborne, Juliet"},{"first_name":"Robert","full_name":"Paxton, Robert","last_name":"Paxton"},{"last_name":"Brown","full_name":"Brown, Mark","first_name":"Mark"}],"publication_identifier":{"issn":["0028-0836"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3985068/"}],"publist_id":"4726","doi":"10.1038/nature12977","month":"02","title":"Disease associations between honeybees and bumblebees as a threat to wild pollinators","_id":"2235","citation":{"ieee":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, and M. Brown, “Disease associations between honeybees and bumblebees as a threat to wild pollinators,” <i>Nature</i>, vol. 506, no. 7488. Nature Publishing Group, pp. 364–366, 2014.","mla":"Fürst, Matthias, et al. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” <i>Nature</i>, vol. 506, no. 7488, Nature Publishing Group, 2014, pp. 364–66, doi:<a href=\"https://doi.org/10.1038/nature12977\">10.1038/nature12977</a>.","short":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, M. Brown, Nature 506 (2014) 364–366.","chicago":"Fürst, Matthias, Dino Mcmahon, Juliet Osborne, Robert Paxton, and Mark Brown. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” <i>Nature</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nature12977\">https://doi.org/10.1038/nature12977</a>.","ista":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. 2014. Disease associations between honeybees and bumblebees as a threat to wild pollinators. Nature. 506(7488), 364–366.","ama":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. Disease associations between honeybees and bumblebees as a threat to wild pollinators. <i>Nature</i>. 2014;506(7488):364-366. doi:<a href=\"https://doi.org/10.1038/nature12977\">10.1038/nature12977</a>","apa":"Fürst, M., Mcmahon, D., Osborne, J., Paxton, R., &#38; Brown, M. (2014). Disease associations between honeybees and bumblebees as a threat to wild pollinators. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature12977\">https://doi.org/10.1038/nature12977</a>"},"article_processing_charge":"No","date_updated":"2025-09-29T11:21:06Z","oa_version":"Submitted Version","year":"2014","date_published":"2014-02-20T00:00:00Z","page":"364 - 366","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","issue":"7488","type":"journal_article","publisher":"Nature Publishing Group","day":"20"},{"file_date_updated":"2020-07-14T12:45:34Z","author":[{"full_name":"Jetchev, Dimitar","last_name":"Jetchev","first_name":"Dimitar"},{"last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"scopus_import":"1","intvolume":"      8349","ec_funded":1,"file":[{"content_type":"application/pdf","checksum":"42960325c29dcd8d832edadcc3ce0045","date_updated":"2020-07-14T12:45:34Z","file_name":"IST-2016-681-v1+1_869_1_.pdf","creator":"system","file_id":"5275","date_created":"2018-12-12T10:17:21Z","file_size":313528,"access_level":"open_access","relation":"main_file"}],"publication_identifier":{"isbn":["978-364254241-1"]},"oa":1,"date_created":"2018-12-11T11:56:29Z","department":[{"_id":"KrPi"}],"corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"Consider a joint distribution (X,A) on a set. We show that for any family of distinguishers, there exists a simulator such that 1 no function in can distinguish (X,A) from (X,h(X)) with advantage ε, 2 h is only O(2 3ℓ ε -2) times less efficient than the functions in. For the most interesting settings of the parameters (in particular, the cryptographic case where X has superlogarithmic min-entropy, ε &gt; 0 is negligible and consists of circuits of polynomial size), we can make the simulator h deterministic. As an illustrative application of our theorem, we give a new security proof for the leakage-resilient stream-cipher from Eurocrypt'09. Our proof is simpler and quantitatively much better than the original proof using the dense model theorem, giving meaningful security guarantees if instantiated with a standard blockcipher like AES. Subsequent to this work, Chung, Lui and Pass gave an interactive variant of our main theorem, and used it to investigate weak notions of Zero-Knowledge. Vadhan and Zheng give a more constructive version of our theorem using their new uniform min-max theorem.","lang":"eng"}],"editor":[{"last_name":"Lindell","full_name":"Lindell, Yehuda","first_name":"Yehuda"}],"volume":8349,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"566 - 590","date_published":"2014-02-01T00:00:00Z","has_accepted_license":"1","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-06-11T08:02:25Z","oa_version":"Submitted Version","year":"2014","day":"01","publisher":"Springer","type":"conference","status":"public","alternative_title":["LNCS"],"publist_id":"4725","doi":"10.1007/978-3-642-54242-8_24","ddc":["004"],"pubrep_id":"681","conference":{"end_date":"2014-02-26","location":"San Diego, USA","start_date":"2014-02-24","name":"TCC: Theory of Cryptography Conference"},"article_processing_charge":"No","citation":{"ama":"Jetchev D, Pietrzak KZ. How to fake auxiliary input. In: Lindell Y, ed. Vol 8349. Springer; 2014:566-590. doi:<a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">10.1007/978-3-642-54242-8_24</a>","apa":"Jetchev, D., &#38; Pietrzak, K. Z. (2014). How to fake auxiliary input. In Y. Lindell (Ed.) (Vol. 8349, pp. 566–590). Presented at the TCC: Theory of Cryptography Conference, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">https://doi.org/10.1007/978-3-642-54242-8_24</a>","chicago":"Jetchev, Dimitar, and Krzysztof Z Pietrzak. “How to Fake Auxiliary Input.” edited by Yehuda Lindell, 8349:566–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">https://doi.org/10.1007/978-3-642-54242-8_24</a>.","ista":"Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349, 566–590.","mla":"Jetchev, Dimitar, and Krzysztof Z. Pietrzak. <i>How to Fake Auxiliary Input</i>. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">10.1007/978-3-642-54242-8_24</a>.","short":"D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.","ieee":"D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590."},"_id":"2236","month":"02","title":"How to fake auxiliary input"},{"abstract":[{"lang":"eng","text":"The analysis of the energy consumption of software is an important goal for quantitative formal methods. Current methods, using weighted transition systems or energy games, model the energy source as an ideal resource whose status is characterized by one number, namely the amount of remaining energy. Real batteries, however, exhibit behaviors that can deviate substantially from an ideal energy resource. Based on a discretization of a standard continuous battery model, we introduce battery transition systems. In this model, a battery is viewed as consisting of two parts-the available-charge tank and the bound-charge tank. Any charge or discharge is applied to the available-charge tank. Over time, the energy from each tank diffuses to the other tank. Battery transition systems are infinite state systems that, being not well-structured, fall into no decidable class that is known to us. Nonetheless, we are able to prove that the !-regular modelchecking problem is decidable for battery transition systems. We also present a case study on the verification of control programs for energy-constrained semi-autonomous robots."}],"quality_controlled":"1","volume":49,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:56:30Z","publication_status":"published","publication_identifier":{"isbn":["978-145032544-8"]},"ec_funded":1,"intvolume":"        49","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"scopus_import":1,"citation":{"short":"U. Boker, T.A. Henzinger, A. Radhakrishna, in:, ACM, 2014, pp. 595–606.","mla":"Boker, Udi, et al. <i>Battery Transition Systems</i>. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>.","ieee":"U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.","apa":"Boker, U., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>","ama":"Boker U, Henzinger TA, Radhakrishna A. Battery transition systems. In: Vol 49. ACM; 2014:595-606. doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>","ista":"Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.","chicago":"Boker, Udi, Thomas A Henzinger, and Arjun Radhakrishna. “Battery Transition Systems,” 49:595–606. ACM, 2014. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>."},"conference":{"end_date":"2014-01-24","location":"San Diego, USA","start_date":"2014-01-22","name":"POPL: Principles of Programming Languages"},"title":"Battery transition systems","month":"01","_id":"2239","publist_id":"4722","doi":"10.1145/2535838.2535875","type":"conference","day":"13","publisher":"ACM","issue":"1","status":"public","page":"595 - 606","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014","oa_version":"None","date_updated":"2021-01-12T06:56:13Z","date_published":"2014-01-13T00:00:00Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}]},{"date_published":"2014-02-13T00:00:00Z","date_updated":"2025-09-29T11:20:21Z","oa_version":"None","year":"2014","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"691 - 704","status":"public","issue":"4","type":"journal_article","day":"13","publisher":"Cell Press","doi":"10.1016/j.cell.2014.01.039","publist_id":"4721","_id":"2240","month":"02","title":"The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants","article_processing_charge":"No","citation":{"ieee":"A. Gadeyne <i>et al.</i>, “The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants,” <i>Cell</i>, vol. 156, no. 4. Cell Press, pp. 691–704, 2014.","short":"A. Gadeyne, C. Sánchez Rodríguez, S. Vanneste, S. Di Rubbo, H. Zauber, K. Vanneste, J. Van Leene, N. De Winne, D. Eeckhout, G. Persiau, E. Van De Slijke, B. Cannoot, L. Vercruysse, J. Mayers, M. Adamowski, U. Kania, M. Ehrlich, A. Schweighofer, T. Ketelaar, S. Maere, S. Bednarek, J. Friml, K. Gevaert, E. Witters, E. Russinova, S. Persson, G. De Jaeger, D. Van Damme, Cell 156 (2014) 691–704.","mla":"Gadeyne, Astrid, et al. “The TPLATE Adaptor Complex Drives Clathrin-Mediated Endocytosis in Plants.” <i>Cell</i>, vol. 156, no. 4, Cell Press, 2014, pp. 691–704, doi:<a href=\"https://doi.org/10.1016/j.cell.2014.01.039\">10.1016/j.cell.2014.01.039</a>.","chicago":"Gadeyne, Astrid, Clara Sánchez Rodríguez, Steffen Vanneste, Simone Di Rubbo, Henrik Zauber, Kevin Vanneste, Jelle Van Leene, et al. “The TPLATE Adaptor Complex Drives Clathrin-Mediated Endocytosis in Plants.” <i>Cell</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.cell.2014.01.039\">https://doi.org/10.1016/j.cell.2014.01.039</a>.","ista":"Gadeyne A, Sánchez Rodríguez C, Vanneste S, Di Rubbo S, Zauber H, Vanneste K, Van Leene J, De Winne N, Eeckhout D, Persiau G, Van De Slijke E, Cannoot B, Vercruysse L, Mayers J, Adamowski M, Kania U, Ehrlich M, Schweighofer A, Ketelaar T, Maere S, Bednarek S, Friml J, Gevaert K, Witters E, Russinova E, Persson S, De Jaeger G, Van Damme D. 2014. The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. Cell. 156(4), 691–704.","ama":"Gadeyne A, Sánchez Rodríguez C, Vanneste S, et al. The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. <i>Cell</i>. 2014;156(4):691-704. doi:<a href=\"https://doi.org/10.1016/j.cell.2014.01.039\">10.1016/j.cell.2014.01.039</a>","apa":"Gadeyne, A., Sánchez Rodríguez, C., Vanneste, S., Di Rubbo, S., Zauber, H., Vanneste, K., … Van Damme, D. (2014). The TPLATE adaptor complex drives clathrin-mediated endocytosis in plants. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2014.01.039\">https://doi.org/10.1016/j.cell.2014.01.039</a>"},"scopus_import":"1","publication":"Cell","author":[{"full_name":"Gadeyne, Astrid","last_name":"Gadeyne","first_name":"Astrid"},{"full_name":"Sánchez Rodríguez, Clara","last_name":"Sánchez Rodríguez","first_name":"Clara"},{"first_name":"Steffen","last_name":"Vanneste","full_name":"Vanneste, Steffen"},{"first_name":"Simone","last_name":"Di Rubbo","full_name":"Di Rubbo, Simone"},{"full_name":"Zauber, Henrik","last_name":"Zauber","first_name":"Henrik"},{"first_name":"Kevin","last_name":"Vanneste","full_name":"Vanneste, Kevin"},{"full_name":"Van Leene, Jelle","last_name":"Van Leene","first_name":"Jelle"},{"last_name":"De Winne","full_name":"De Winne, Nancy","first_name":"Nancy"},{"full_name":"Eeckhout, Dominique","last_name":"Eeckhout","first_name":"Dominique"},{"full_name":"Persiau, Geert","last_name":"Persiau","first_name":"Geert"},{"last_name":"Van De Slijke","full_name":"Van De Slijke, Eveline","first_name":"Eveline"},{"first_name":"Bernard","full_name":"Cannoot, Bernard","last_name":"Cannoot"},{"first_name":"Leen","last_name":"Vercruysse","full_name":"Vercruysse, Leen"},{"full_name":"Mayers, Jonathan","last_name":"Mayers","first_name":"Jonathan"},{"full_name":"Adamowski, Maciek","last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek","orcid":"0000-0001-6463-5257"},{"last_name":"Kania","full_name":"Kania, Urszula","first_name":"Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matthias","full_name":"Ehrlich, Matthias","last_name":"Ehrlich"},{"last_name":"Schweighofer","full_name":"Schweighofer, Alois","first_name":"Alois"},{"first_name":"Tijs","full_name":"Ketelaar, Tijs","last_name":"Ketelaar"},{"full_name":"Maere, Steven","last_name":"Maere","first_name":"Steven"},{"first_name":"Sebastian","full_name":"Bednarek, Sebastian","last_name":"Bednarek"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"last_name":"Gevaert","full_name":"Gevaert, Kris","first_name":"Kris"},{"full_name":"Witters, Erwin","last_name":"Witters","first_name":"Erwin"},{"last_name":"Russinova","full_name":"Russinova, Eugenia","first_name":"Eugenia"},{"first_name":"Staffan","last_name":"Persson","full_name":"Persson, Staffan"},{"first_name":"Geert","last_name":"De Jaeger","full_name":"De Jaeger, Geert"},{"first_name":"Daniël","full_name":"Van Damme, Daniël","last_name":"Van Damme"}],"intvolume":"       156","isi":1,"publication_identifier":{"issn":["0092-8674"]},"publication_status":"published","date_created":"2018-12-11T11:56:31Z","department":[{"_id":"JiFr"}],"external_id":{"isi":["000331379800009"]},"language":[{"iso":"eng"}],"volume":156,"quality_controlled":"1","abstract":[{"text":"Clathrin-mediated endocytosis is the major mechanism for eukaryotic plasma membrane-based proteome turn-over. In plants, clathrin-mediated endocytosis is essential for physiology and development, but the identification and organization of the machinery operating this process remains largely obscure. Here, we identified an eight-core-component protein complex, the TPLATE complex, essential for plant growth via its role as major adaptor module for clathrin-mediated endocytosis. This complex consists of evolutionarily unique proteins that associate closely with core endocytic elements. The TPLATE complex is recruited as dynamic foci at the plasma membrane preceding recruitment of adaptor protein complex 2, clathrin, and dynamin-related proteins. Reduced function of different complex components severely impaired internalization of assorted endocytic cargoes, demonstrating its pivotal role in clathrin-mediated endocytosis. Taken together, the TPLATE complex is an early endocytic module representing a unique evolutionary plant adaptation of the canonical eukaryotic pathway for clathrin-mediated endocytosis.","lang":"eng"}]},{"oa_version":"None","year":"2014","date_updated":"2025-09-29T11:19:23Z","date_published":"2014-02-14T00:00:00Z","page":"632 - 640","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","day":"14","type":"journal_article","publisher":"Elsevier","issue":"4","doi":"10.1016/j.febslet.2014.01.009","publist_id":"4714","title":"A miR-155-dependent microRNA hierarchy in dendritic cell maturation and macrophage activation","month":"02","_id":"2242","citation":{"ieee":"A. Dueck, A. Eichner, M. K. Sixt, and G. Meister, “A miR-155-dependent microRNA hierarchy in dendritic cell maturation and macrophage activation,” <i>FEBS Letters</i>, vol. 588, no. 4. Elsevier, pp. 632–640, 2014.","mla":"Dueck, Anne, et al. “A MiR-155-Dependent MicroRNA Hierarchy in Dendritic Cell Maturation and Macrophage Activation.” <i>FEBS Letters</i>, vol. 588, no. 4, Elsevier, 2014, pp. 632–40, doi:<a href=\"https://doi.org/10.1016/j.febslet.2014.01.009\">10.1016/j.febslet.2014.01.009</a>.","short":"A. Dueck, A. Eichner, M.K. Sixt, G. Meister, FEBS Letters 588 (2014) 632–640.","ista":"Dueck A, Eichner A, Sixt MK, Meister G. 2014. A miR-155-dependent microRNA hierarchy in dendritic cell maturation and macrophage activation. FEBS Letters. 588(4), 632–640.","chicago":"Dueck, Anne, Alexander Eichner, Michael K Sixt, and Gunter Meister. “A MiR-155-Dependent MicroRNA Hierarchy in Dendritic Cell Maturation and Macrophage Activation.” <i>FEBS Letters</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.febslet.2014.01.009\">https://doi.org/10.1016/j.febslet.2014.01.009</a>.","apa":"Dueck, A., Eichner, A., Sixt, M. K., &#38; Meister, G. (2014). A miR-155-dependent microRNA hierarchy in dendritic cell maturation and macrophage activation. <i>FEBS Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.febslet.2014.01.009\">https://doi.org/10.1016/j.febslet.2014.01.009</a>","ama":"Dueck A, Eichner A, Sixt MK, Meister G. A miR-155-dependent microRNA hierarchy in dendritic cell maturation and macrophage activation. <i>FEBS Letters</i>. 2014;588(4):632-640. doi:<a href=\"https://doi.org/10.1016/j.febslet.2014.01.009\">10.1016/j.febslet.2014.01.009</a>"},"article_processing_charge":"No","intvolume":"       588","isi":1,"scopus_import":"1","publication":"FEBS Letters","author":[{"first_name":"Anne","last_name":"Dueck","full_name":"Dueck, Anne"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Eichner","full_name":"Eichner, Alexander"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K"},{"last_name":"Meister","full_name":"Meister, Gunter","first_name":"Gunter"}],"publication_identifier":{"issn":["0014-5793"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"external_id":{"isi":["000331115700016"]},"date_created":"2018-12-11T11:56:31Z","quality_controlled":"1","volume":588,"abstract":[{"text":"MicroRNAs (miRNAs) are small RNAs that play important regulatory roles in many cellular pathways. MiRNAs associate with members of the Argonaute protein family and bind to partially complementary sequences on mRNAs and induce translational repression or mRNA decay. Using deep sequencing and Northern blotting, we characterized miRNA expression in wild type and miR-155-deficient dendritic cells (DCs) and macrophages. Analysis of different stimuli (LPS, LDL, eLDL, oxLDL) reveals a direct influence of miR-155 on the expression levels of other miRNAs. For example, miR-455 is negatively regulated in miR-155-deficient cells possibly due to inhibition of the transcription factor C/EBPbeta by miR-155. Based on our comprehensive data sets, we propose a model of hierarchical miRNA expression dominated by miR-155 in DCs and macrophages.","lang":"eng"}]},{"status":"public","type":"book_chapter","day":"01","publisher":"Springer","date_published":"2014-01-01T00:00:00Z","year":"2014","oa_version":"None","date_updated":"2025-07-10T11:52:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"255 - 264","_id":"2245","title":"Analyzing the in vivo status of exogenously applied auxins: A HPLC-based method to characterize the intracellularly localized auxin transporters","month":"01","article_processing_charge":"No","citation":{"chicago":"Simon, Sibu, Petr Skůpa, Petre Dobrev, Jan Petrášek, Eva Zažímalová, and Jiří Friml. “Analyzing the in Vivo Status of Exogenously Applied Auxins: A HPLC-Based Method to Characterize the Intracellularly Localized Auxin Transporters.” In <i>Plant Chemical Genomics</i>, edited by Glenn Hicks and Stéphanie Robert, 1056:255–64. Methods in Molecular Biology. Springer, 2014. <a href=\"https://doi.org/10.1007/978-1-62703-592-7_23\">https://doi.org/10.1007/978-1-62703-592-7_23</a>.","ista":"Simon S, Skůpa P, Dobrev P, Petrášek J, Zažímalová E, Friml J. 2014.Analyzing the in vivo status of exogenously applied auxins: A HPLC-based method to characterize the intracellularly localized auxin transporters. In: Plant Chemical Genomics. Methods in Molecular Biology, vol. 1056, 255–264.","ama":"Simon S, Skůpa P, Dobrev P, Petrášek J, Zažímalová E, Friml J. Analyzing the in vivo status of exogenously applied auxins: A HPLC-based method to characterize the intracellularly localized auxin transporters. In: Hicks G, Robert S, eds. <i>Plant Chemical Genomics</i>. Vol 1056. Methods in Molecular Biology. Springer; 2014:255-264. doi:<a href=\"https://doi.org/10.1007/978-1-62703-592-7_23\">10.1007/978-1-62703-592-7_23</a>","apa":"Simon, S., Skůpa, P., Dobrev, P., Petrášek, J., Zažímalová, E., &#38; Friml, J. (2014). Analyzing the in vivo status of exogenously applied auxins: A HPLC-based method to characterize the intracellularly localized auxin transporters. In G. Hicks &#38; S. Robert (Eds.), <i>Plant Chemical Genomics</i> (Vol. 1056, pp. 255–264). Springer. <a href=\"https://doi.org/10.1007/978-1-62703-592-7_23\">https://doi.org/10.1007/978-1-62703-592-7_23</a>","ieee":"S. Simon, P. Skůpa, P. Dobrev, J. Petrášek, E. Zažímalová, and J. Friml, “Analyzing the in vivo status of exogenously applied auxins: A HPLC-based method to characterize the intracellularly localized auxin transporters,” in <i>Plant Chemical Genomics</i>, vol. 1056, G. Hicks and S. Robert, Eds. Springer, 2014, pp. 255–264.","mla":"Simon, Sibu, et al. “Analyzing the in Vivo Status of Exogenously Applied Auxins: A HPLC-Based Method to Characterize the Intracellularly Localized Auxin Transporters.” <i>Plant Chemical Genomics</i>, edited by Glenn Hicks and Stéphanie Robert, vol. 1056, Springer, 2014, pp. 255–64, doi:<a href=\"https://doi.org/10.1007/978-1-62703-592-7_23\">10.1007/978-1-62703-592-7_23</a>.","short":"S. Simon, P. Skůpa, P. Dobrev, J. Petrášek, E. Zažímalová, J. Friml, in:, G. Hicks, S. Robert (Eds.), Plant Chemical Genomics, Springer, 2014, pp. 255–264."},"publist_id":"4704","doi":"10.1007/978-1-62703-592-7_23","alternative_title":["Methods in Molecular Biology"],"publication_identifier":{"issn":["1064-3745"]},"series_title":"Methods in Molecular Biology","scopus_import":"1","author":[{"orcid":"0000-0002-1998-6741","last_name":"Simon","full_name":"Simon, Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","first_name":"Sibu"},{"first_name":"Petr","full_name":"Skůpa, Petr","last_name":"Skůpa"},{"full_name":"Dobrev, Petre","last_name":"Dobrev","first_name":"Petre"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"},{"last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"publication":"Plant Chemical Genomics","intvolume":"      1056","volume":1056,"quality_controlled":"1","abstract":[{"text":"Exogenous application of biologically important molecules for plant growth promotion and/or regulation is very common both in plant research and horticulture. Plant hormones such as auxins and cytokinins are classes of compounds which are often applied exogenously. Nevertheless, plants possess a well-established machinery to regulate the active pool of exogenously applied compounds by converting them to metabolites and conjugates. Consequently, it is often very useful to know the in vivo status of applied compounds to connect them with some of the regulatory events in plant developmental processes. The in vivo status of applied compounds can be measured by incubating plants with radiolabeled compounds, followed by extraction, purification, and HPLC metabolic profiling of plant extracts. Recently we have used this method to characterize the intracellularly localized PIN protein, PIN5. Here we explain the method in detail, with a focus on general application. ","lang":"eng"}],"editor":[{"full_name":"Hicks, Glenn","last_name":"Hicks","first_name":"Glenn"},{"full_name":"Robert, Stéphanie","last_name":"Robert","first_name":"Stéphanie"}],"publication_status":"published","department":[{"_id":"JiFr"}],"date_created":"2018-12-11T11:56:32Z","language":[{"iso":"eng"}]},{"_id":"2248","title":"Thumbs down: A molecular-morphogenetic approach to avian digit homology","month":"01","article_processing_charge":"No","citation":{"mla":"Capek, Daniel, et al. “Thumbs down: A Molecular-Morphogenetic Approach to Avian Digit Homology.” <i>Journal of Experimental Zoology Part B: Molecular and Developmental Evolution</i>, vol. 322, no. 1, Wiley-Blackwell, 2014, pp. 1–12, doi:<a href=\"https://doi.org/10.1002/jez.b.22545\">10.1002/jez.b.22545</a>.","short":"D. Capek, B. Metscher, G. Müller, Journal of Experimental Zoology Part B: Molecular and Developmental Evolution 322 (2014) 1–12.","ieee":"D. Capek, B. Metscher, and G. Müller, “Thumbs down: A molecular-morphogenetic approach to avian digit homology,” <i>Journal of Experimental Zoology Part B: Molecular and Developmental Evolution</i>, vol. 322, no. 1. Wiley-Blackwell, pp. 1–12, 2014.","ama":"Capek D, Metscher B, Müller G. Thumbs down: A molecular-morphogenetic approach to avian digit homology. <i>Journal of Experimental Zoology Part B: Molecular and Developmental Evolution</i>. 2014;322(1):1-12. doi:<a href=\"https://doi.org/10.1002/jez.b.22545\">10.1002/jez.b.22545</a>","apa":"Capek, D., Metscher, B., &#38; Müller, G. (2014). Thumbs down: A molecular-morphogenetic approach to avian digit homology. <i>Journal of Experimental Zoology Part B: Molecular and Developmental Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/jez.b.22545\">https://doi.org/10.1002/jez.b.22545</a>","chicago":"Capek, Daniel, Brian Metscher, and Gerd Müller. “Thumbs down: A Molecular-Morphogenetic Approach to Avian Digit Homology.” <i>Journal of Experimental Zoology Part B: Molecular and Developmental Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/jez.b.22545\">https://doi.org/10.1002/jez.b.22545</a>.","ista":"Capek D, Metscher B, Müller G. 2014. Thumbs down: A molecular-morphogenetic approach to avian digit homology. Journal of Experimental Zoology Part B: Molecular and Developmental Evolution. 322(1), 1–12."},"publist_id":"4701","doi":"10.1002/jez.b.22545","status":"public","type":"journal_article","publisher":"Wiley-Blackwell","day":"01","issue":"1","date_published":"2014-01-01T00:00:00Z","year":"2014","oa_version":"None","date_updated":"2025-09-29T11:18:02Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"1 - 12","volume":322,"quality_controlled":"1","abstract":[{"text":"Avian forelimb digit homology remains one of the standard themes in comparative biology and EvoDevo research. In order to resolve the apparent contradictions between embryological and paleontological evidence a variety of hypotheses have been presented in recent years. The proposals range from excluding birds from the dinosaur clade, to assignments of homology by different criteria, or even assuming a hexadactyl tetrapod limb ground state. At present two approaches prevail: the frame shift hypothesis and the pyramid reduction hypothesis. While the former postulates a homeotic shift of digit identities, the latter argues for a gradual bilateral reduction of phalanges and digits. Here we present a new model that integrates elements from both hypotheses with the existing experimental and fossil evidence. We start from the main feature common to both earlier concepts, the initiating ontogenetic event: reduction and loss of the anterior-most digit. It is proposed that a concerted mechanism of molecular regulation and developmental mechanics is capable of shifting the boundaries of hoxD expression in embryonic forelimb buds as well as changing the digit phenotypes. Based on a distinction between positional (topological) and compositional (phenotypic) homology criteria, we argue that the identity of the avian digits is II, III, IV, despite a partially altered phenotype. Finally, we introduce an alternative digit reduction scheme that reconciles the current fossil evidence with the presented molecular-morphogenetic model. Our approach identifies specific experiments that allow to test whether gene expression can be shifted and digit phenotypes can be altered by induced digit loss or digit gain.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000335377400001"]},"department":[{"_id":"CaHe"}],"date_created":"2018-12-11T11:56:33Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1552-5007"]},"author":[{"full_name":"Capek, Daniel","last_name":"Capek","first_name":"Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-9940"},{"first_name":"Brian","full_name":"Metscher, Brian","last_name":"Metscher"},{"first_name":"Gerd","full_name":"Müller, Gerd","last_name":"Müller"}],"scopus_import":"1","publication":"Journal of Experimental Zoology Part B: Molecular and Developmental Evolution","intvolume":"       322","isi":1},{"day":"05","type":"journal_article","publisher":"Royal Society, The","issue":"1635","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2014","oa_version":"Published Version","date_updated":"2025-09-29T11:16:35Z","date_published":"2014-02-05T00:00:00Z","has_accepted_license":"1","citation":{"ieee":"J. L. Csicsvari and D. Dupret, “Sharp wave/ripple network oscillations and learning-associated hippocampal maps,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635. Royal Society, The, 2014.","mla":"Csicsvari, Jozsef L., and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635, 20120528, Royal Society, The, 2014, doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>.","short":"J.L. Csicsvari, D. Dupret, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 369 (2014).","chicago":"Csicsvari, Jozsef L, and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The, 2014. <a href=\"https://doi.org/10.1098/rstb.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>.","ista":"Csicsvari JL, Dupret D. 2014. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 369(1635), 20120528.","ama":"Csicsvari JL, Dupret D. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2014;369(1635). doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>","apa":"Csicsvari, J. L., &#38; Dupret, D. (2014). Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <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.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>"},"article_processing_charge":"No","title":"Sharp wave/ripple network oscillations and learning-associated hippocampal maps","month":"02","_id":"2251","publist_id":"4697","doi":"10.1098/rstb.2012.0528","pubrep_id":"527","ddc":["570"],"publication_identifier":{"issn":["09628436"]},"oa":1,"file":[{"file_size":771896,"date_created":"2018-12-12T10:13:24Z","file_id":"5006","file_name":"IST-2016-527-v1+1_20120528.full.pdf","creator":"system","date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf","checksum":"51beb33de71c9c19e0c205a20d206f9a","relation":"main_file","access_level":"open_access"}],"acknowledgement":"CC BY 3.0","pmid":1,"isi":1,"intvolume":"       369","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","file_date_updated":"2020-07-14T12:45:34Z","author":[{"last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"},{"last_name":"Dupret","full_name":"Dupret, David","first_name":"David"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Sharp wave/ripple (SWR, 150–250 Hz) hippocampal events have long been postulated to be involved in memory consolidation. However, more recent work has investigated SWRs that occur during active waking behaviour: findings that suggest that SWRs may also play a role in cell assembly strengthening or spatial working memory. Do such theories of SWR function apply to animal learning? This review discusses how general theories linking SWRs to memory-related function may explain circuit mechanisms related to rodent spatial learning and to the associated stabilization of new cognitive maps."}],"article_number":"20120528","quality_controlled":"1","volume":369,"language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"JoCs"}],"external_id":{"isi":["000332465300014"],"pmid":["24366138"]},"date_created":"2018-12-11T11:56:34Z","publication_status":"published"},{"publist_id":"4695","doi":"10.1093/jhered/est063","article_processing_charge":"No","citation":{"ieee":"S. Phadke, T. Paixao, T. Pham, S. Pham, and R. Zufall, “Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila,” <i>Journal of Heredity</i>, vol. 105, no. 1. Oxford University Press, pp. 130–135, 2014.","mla":"Phadke, Sujal, et al. “Genetic Background Alters Dominance Relationships between Mat Alleles in the Ciliate Tetrahymena Thermophila.” <i>Journal of Heredity</i>, vol. 105, no. 1, Oxford University Press, 2014, pp. 130–35, doi:<a href=\"https://doi.org/10.1093/jhered/est063\">10.1093/jhered/est063</a>.","short":"S. Phadke, T. Paixao, T. Pham, S. Pham, R. Zufall, Journal of Heredity 105 (2014) 130–135.","ista":"Phadke S, Paixao T, Pham T, Pham S, Zufall R. 2014. Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. Journal of Heredity. 105(1), 130–135.","chicago":"Phadke, Sujal, Tiago Paixao, Tuan Pham, Stephanie Pham, and Rebecca Zufall. “Genetic Background Alters Dominance Relationships between Mat Alleles in the Ciliate Tetrahymena Thermophila.” <i>Journal of Heredity</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/jhered/est063\">https://doi.org/10.1093/jhered/est063</a>.","apa":"Phadke, S., Paixao, T., Pham, T., Pham, S., &#38; Zufall, R. (2014). Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. <i>Journal of Heredity</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/jhered/est063\">https://doi.org/10.1093/jhered/est063</a>","ama":"Phadke S, Paixao T, Pham T, Pham S, Zufall R. Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila. <i>Journal of Heredity</i>. 2014;105(1):130-135. doi:<a href=\"https://doi.org/10.1093/jhered/est063\">10.1093/jhered/est063</a>"},"_id":"2252","month":"01","title":"Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"130 - 135","date_published":"2014-01-01T00:00:00Z","date_updated":"2025-09-29T11:16:03Z","oa_version":"None","year":"2014","issue":"1","day":"01","type":"journal_article","publisher":"Oxford University Press","status":"public","date_created":"2018-12-11T11:56:35Z","department":[{"_id":"NiBa"}],"external_id":{"isi":["000328427800013"]},"corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"The pattern of inheritance and mechanism of sex determination can have important evolutionary consequences. We studied probabilistic sex determination in the ciliate Tetrahymena thermophila, which was previously shown to cause evolution of skewed sex ratios. We find that the genetic background alters the sex determination patterns of mat alleles in heterozygotes and that allelic interaction can differentially influence the expression probability of the 7 sexes. We quantify the dominance relationships between several mat alleles and find that A-type alleles, which specify sex I, are indeed recessive to B-type alleles, which are unable to specify that sex. Our results provide additional support for the presence of modifier loci and raise implications for the dynamics of sex ratios in populations of T. thermophila."}],"volume":105,"quality_controlled":"1","publication":"Journal of Heredity","author":[{"full_name":"Phadke, Sujal","last_name":"Phadke","first_name":"Sujal"},{"orcid":"0000-0003-2361-3953","last_name":"Paixao","full_name":"Paixao, Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago"},{"last_name":"Pham","full_name":"Pham, Tuan","first_name":"Tuan"},{"first_name":"Stephanie","full_name":"Pham, Stephanie","last_name":"Pham"},{"first_name":"Rebecca","last_name":"Zufall","full_name":"Zufall, Rebecca"}],"scopus_import":"1","isi":1,"intvolume":"       105","publication_identifier":{"issn":["0022-1503"]}},{"issue":"1","day":"02","publisher":"Public Library of Science","type":"journal_article","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","date_published":"2014-01-02T00:00:00Z","date_updated":"2025-09-29T11:14:06Z","oa_version":"Published Version","year":"2014","article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"research_data","id":"5562"}]},"citation":{"short":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014).","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>.","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.","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>","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>","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>.","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."},"_id":"2257","month":"01","title":"Searching for collective behavior in a large network of sensory neurons","publist_id":"4689","doi":"10.1371/journal.pcbi.1003408","ddc":["570"],"pubrep_id":"436","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c720222c5e924a4acb17f23b9381a6ca","date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2016-436-v1+1_journal.pcbi.1003408.pdf","creator":"system","date_created":"2018-12-12T10:12:46Z","file_id":"4965","file_size":2194790}],"acknowledgement":"This 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.","publication_identifier":{"issn":["1553-734X"]},"oa":1,"publication":"PLoS Computational Biology","file_date_updated":"2020-07-14T12:45:35Z","scopus_import":"1","author":[{"last_name":"Tkacik","full_name":"Tkacik, Gasper","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"full_name":"Marre, Olivier","last_name":"Marre","first_name":"Olivier"},{"first_name":"Dario","full_name":"Amodei, Dario","last_name":"Amodei"},{"first_name":"Elad","last_name":"Schneidman","full_name":"Schneidman, Elad"},{"first_name":"William","last_name":"Bialek","full_name":"Bialek, William"},{"last_name":"Berry","full_name":"Berry, Michael","first_name":"Michael"}],"isi":1,"intvolume":"        10","article_number":"e1003408","abstract":[{"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.","lang":"eng"}],"volume":10,"quality_controlled":"1","date_created":"2018-12-11T11:56:36Z","department":[{"_id":"GaTk"}],"external_id":{"isi":["000337948500010"]},"language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published"},{"quality_controlled":"1","volume":42,"article_number":"e34","abstract":[{"lang":"eng","text":"To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus."}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:38Z","external_id":{"isi":["000333093600005"]},"department":[{"_id":"SiHi"}],"oa":1,"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","file":[{"date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf","checksum":"e9268f5f96a820f04d7ebbf85927c3cb","file_size":11044478,"file_id":"4738","date_created":"2018-12-12T10:09:15Z","creator":"system","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","relation":"main_file","access_level":"open_access"}],"isi":1,"intvolume":"        42","publication":"Nucleic Acids Research","scopus_import":"1","file_date_updated":"2020-07-14T12:45:35Z","author":[{"first_name":"Fangfang","last_name":"Zhu","full_name":"Zhu, Fangfang"},{"full_name":"Gamboa, Matthew","last_name":"Gamboa","first_name":"Matthew"},{"full_name":"Farruggio, Alfonso","last_name":"Farruggio","first_name":"Alfonso"},{"orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tasic, Bosiljka","last_name":"Tasic","first_name":"Bosiljka"},{"full_name":"Schüle, Birgitt","last_name":"Schüle","first_name":"Birgitt"},{"first_name":"Yanru","full_name":"Chen Tsai, Yanru","last_name":"Chen Tsai"},{"full_name":"Calos, Michele","last_name":"Calos","first_name":"Michele"}],"month":"03","title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","_id":"2261","citation":{"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.","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","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>.","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.","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>.","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>","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>"},"article_processing_charge":"No","pubrep_id":"961","ddc":["571","610"],"publist_id":"4684","doi":"10.1093/nar/gkt1290","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","issue":"5","type":"journal_article","publisher":"Oxford University Press","day":"05","date_updated":"2025-09-29T11:13:18Z","oa_version":"Preprint","year":"2014","date_published":"2014-03-05T00:00:00Z","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"citation":{"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>","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>","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.","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.","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>.","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."},"article_processing_charge":"No","month":"01","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","_id":"2265","alternative_title":["Advances in Experimental Medicine and Biology"],"publist_id":"4679","doi":"10.1007/978-94-007-7687-6_1","publisher":"Springer","type":"book_chapter","day":"01","status":"public","page":"1 - 24","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-29T11:12:48Z","year":"2014","oa_version":"None","date_published":"2014-01-01T00:00:00Z","editor":[{"full_name":"Nguyen, Laurent","last_name":"Nguyen","first_name":"Laurent"}],"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."}],"quality_controlled":"1","volume":800,"corr_author":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:39Z","external_id":{"isi":["000333646000002"]},"department":[{"_id":"SiHi"}],"publication_status":"published","intvolume":"       800","isi":1,"publication":" Cellular and Molecular Control of Neuronal Migration","author":[{"orcid":"0000-0003-2279-1061","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"scopus_import":"1"},{"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"}],"quality_controlled":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:42Z","external_id":{"isi":["000351830500367"]},"department":[{"_id":"VlKo"}],"publication_status":"published","oa":1,"file":[{"relation":"main_file","access_level":"open_access","file_id":"4754","date_created":"2018-12-12T10:09:30Z","creator":"system","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf","file_size":378601,"content_type":"application/pdf","checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","date_updated":"2020-07-14T12:45:36Z"}],"isi":1,"author":[{"full_name":"Olsson, Carl","last_name":"Olsson","first_name":"Carl"},{"first_name":"Johannes","full_name":"Ulen, Johannes","last_name":"Ulen"},{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:45:36Z","scopus_import":"1","citation":{"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>","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>","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>.","ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.","short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.","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>.","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."},"conference":{"end_date":"2013-12-08","location":"Sydney, Australia","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"article_processing_charge":"No","month":"03","title":"Partial enumeration and curvature regularization","_id":"2275","doi":"10.1109/ICCV.2013.365","publist_id":"4669","pubrep_id":"566","ddc":["000"],"publisher":"IEEE","day":"03","type":"conference","status":"public","page":"2936 - 2943","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-29T14:28:16Z","oa_version":"Submitted Version","year":"2014","has_accepted_license":"1","date_published":"2014-03-03T00:00:00Z"},{"arxiv":1,"doi":"10.1007/s11005-013-0667-9","publist_id":"4653","article_type":"original","_id":"2281","title":"On the mass concentration for Bose-Einstein condensates with attractive interactions","month":"02","article_processing_charge":"No","citation":{"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.","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>.","short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","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.","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>","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>"},"date_published":"2014-02-01T00:00:00Z","oa_version":"Preprint","year":"2014","date_updated":"2025-09-29T11:12:19Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"141 - 156","status":"public","publisher":"Springer","day":"01","type":"journal_article","issue":"2","publication_status":"published","department":[{"_id":"RoSe"}],"external_id":{"isi":["000330128000002"],"arxiv":["1301.5682"]},"date_created":"2018-12-11T11:56:44Z","corr_author":"1","language":[{"iso":"eng"}],"volume":104,"quality_controlled":"1","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."}],"publication":"Letters in Mathematical Physics","author":[{"full_name":"Guo, Yujin","last_name":"Guo","first_name":"Yujin"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"scopus_import":"1","intvolume":"       104","isi":1,"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1301.5682"}]},{"page":"189 - 203","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-29T11:11:47Z","oa_version":"Published Version","year":"2014","has_accepted_license":"1","date_published":"2014-02-01T00:00:00Z","issue":"2","type":"journal_article","day":"01","publisher":"Wiley-Blackwell","tmp":{"short":"CC BY-NC (4.0)","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"},"status":"public","publist_id":"4646","doi":"10.1002/hipo.22214","pubrep_id":"461","ddc":["570"],"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>.","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.","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>","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>","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.","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>."},"article_processing_charge":"No","month":"02","title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","_id":"2285","isi":1,"intvolume":"        23","file_date_updated":"2020-07-14T12:45:37Z","author":[{"first_name":"Jonas","full_name":"Hosp, Jonas","last_name":"Hosp"},{"full_name":"Strüber, Michael","last_name":"Strüber","first_name":"Michael"},{"first_name":"Yuchio","last_name":"Yanagawa","full_name":"Yanagawa, Yuchio"},{"last_name":"Obata","full_name":"Obata, Kunihiko","first_name":"Kunihiko"},{"last_name":"Vida","full_name":"Vida, Imre","first_name":"Imre"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804"},{"first_name":"Marlene","full_name":"Bartos, Marlene","last_name":"Bartos"}],"publication":"Hippocampus","scopus_import":"1","oa":1,"file":[{"access_level":"open_access","relation":"main_file","checksum":"ff6bc75a79dbc985a2e31b79253e6444","content_type":"application/pdf","date_updated":"2020-07-14T12:45:37Z","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","creator":"system","date_created":"2018-12-12T10:15:54Z","file_id":"5178","file_size":801589}],"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.","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:46Z","external_id":{"isi":["000329879300006"]},"department":[{"_id":"PeJo"}],"publication_status":"published","abstract":[{"lang":"eng","text":"GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity."}],"quality_controlled":"1","volume":23},{"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"7f91e588a4e888610313b98271e6418e","date_updated":"2020-07-14T12:45:07Z","date_created":"2018-12-12T10:11:22Z","file_id":"4876","creator":"system","file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","file_size":9832561}],"oa":1,"file_date_updated":"2020-07-14T12:45:07Z","publication":"ACM Transactions on Graphics","author":[{"first_name":"Paul","full_name":"Guerrero, Paul","last_name":"Guerrero"},{"last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"first_name":"Michael","last_name":"Wimmer","full_name":"Wimmer, Michael"},{"last_name":"Wonka","full_name":"Wonka, Peter","first_name":"Peter"}],"isi":1,"intvolume":"        33","volume":33,"quality_controlled":"1","article_number":"15","abstract":[{"text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations.","lang":"eng"}],"publication_status":"published","date_created":"2018-12-11T11:53:08Z","external_id":{"isi":["000335009900003"]},"department":[{"_id":"ChWo"}],"language":[{"iso":"eng"}],"status":"public","issue":"2","day":"01","type":"journal_article","publisher":"ACM","date_published":"2014-03-01T00:00:00Z","has_accepted_license":"1","date_updated":"2025-09-29T13:16:25Z","oa_version":"Submitted Version","year":"2014","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1629","month":"03","title":"Edit propagation using geometric relationship functions","article_processing_charge":"No","citation":{"short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>."},"ddc":["000"],"pubrep_id":"577","doi":"10.1145/2591010","publist_id":"5526"},{"doi":"10.1007/978-3-319-10879-7_7","publist_id":"5509","alternative_title":["LNCS"],"citation":{"ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>.","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.","mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>."},"conference":{"end_date":"2014-09-05","location":"Amalfi, Italy","start_date":"2014-09-03","name":"SCN: Security and Cryptography for Networks"},"title":"Constrained Verifiable Random Functions ","month":"01","_id":"1643","page":"95 - 114","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","year":"2014","date_updated":"2024-10-09T20:55:56Z","date_published":"2014-01-01T00:00:00Z","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"day":"01","type":"conference","publisher":"Springer","status":"public","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:53:13Z","publication_status":"published","editor":[{"last_name":"Abdalla","full_name":"Abdalla, Michel","first_name":"Michel"},{"first_name":"Roberto","full_name":"De Prisco, Roberto","last_name":"De Prisco"}],"abstract":[{"text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al.","lang":"eng"}],"volume":8642,"ec_funded":1,"intvolume":"      8642","scopus_import":1,"publication":"SCN 2014","author":[{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"}],"main_file_link":[{"url":"http://eprint.iacr.org/2014/537","open_access":"1"}],"oa":1}]