[{"article_processing_charge":"No","publist_id":"5491","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5439"}]},"quality_controlled":"1","publication":"LICS","page":"750 - 761","date_created":"2018-12-11T11:53:19Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","title":"The target discounted-sum problem","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","series_title":"Logic in Computer Science","day":"01","acknowledgement":"A technical report of the article is available at: https://research-explorer.app.ist.ac.at/record/5439","file":[{"date_created":"2020-05-15T08:53:29Z","date_updated":"2020-07-14T12:45:10Z","file_name":"2015_LICS_Boker.pdf","access_level":"open_access","file_id":"7852","creator":"dernst","checksum":"6abebca9c1a620e9e103a8f9222befac","file_size":340215,"content_type":"application/pdf","relation":"main_file"}],"author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"ddc":["000"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:10Z","citation":{"mla":"Boker, Udi, et al. “The Target Discounted-Sum Problem.” <i>LICS</i>, IEEE, 2015, pp. 750–61, doi:<a href=\"https://doi.org/10.1109/LICS.2015.74\">10.1109/LICS.2015.74</a>.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.","apa":"Boker, U., Henzinger, T. A., &#38; Otop, J. (2015). The target discounted-sum problem. In <i>LICS</i> (pp. 750–761). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.74\">https://doi.org/10.1109/LICS.2015.74</a>","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. “The Target Discounted-Sum Problem.” In <i>LICS</i>, 750–61. Logic in Computer Science. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.74\">https://doi.org/10.1109/LICS.2015.74</a>.","short":"U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.","ama":"Boker U, Henzinger TA, Otop J. The target discounted-sum problem. In: <i>LICS</i>. Logic in Computer Science. IEEE; 2015:750-761. doi:<a href=\"https://doi.org/10.1109/LICS.2015.74\">10.1109/LICS.2015.74</a>","ieee":"U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in <i>LICS</i>, Kyoto, Japan, 2015, pp. 750–761."},"doi":"10.1109/LICS.2015.74","publication_status":"published","conference":{"name":"LICS: Logic in Computer Science","start_date":"2015-007-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"date_published":"2015-07-01T00:00:00Z","oa_version":"Submitted Version","oa":1,"publication_identifier":{"issn":["1043-6871 "],"eisbn":["978-1-4799-8875-4 "]},"status":"public","ec_funded":1,"month":"07","year":"2015","abstract":[{"lang":"eng","text":"The target discounted-sum problem is the following: Given a rational discount factor 0 &lt; λ &lt; 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata."}],"date_updated":"2023-02-23T12:26:27Z","_id":"1659"},{"date_created":"2018-12-11T11:53:19Z","page":"44 - 55","doi":"10.1109/LICS.2015.15","publication_status":"published","conference":{"name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"date_published":"2015-07-01T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","oa_version":"Preprint","publist_id":"5490","main_file_link":[{"url":"http://arxiv.org/abs/1505.02655","open_access":"1"}],"scopus_import":1,"quality_controlled":"1","citation":{"ama":"Brázdil T, Kiefer S, Kučera A, Novotný P. Long-run average behaviour of probabilistic vector addition systems. In: IEEE; 2015:44-55. doi:<a href=\"https://doi.org/10.1109/LICS.2015.15\">10.1109/LICS.2015.15</a>","ieee":"T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour of probabilistic vector addition systems,” presented at the LICS: Logic in Computer Science, Kyoto, Japan, 2015, pp. 44–55.","short":"T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.","apa":"Brázdil, T., Kiefer, S., Kučera, A., &#38; Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.15\">https://doi.org/10.1109/LICS.2015.15</a>","ista":"Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS, , 44–55.","mla":"Brázdil, Tomáš, et al. <i>Long-Run Average Behaviour of Probabilistic Vector Addition Systems</i>. IEEE, 2015, pp. 44–55, doi:<a href=\"https://doi.org/10.1109/LICS.2015.15\">10.1109/LICS.2015.15</a>.","chicago":"Brázdil, Tomáš, Stefan Kiefer, Antonín Kučera, and Petr Novotný. “Long-Run Average Behaviour of Probabilistic Vector Addition Systems,” 44–55. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.15\">https://doi.org/10.1109/LICS.2015.15</a>."},"year":"2015","day":"01","abstract":[{"text":"We study the pattern frequency vector for runs in probabilistic Vector Addition Systems with States (pVASS). Intuitively, each configuration of a given pVASS is assigned one of finitely many patterns, and every run can thus be seen as an infinite sequence of these patterns. The pattern frequency vector assigns to each run the limit of pattern frequencies computed for longer and longer prefixes of the run. If the limit does not exist, then the vector is undefined. We show that for one-counter pVASS, the pattern frequency vector is defined and takes one of finitely many values for almost all runs. Further, these values and their associated probabilities can be approximated up to an arbitrarily small relative error in polynomial time. For stable two-counter pVASS, we show the same result, but we do not provide any upper complexity bound. As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the 80s.","lang":"eng"}],"date_updated":"2021-01-12T06:52:20Z","_id":"1660","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"full_name":"Kiefer, Stefan","first_name":"Stefan","last_name":"Kiefer"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"},{"last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa":1,"title":"Long-run average behaviour of probabilistic vector addition systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","status":"public","ec_funded":1,"alternative_title":["LICS"],"month":"07"},{"year":"2015","date_updated":"2025-06-02T08:53:41Z","abstract":[{"lang":"eng","text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years."}],"_id":"1661","article_number":"7174888","oa":1,"status":"public","ec_funded":1,"month":"07","conference":{"name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"publication_status":"published","doi":"10.1109/LICS.2015.34","date_published":"2015-07-01T00:00:00Z","oa_version":"Submitted Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"citation":{"short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: <i>Proceedings - Symposium on Logic in Computer Science</i>. Vol 2015-July. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in <i>Proceedings - Symposium on Logic in Computer Science</i>, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, M. H., &#38; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In <i>Proceedings - Symposium on Logic in Computer Science</i> (Vol. 2015–July). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” <i>Proceedings - Symposium on Logic in Computer Science</i>, vol. 2015–July, 7174888, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In <i>Proceedings - Symposium on Logic in Computer Science</i>, Vol. 2015–July. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>."},"day":"01","acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"title":"Improved algorithms for one-pair and k-pair Streett objectives","publisher":"IEEE","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2018-12-11T11:53:19Z","publication":"Proceedings - Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"type":"conference","publist_id":"5489","article_processing_charge":"No","related_material":{"record":[{"relation":"later_version","status":"public","id":"464"}]},"quality_controlled":"1","volume":"2015-July"},{"status":"public","ec_funded":1,"month":"11","year":"2015","date_updated":"2021-01-12T06:52:22Z","abstract":[{"lang":"eng","text":"CREB-binding protein (CBP) and p300 are transcriptional coactivators involved in numerous biological processes that affect cell growth, transformation, differentiation, and development. In this study, we provide evidence of the involvement of homeodomain-interacting protein kinase 2 (HIPK2) in the regulation of CBP activity. We show that HIPK2 interacts with and phosphorylates several regions of CBP. We demonstrate that serines 2361, 2363, 2371, 2376, and 2381 are responsible for the HIPK2-induced mobility shift of CBP C-terminal activation domain. Moreover, we show that HIPK2 strongly potentiates the transcriptional activity of CBP. However, our data suggest that HIPK2 activates CBP mainly by counteracting the repressive action of cell cycle regulatory domain 1 (CRD1), located between amino acids 977 and 1076, independently of CBP phosphorylation. Our findings thus highlight a complex regulation of CBP activity by HIPK2, which might be relevant for the control of specific sets of target genes involved in cellular proliferation, differentiation and apoptosis."}],"issue":"11","_id":"1663","ddc":["570"],"file_date_updated":"2020-07-14T12:45:10Z","scopus_import":1,"intvolume":"        27","citation":{"short":"K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, J. Cardinaux, Cellular Signalling 27 (2015) 2252–2260.","ieee":"K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, and J. Cardinaux, “Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2,” <i>Cellular Signalling</i>, vol. 27, no. 11. Elsevier, pp. 2252–2260, 2015.","ama":"Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. <i>Cellular Signalling</i>. 2015;27(11):2252-2260. doi:<a href=\"https://doi.org/10.1016/j.cellsig.2015.08.001\">10.1016/j.cellsig.2015.08.001</a>","ista":"Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. 2015. Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular Signalling. 27(11), 2252–2260.","apa":"Kovács, K., Steinmann, M., Halfon, O., Magistretti, P., &#38; Cardinaux, J. (2015). Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. <i>Cellular Signalling</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cellsig.2015.08.001\">https://doi.org/10.1016/j.cellsig.2015.08.001</a>","mla":"Kovács, Krisztián, et al. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting Protein Kinase 2.” <i>Cellular Signalling</i>, vol. 27, no. 11, Elsevier, 2015, pp. 2252–60, doi:<a href=\"https://doi.org/10.1016/j.cellsig.2015.08.001\">10.1016/j.cellsig.2015.08.001</a>.","chicago":"Kovács, Krisztián, Myriam Steinmann, Olivier Halfon, Pierre Magistretti, and Jean Cardinaux. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting Protein Kinase 2.” <i>Cellular Signalling</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.cellsig.2015.08.001\">https://doi.org/10.1016/j.cellsig.2015.08.001</a>."},"publication_status":"published","doi":"10.1016/j.cellsig.2015.08.001","date_published":"2015-11-01T00:00:00Z","oa_version":"Published Version","title":"Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","day":"01","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"file":[{"relation":"main_file","content_type":"application/pdf","file_size":1735337,"file_name":"IST-2016-578-v1+1_CLS-D-15-00072R1_.pdf","date_updated":"2020-07-14T12:45:10Z","date_created":"2018-12-12T10:18:03Z","file_id":"5321","checksum":"4ee690b6444b7a43523237f0941457d1","creator":"system","access_level":"local"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Krisztián","last_name":"Kovács","id":"2AB5821E-F248-11E8-B48F-1D18A9856A87","full_name":"Kovács, Krisztián"},{"first_name":"Myriam","last_name":"Steinmann","full_name":"Steinmann, Myriam"},{"full_name":"Halfon, Olivier","last_name":"Halfon","first_name":"Olivier"},{"full_name":"Magistretti, Pierre","last_name":"Magistretti","first_name":"Pierre"},{"full_name":"Cardinaux, Jean","first_name":"Jean","last_name":"Cardinaux"}],"publist_id":"5487","pubrep_id":"578","quality_controlled":"1","volume":27,"date_created":"2018-12-11T11:53:20Z","page":"2252 - 2260","publication":"Cellular Signalling","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"JoCs"}],"type":"journal_article"},{"project":[{"name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"}],"author":[{"last_name":"Barkley","first_name":"Dwight","full_name":"Barkley, Dwight"},{"first_name":"Baofang","last_name":"Song","full_name":"Song, Baofang"},{"first_name":"Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","last_name":"Vasudevan","full_name":"Vasudevan, Mukund"},{"first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","full_name":"Lemoult, Grégoire M"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"},{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","full_name":"Hof, Björn"}],"day":"21","acknowledgement":"We acknowledge the Deutsche Forschungsgemeinschaft (Project No. FOR 1182), and the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. B.S. acknowledges financial support from the Chinese State Scholarship Fund under grant number 2010629145. B.S. acknowledges support from the International Max Planck Research School for the Physics of Biological and Complex Systems and the Göttingen Graduate School for Neurosciences and Molecular Biosciences. We acknowledge computing resources from GWDG (Gesellschaft für wissenschaftliche Datenverarbeitung Göttingen) and the Jülich Supercomputing Centre (grant HGU16) where the simulations were performed.","title":"The rise of fully turbulent flow","publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"type":"journal_article","date_created":"2018-12-11T11:53:20Z","page":"550 - 553","publication":"Nature","quality_controlled":"1","volume":526,"publist_id":"5485","_id":"1664","year":"2015","date_updated":"2021-01-12T06:52:22Z","issue":"7574","abstract":[{"lang":"eng","text":"Over a century of research into the origin of turbulence in wall-bounded shear flows has resulted in a puzzling picture in which turbulence appears in a variety of different states competing with laminar background flow. At moderate flow speeds, turbulence is confined to localized patches; it is only at higher speeds that the entire flow becomes turbulent. The origin of the different states encountered during this transition, the front dynamics of the turbulent regions and the transformation to full turbulence have yet to be explained. By combining experiments, theory and computer simulations, here we uncover a bifurcation scenario that explains the transformation to fully turbulent pipe flow and describe the front dynamics of the different states encountered in the process. Key to resolving this problem is the interpretation of the flow as a bistable system with nonlinear propagation (advection) of turbulent fronts. These findings bridge the gap between our understanding of the onset of turbulence and fully turbulent flows."}],"ec_funded":1,"month":"10","oa":1,"status":"public","date_published":"2015-10-21T00:00:00Z","oa_version":"Preprint","publication_status":"published","doi":"10.1038/nature15701","citation":{"ama":"Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. The rise of fully turbulent flow. <i>Nature</i>. 2015;526(7574):550-553. doi:<a href=\"https://doi.org/10.1038/nature15701\">10.1038/nature15701</a>","ieee":"D. Barkley, B. Song, M. Vasudevan, G. M. Lemoult, M. Avila, and B. Hof, “The rise of fully turbulent flow,” <i>Nature</i>, vol. 526, no. 7574. Nature Publishing Group, pp. 550–553, 2015.","short":"D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature 526 (2015) 550–553.","chicago":"Barkley, Dwight, Baofang Song, Mukund Vasudevan, Grégoire M Lemoult, Marc Avila, and Björn Hof. “The Rise of Fully Turbulent Flow.” <i>Nature</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nature15701\">https://doi.org/10.1038/nature15701</a>.","mla":"Barkley, Dwight, et al. “The Rise of Fully Turbulent Flow.” <i>Nature</i>, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 550–53, doi:<a href=\"https://doi.org/10.1038/nature15701\">10.1038/nature15701</a>.","apa":"Barkley, D., Song, B., Vasudevan, M., Lemoult, G. M., Avila, M., &#38; Hof, B. (2015). The rise of fully turbulent flow. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature15701\">https://doi.org/10.1038/nature15701</a>","ista":"Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. 2015. The rise of fully turbulent flow. Nature. 526(7574), 550–553."},"intvolume":"       526","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1510.09143","open_access":"1"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"type":"journal_article","date_created":"2018-12-11T11:53:21Z","page":"525 - 530","publication":"Nature","external_id":{"pmid":["26466571"]},"volume":526,"quality_controlled":"1","publist_id":"5484","article_processing_charge":"No","article_type":"original","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"author":[{"full_name":"Landau, Dan","last_name":"Landau","first_name":"Dan"},{"last_name":"Tausch","first_name":"Eugen","full_name":"Tausch, Eugen"},{"full_name":"Taylor Weiner, Amaro","last_name":"Taylor Weiner","first_name":"Amaro"},{"full_name":"Stewart, Chip","first_name":"Chip","last_name":"Stewart"},{"full_name":"Reiter, Johannes","first_name":"Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter"},{"full_name":"Bahlo, Jasmin","last_name":"Bahlo","first_name":"Jasmin"},{"first_name":"Sandra","last_name":"Kluth","full_name":"Kluth, Sandra"},{"full_name":"Božić, Ivana","last_name":"Božić","first_name":"Ivana"},{"last_name":"Lawrence","first_name":"Michael","full_name":"Lawrence, Michael"},{"full_name":"Böttcher, Sebastian","first_name":"Sebastian","last_name":"Böttcher"},{"full_name":"Carter, Scott","first_name":"Scott","last_name":"Carter"},{"first_name":"Kristian","last_name":"Cibulskis","full_name":"Cibulskis, Kristian"},{"last_name":"Mertens","first_name":"Daniel","full_name":"Mertens, Daniel"},{"full_name":"Sougnez, Carrie","first_name":"Carrie","last_name":"Sougnez"},{"full_name":"Rosenberg, Mara","first_name":"Mara","last_name":"Rosenberg"},{"full_name":"Hess, Julian","last_name":"Hess","first_name":"Julian"},{"first_name":"Jennifer","last_name":"Edelmann","full_name":"Edelmann, Jennifer"},{"full_name":"Kless, Sabrina","last_name":"Kless","first_name":"Sabrina"},{"last_name":"Kneba","first_name":"Michael","full_name":"Kneba, Michael"},{"last_name":"Ritgen","first_name":"Matthias","full_name":"Ritgen, Matthias"},{"first_name":"Anna","last_name":"Fink","full_name":"Fink, Anna"},{"first_name":"Kirsten","last_name":"Fischer","full_name":"Fischer, Kirsten"},{"full_name":"Gabriel, Stacey","last_name":"Gabriel","first_name":"Stacey"},{"full_name":"Lander, Eric","last_name":"Lander","first_name":"Eric"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"full_name":"Döhner, Hartmut","first_name":"Hartmut","last_name":"Döhner"},{"last_name":"Hallek","first_name":"Michael","full_name":"Hallek, Michael"},{"last_name":"Neuberg","first_name":"Donna","full_name":"Neuberg, Donna"},{"full_name":"Getz, Gad","last_name":"Getz","first_name":"Gad"},{"full_name":"Stilgenbauer, Stephan","last_name":"Stilgenbauer","first_name":"Stephan"},{"first_name":"Catherine","last_name":"Wu","full_name":"Wu, Catherine"}],"day":"22","pmid":1,"title":"Mutations driving CLL and their evolution in progression and relapse","publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-10-22T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1038/nature15395","citation":{"short":"D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo, S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens, C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen, A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D. Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.","ieee":"D. Landau <i>et al.</i>, “Mutations driving CLL and their evolution in progression and relapse,” <i>Nature</i>, vol. 526, no. 7574. Nature Publishing Group, pp. 525–530, 2015.","ama":"Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their evolution in progression and relapse. <i>Nature</i>. 2015;526(7574):525-530. doi:<a href=\"https://doi.org/10.1038/nature15395\">10.1038/nature15395</a>","apa":"Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo, J., … Wu, C. (2015). Mutations driving CLL and their evolution in progression and relapse. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature15395\">https://doi.org/10.1038/nature15395</a>","mla":"Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” <i>Nature</i>, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 525–30, doi:<a href=\"https://doi.org/10.1038/nature15395\">10.1038/nature15395</a>.","ista":"Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S, Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C, Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K, Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse. Nature. 526(7574), 525–530.","chicago":"Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” <i>Nature</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nature15395\">https://doi.org/10.1038/nature15395</a>."},"intvolume":"       526","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/"}],"_id":"1665","year":"2015","date_updated":"2021-01-12T06:52:23Z","issue":"7574","abstract":[{"lang":"eng","text":"Which genetic alterations drive tumorigenesis and how they evolve over the course of disease and therapy are central questions in cancer biology. Here we identify 44 recurrently mutated genes and 11 recurrent somatic copy number variations through whole-exome sequencing of 538 chronic lymphocytic leukaemia (CLL) and matched germline DNA samples, 278 of which were collected in a prospective clinical trial. These include previously unrecognized putative cancer drivers (RPS15, IKZF3), and collectively identify RNA processing and export, MYC activity, and MAPK signalling as central pathways involved in CLL. Clonality analysis of this large data set further enabled reconstruction of temporal relationships between driver events. Direct comparison between matched pre-treatment and relapse samples from 59 patients demonstrated highly frequent clonal evolution. Thus, large sequencing data sets of clinically informative samples enable the discovery of novel genes associated with cancer, the network of relationships between the driver events, and their impact on disease relapse and clinical outcome."}],"ec_funded":1,"month":"10","oa":1,"status":"public"},{"type":"journal_article","department":[{"_id":"NiBa"},{"_id":"CaGu"},{"_id":"GaTk"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"PLoS Genetics","date_created":"2018-12-11T11:53:21Z","quality_controlled":"1","volume":11,"related_material":{"record":[{"id":"9712","status":"public","relation":"research_data"},{"id":"1131","status":"public","relation":"dissertation_contains"}]},"pubrep_id":"463","publist_id":"5483","author":[{"orcid":"0000-0002-8523-0758","first_name":"Murat","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","last_name":"Tugrul","full_name":"Tugrul, Murat"},{"full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Tkacik, Gasper","first_name":"Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"file":[{"file_id":"4657","checksum":"a4e72fca5ccf40ddacf4d08c8e46b554","creator":"system","access_level":"open_access","file_name":"IST-2016-463-v1+1_journal.pgen.1005639.pdf","date_updated":"2020-07-14T12:45:10Z","date_created":"2018-12-12T10:07:58Z","content_type":"application/pdf","relation":"main_file","file_size":2580778}],"day":"06","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Public Library of Science","title":"Dynamics of transcription factor binding site evolution","oa_version":"Published Version","date_published":"2015-11-06T00:00:00Z","doi":"10.1371/journal.pgen.1005639","publication_status":"published","citation":{"short":"M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, PLoS Genetics 11 (2015).","ieee":"M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Dynamics of transcription factor binding site evolution,” <i>PLoS Genetics</i>, vol. 11, no. 11. Public Library of Science, 2015.","ama":"Tugrul M, Paixao T, Barton NH, Tkačik G. Dynamics of transcription factor binding site evolution. <i>PLoS Genetics</i>. 2015;11(11). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1005639\">10.1371/journal.pgen.1005639</a>","chicago":"Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Dynamics of Transcription Factor Binding Site Evolution.” <i>PLoS Genetics</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pgen.1005639\">https://doi.org/10.1371/journal.pgen.1005639</a>.","ista":"Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Dynamics of transcription factor binding site evolution. PLoS Genetics. 11(11).","apa":"Tugrul, M., Paixao, T., Barton, N. H., &#38; Tkačik, G. (2015). Dynamics of transcription factor binding site evolution. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1005639\">https://doi.org/10.1371/journal.pgen.1005639</a>","mla":"Tugrul, Murat, et al. “Dynamics of Transcription Factor Binding Site Evolution.” <i>PLoS Genetics</i>, vol. 11, no. 11, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1005639\">10.1371/journal.pgen.1005639</a>."},"intvolume":"        11","file_date_updated":"2020-07-14T12:45:10Z","scopus_import":1,"ddc":["576"],"_id":"1666","issue":"11","abstract":[{"lang":"eng","text":"Evolution of gene regulation is crucial for our understanding of the phenotypic differences between species, populations and individuals. Sequence-specific binding of transcription factors to the regulatory regions on the DNA is a key regulatory mechanism that determines gene expression and hence heritable phenotypic variation. We use a biophysical model for directional selection on gene expression to estimate the rates of gain and loss of transcription factor binding sites (TFBS) in finite populations under both point and insertion/deletion mutations. Our results show that these rates are typically slow for a single TFBS in an isolated DNA region, unless the selection is extremely strong. These rates decrease drastically with increasing TFBS length or increasingly specific protein-DNA interactions, making the evolution of sites longer than ∼ 10 bp unlikely on typical eukaryotic speciation timescales. Similarly, evolution converges to the stationary distribution of binding sequences very slowly, making the equilibrium assumption questionable. The availability of longer regulatory sequences in which multiple binding sites can evolve simultaneously, the presence of “pre-sites” or partially decayed old sites in the initial sequence, and biophysical cooperativity between transcription factors, can all facilitate gain of TFBS and reconcile theoretical calculations with timescales inferred from comparative genomics."}],"date_updated":"2023-09-07T11:53:49Z","year":"2015","month":"11","ec_funded":1,"status":"public","oa":1},{"intvolume":"      9259","citation":{"ista":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.","mla":"Brázdil, Tomáš, et al. <i>Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis</i>. Vol. 9259, Springer, 2015, pp. 141–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-22264-6_10\">10.1007/978-3-319-22264-6_10</a>.","apa":"Brázdil, T., Korenčiak, L., Krčál, J., Novotný, P., &#38; Řehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-319-22264-6_10\">https://doi.org/10.1007/978-3-319-22264-6_10</a>","chicago":"Brázdil, Tomáš, L’Uboš Korenčiak, Jan Krčál, Petr Novotný, and Vojtěch Řehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-22264-6_10\">https://doi.org/10.1007/978-3-319-22264-6_10</a>.","ama":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159. doi:<a href=\"https://doi.org/10.1007/978-3-319-22264-6_10\">10.1007/978-3-319-22264-6_10</a>","ieee":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.","short":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4777"}],"scopus_import":1,"date_published":"2015-08-22T00:00:00Z","oa_version":"Preprint","doi":"10.1007/978-3-319-22264-6_10","publication_status":"published","conference":{"start_date":"2015-09-01","name":"QEST: Quantitative Evaluation of Systems","end_date":"2015-09-03","location":"Madrid, Spain"},"ec_funded":1,"month":"08","oa":1,"status":"public","_id":"1667","year":"2015","abstract":[{"lang":"eng","text":"We consider parametric version of fixed-delay continuoustime Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimise expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of these parameters. To this end we identify and overcome several interesting phenomena arising in systems with fixed delays."}],"date_updated":"2021-01-12T06:52:24Z","volume":9259,"quality_controlled":"1","publist_id":"5482","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","page":"141 - 159","date_created":"2018-12-11T11:53:22Z","series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"title":"Optimizing performance of continuous-time stochastic systems using timeout synthesis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"full_name":"Korenčiak, L'Uboš","first_name":"L'Uboš","last_name":"Korenčiak"},{"full_name":"Krčál, Jan","last_name":"Krčál","first_name":"Jan"},{"full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"first_name":"Vojtěch","last_name":"Řehák","full_name":"Řehák, Vojtěch"}],"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"day":"22","acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n∘ [291734]. This work is partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by the EU 7th Framework Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the Czech Science Foundation, grant No. 15-17564S, and by the CAS/SAFEA International Partnership Program for Creative Research Teams."},{"conference":{"start_date":"2015-03-08","name":"FSE: Fast Software Encryption","end_date":"2015-03-11","location":"Istanbul, Turkey"},"publication_status":"published","doi":"10.1007/978-3-662-48116-5_16","oa_version":"Submitted Version","date_published":"2015-08-12T00:00:00Z","scopus_import":1,"main_file_link":[{"url":"http://eprint.iacr.org/2015/397","open_access":"1"}],"intvolume":"      9054","citation":{"chicago":"Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48116-5_16\">https://doi.org/10.1007/978-3-662-48116-5_16</a>.","apa":"Gazi, P., Lee, J., Seurin, Y., Steinberger, J., &#38; Tessaro, S. (2015). Relaxing full-codebook security: A refined analysis of key-length extension schemes. Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48116-5_16\">https://doi.org/10.1007/978-3-662-48116-5_16</a>","ista":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 9054, 319–341.","mla":"Gazi, Peter, et al. <i>Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes</i>. Vol. 9054, Springer, 2015, pp. 319–41, doi:<a href=\"https://doi.org/10.1007/978-3-662-48116-5_16\">10.1007/978-3-662-48116-5_16</a>.","short":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.","ieee":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook security: A refined analysis of key-length extension schemes,” vol. 9054. Springer, pp. 319–341, 2015.","ama":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 2015;9054:319-341. doi:<a href=\"https://doi.org/10.1007/978-3-662-48116-5_16\">10.1007/978-3-662-48116-5_16</a>"},"date_updated":"2020-08-11T10:09:26Z","abstract":[{"lang":"eng","text":"We revisit the security (as a pseudorandom permutation) of cascading-based constructions for block-cipher key-length extension. Previous works typically considered the extreme case where the adversary is given the entire codebook of the construction, the only complexity measure being the number qe of queries to the underlying ideal block cipher, representing adversary’s secret-key-independent computation. Here, we initiate a systematic study of the more natural case of an adversary restricted to adaptively learning a number qc of plaintext/ciphertext pairs that is less than the entire codebook. For any such qc, we aim to determine the highest number of block-cipher queries qe the adversary can issue without being able to successfully distinguish the construction (under a secret key) from a random permutation.\r\nMore concretely, we show the following results for key-length extension schemes using a block cipher with n-bit blocks and κ-bit keys:\r\nPlain cascades of length ℓ=2r+1 are secure whenever qcqre≪2r(κ+n), qc≪2κ and qe≪22κ. The bound for r=1 also applies to two-key triple encryption (as used within Triple DES).\r\nThe r-round XOR-cascade is secure as long as qcqre≪2r(κ+n), matching an attack by Gaži (CRYPTO 2013).\r\nWe fully characterize the security of Gaži and Tessaro’s two-call "}],"year":"2015","_id":"1668","status":"public","oa":1,"month":"08","ec_funded":1,"page":"319 - 341","date_created":"2018-12-11T11:53:22Z","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"publist_id":"5481","volume":9054,"quality_controlled":"1","day":"12","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter","full_name":"Gazi, Peter"},{"first_name":"Jooyoung","last_name":"Lee","full_name":"Lee, Jooyoung"},{"full_name":"Seurin, Yannick","last_name":"Seurin","first_name":"Yannick"},{"full_name":"Steinberger, John","first_name":"John","last_name":"Steinberger"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Relaxing full-codebook security: A refined analysis of key-length extension schemes","alternative_title":["LNCS"],"series_title":"Lecture Notes in Computer Science"},{"year":"2015","abstract":[{"lang":"eng","text":"Computational notions of entropy (a.k.a. pseudoentropy) have found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The most important tools to argue about pseudoentropy are chain rules, which quantify by how much (in terms of quantity and quality) the pseudoentropy of a given random variable X decreases when conditioned on some other variable Z (think for example of X as a secret key and Z as information leaked by a side-channel). In this paper we give a very simple and modular proof of the chain rule for HILL pseudoentropy, improving best known parameters. Our version allows for increasing the acceptable length of leakage in applications up to a constant factor compared to the best previous bounds. As a contribution of independent interest, we provide a comprehensive study of all known versions of the chain rule, comparing their worst-case strength and limitations."}],"date_updated":"2021-01-12T06:52:24Z","_id":"1669","oa":1,"status":"public","ec_funded":1,"month":"08","doi":"10.1007/978-3-319-22174-8_5","conference":{"start_date":"2015-08-23","name":"LATINCRYPT: Cryptology and Information Security in Latin America","end_date":"2015-08-26","location":"Guadalajara, Mexico"},"publication_status":"published","date_published":"2015-08-15T00:00:00Z","oa_version":"Submitted Version","ddc":["005"],"file_date_updated":"2020-07-14T12:45:11Z","scopus_import":1,"intvolume":"      9230","citation":{"chicago":"Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-22174-8_5\">https://doi.org/10.1007/978-3-319-22174-8_5</a>.","ista":"Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.","mla":"Pietrzak, Krzysztof Z., and Maciej Skórski. <i>The Chain Rule for HILL Pseudoentropy, Revisited</i>. Vol. 9230, Springer, 2015, pp. 81–98, doi:<a href=\"https://doi.org/10.1007/978-3-319-22174-8_5\">10.1007/978-3-319-22174-8_5</a>.","apa":"Pietrzak, K. Z., &#38; Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer. <a href=\"https://doi.org/10.1007/978-3-319-22174-8_5\">https://doi.org/10.1007/978-3-319-22174-8_5</a>","ieee":"K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.","ama":"Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98. doi:<a href=\"https://doi.org/10.1007/978-3-319-22174-8_5\">10.1007/978-3-319-22174-8_5</a>","short":"K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98."},"day":"15","file":[{"creator":"system","file_id":"5351","checksum":"8cd4215b83efba720e8cf27c23ff4781","access_level":"open_access","file_name":"IST-2016-669-v1+1_599.pdf","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:18:29Z","content_type":"application/pdf","relation":"main_file","file_size":443340}],"author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski"}],"project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"title":"The chain rule for HILL pseudoentropy, revisited","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"date_created":"2018-12-11T11:53:22Z","page":"81 - 98","has_accepted_license":"1","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","pubrep_id":"669","publist_id":"5480","quality_controlled":"1","volume":9230},{"ec_funded":1,"month":"06","title":"PDDL+ planning with hybrid automata: Foundations of translating must behavior","publisher":"AAAI Press","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1670","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"author":[{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy"},{"full_name":"Magazzeni, Daniele","first_name":"Daniele","last_name":"Magazzeni"},{"full_name":"Minopoli, Stefano","first_name":"Stefano","last_name":"Minopoli"},{"first_name":"Martin","last_name":"Wehrle","full_name":"Wehrle, Martin"}],"day":"01","year":"2015","date_updated":"2021-01-12T06:52:25Z","abstract":[{"lang":"eng","text":"Planning in hybrid domains poses a special challenge due to the involved mixed discrete-continuous dynamics. A recent solving approach for such domains is based on applying model checking techniques on a translation of PDDL+ planning problems to hybrid automata. However, the proposed translation is limited because must behavior is only overapproximated, and hence, processes and events are not reflected exactly. In this paper, we present the theoretical foundation of an exact PDDL+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions."}],"acknowledgement":"This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the Swiss National Science Foundation (SNSF) as part of the project “Automated Reformulation and Pruning in Factored State Spaces (ARAP)”.","citation":{"ieee":"S. Bogomolov, D. Magazzeni, S. Minopoli, and M. Wehrle, “PDDL+ planning with hybrid automata: Foundations of translating must behavior,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel, 2015, pp. 42–46.","ama":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. PDDL+ planning with hybrid automata: Foundations of translating must behavior. In: AAAI Press; 2015:42-46.","short":"S. Bogomolov, D. Magazzeni, S. Minopoli, M. Wehrle, in:, AAAI Press, 2015, pp. 42–46.","chicago":"Bogomolov, Sergiy, Daniele Magazzeni, Stefano Minopoli, and Martin Wehrle. “PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior,” 42–46. AAAI Press, 2015.","apa":"Bogomolov, S., Magazzeni, D., Minopoli, S., &#38; Wehrle, M. (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior (pp. 42–46). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel: AAAI Press.","ista":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. 2015. PDDL+ planning with hybrid automata: Foundations of translating must behavior. ICAPS: International Conference on Automated Planning and Scheduling, 42–46.","mla":"Bogomolov, Sergiy, et al. <i>PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior</i>. AAAI Press, 2015, pp. 42–46."},"quality_controlled":"1","publist_id":"5479","main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10606/10394"}],"scopus_import":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_published":"2015-06-01T00:00:00Z","type":"conference","oa_version":"None","date_created":"2018-12-11T11:53:23Z","page":"42 - 46","publication_status":"published","conference":{"end_date":"2015-06-11","location":"Jerusalem, Israel","start_date":"2015-06-07","name":"ICAPS: International Conference on Automated Planning and Scheduling"}},{"pubrep_id":"673","publist_id":"5478","quality_controlled":"1","volume":9215,"date_created":"2018-12-11T11:53:23Z","page":"368 - 387","has_accepted_license":"1","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","alternative_title":["LNCS"],"day":"01","file":[{"relation":"main_file","content_type":"application/pdf","file_size":592296,"file_name":"IST-2016-673-v1+1_053.pdf","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:10:38Z","creator":"system","file_id":"4827","checksum":"17d854227b3b753fd34f5d29e5b5a32e","access_level":"open_access"}],"author":[{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Tessaro, Stefano","first_name":"Stefano","last_name":"Tessaro"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"ddc":["004","005"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:11Z","citation":{"chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,” 9215:368–87. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">https://doi.org/10.1007/978-3-662-47989-6_18</a>.","mla":"Gazi, Peter, et al. <i>The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC</i>. Vol. 9215, Springer, 2015, pp. 368–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">10.1007/978-3-662-47989-6_18</a>.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">https://doi.org/10.1007/978-3-662-47989-6_18</a>","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215, 368–387.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","ama":"Gazi P, Pietrzak KZ, Tessaro S. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. In: Vol 9215. Springer; 2015:368-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">10.1007/978-3-662-47989-6_18</a>","ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp. 368–387."},"intvolume":"      9215","doi":"10.1007/978-3-662-47989-6_18","publication_status":"published","conference":{"location":"Santa Barbara, CA, United States","end_date":"2015-08-20","name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16"},"date_published":"2015-08-01T00:00:00Z","oa_version":"Submitted Version","oa":1,"status":"public","ec_funded":1,"month":"08","year":"2015","abstract":[{"text":"This paper studies the concrete security of PRFs and MACs obtained by keying hash functions based on the sponge paradigm. One such hash function is KECCAK, selected as NIST’s new SHA-3 standard. In contrast to other approaches like HMAC, the exact security of keyed sponges is not well understood. Indeed, recent security analyses delivered concrete security bounds which are far from existing attacks. This paper aims to close this gap. We prove (nearly) exact bounds on the concrete PRF security of keyed sponges using a random permutation. These bounds are tight for the most relevant ranges of parameters, i.e., for messages of length (roughly) l ≤ min{2n/4, 2r} blocks, where n is the state size and r is the desired output length; and for l ≤ q queries (to the construction or the underlying permutation). Moreover, we also improve standard-model bounds. As an intermediate step of independent interest, we prove tight bounds on the PRF security of the truncated CBC-MAC construction, which operates as plain CBC-MAC, but only returns a prefix of the output.","lang":"eng"}],"date_updated":"2021-01-12T06:52:25Z","_id":"1671"},{"type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"has_accepted_license":"1","date_created":"2018-12-11T11:53:23Z","page":"763 - 780","publication":"Advances in Cryptology - CRYPTO 2015","volume":9216,"quality_controlled":"1","publist_id":"5476","article_processing_charge":"No","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Ostrovsky, Rafail","first_name":"Rafail","last_name":"Ostrovsky"},{"last_name":"Zhou","first_name":"Hongsheng","full_name":"Zhou, Hongsheng"},{"first_name":"Vassilis","last_name":"Zikas","full_name":"Zikas, Vassilis"}],"file":[{"access_level":"open_access","file_id":"7853","checksum":"5b6649e80d1f781a8910f7cce6427f78","creator":"dernst","date_created":"2020-05-15T08:55:29Z","date_updated":"2020-07-14T12:45:11Z","file_name":"2015_CRYPTO_Alwen.pdf","file_size":397363,"relation":"main_file","content_type":"application/pdf"}],"acknowledgement":"Joël Alwen was supported by the ERC starting grant (259668-PSPC). Rafail Ostrovsky was supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, Lockheed-Martin Corporation Research Award, and the Defense Advanced Research Projects Agency through the U.S. Office of Naval Research under Contract N00014 -11 -1-0392. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government. Vassilis Zikas was supported in part by the Swiss National Science Foundation (SNF) via the Ambizione grant PZ00P-2142549.","day":"01","alternative_title":["LNCS"],"series_title":"Lecture Notes in Computer Science","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Incoercible multi-party computation and universally composable receipt-free voting","oa_version":"Submitted Version","date_published":"2015-08-01T00:00:00Z","publication_status":"published","conference":{"location":"Santa Barbara, CA, United States","end_date":"2015-08-20","name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16"},"doi":"10.1007/978-3-662-48000-7_37","citation":{"ista":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. Advances in Cryptology - CRYPTO 2015. CRYPTO: International Cryptology ConferenceLecture Notes in Computer Science, LNCS, vol. 9216, 763–780.","mla":"Alwen, Joel F., et al. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” <i>Advances in Cryptology - CRYPTO 2015</i>, vol. 9216, Springer, 2015, pp. 763–80, doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">10.1007/978-3-662-48000-7_37</a>.","apa":"Alwen, J. F., Ostrovsky, R., Zhou, H., &#38; Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In <i>Advances in Cryptology - CRYPTO 2015</i> (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">https://doi.org/10.1007/978-3-662-48000-7_37</a>","chicago":"Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” In <i>Advances in Cryptology - CRYPTO 2015</i>, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">https://doi.org/10.1007/978-3-662-48000-7_37</a>.","ieee":"J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in <i>Advances in Cryptology - CRYPTO 2015</i>, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.","ama":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. In: <i>Advances in Cryptology - CRYPTO 2015</i>. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">10.1007/978-3-662-48000-7_37</a>","short":"J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780."},"intvolume":"      9216","file_date_updated":"2020-07-14T12:45:11Z","scopus_import":"1","ddc":["000"],"_id":"1672","date_updated":"2022-06-07T09:51:55Z","abstract":[{"text":"Composable notions of incoercibility aim to forbid a coercer from using anything beyond the coerced parties’ inputs and outputs to catch them when they try to deceive him. Existing definitions are restricted to weak coercion types, and/or are not universally composable. Furthermore, they often make too strong assumptions on the knowledge of coerced parties—e.g., they assume they known the identities and/or the strategies of other coerced parties, or those of corrupted parties— which makes them unsuitable for applications of incoercibility such as e-voting, where colluding adversarial parties may attempt to coerce honest voters, e.g., by offering them money for a promised vote, and use their own view to check that the voter keeps his end of the bargain. In this work we put forward the first universally composable notion of incoercible multi-party computation, which satisfies the above intuition and does not assume collusions among coerced parties or knowledge of the corrupted set. We define natural notions of UC incoercibility corresponding to standard coercion-types, i.e., receipt-freeness and resistance to full-active coercion. Importantly, our suggested notion has the unique property that it builds on top of the well studied UC framework by Canetti instead of modifying it. This guarantees backwards compatibility, and allows us to inherit results from the rich UC literature. We then present MPC protocols which realize our notions of UC incoercibility given access to an arguably minimal setup—namely honestly generate tamper-proof hardware performing a very simple cryptographic operation—e.g., a smart card. This is, to our knowledge, the first proposed construction of an MPC protocol (for more than two parties) that is incoercibly secure and universally composable, and therefore the first construction of a universally composable receipt-free e-voting protocol.","lang":"eng"}],"year":"2015","month":"08","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"eisbn":["978-3-662-48000-7"],"isbn":["978-3-662-47999-5"]}},{"article_number":"20150114","_id":"1673","date_updated":"2021-01-12T06:52:26Z","abstract":[{"text":"When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement-that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two. ","lang":"eng"}],"issue":"2181","year":"2015","month":"09","ec_funded":1,"status":"public","oa":1,"oa_version":"Published Version","date_published":"2015-09-08T00:00:00Z","publication_status":"published","doi":"10.1098/rspa.2015.0114","intvolume":"       471","citation":{"short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. 2015;471(2181). doi:<a href=\"https://doi.org/10.1098/rspa.2015.0114\">10.1098/rspa.2015.0114</a>","ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 471, no. 2181. Royal Society of London, 2015.","chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London, 2015. <a href=\"https://doi.org/10.1098/rspa.2015.0114\">https://doi.org/10.1098/rspa.2015.0114</a>.","apa":"Adlam, B., Chatterjee, K., &#38; Nowak, M. (2015). Amplifiers of selection. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rspa.2015.0114\">https://doi.org/10.1098/rspa.2015.0114</a>","ista":"Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.","mla":"Adlam, Ben, et al. “Amplifiers of Selection.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:<a href=\"https://doi.org/10.1098/rspa.2015.0114\">10.1098/rspa.2015.0114</a>."},"scopus_import":1,"file_date_updated":"2020-07-14T12:45:11Z","ddc":["000"],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"author":[{"full_name":"Adlam, Ben","first_name":"Ben","last_name":"Adlam"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":391466,"creator":"kschuh","file_id":"6342","checksum":"e613d94d283c776322403a28aad11bdd","access_level":"open_access","file_name":"2015_rspa_Adlam.pdf","date_updated":"2020-07-14T12:45:11Z","date_created":"2019-04-18T12:39:56Z"}],"acknowledgement":"K.C. gratefully acknowledges support from ERC Start grant no. (279307: Graph Games), Austrian Science Fund (FWF) grant no. P23499-N23, and FWF NFN grant no. S11407-N23 (RiSE). ","day":"08","publisher":"Royal Society of London","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Amplifiers of selection","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"has_accepted_license":"1","date_created":"2018-12-11T11:53:24Z","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":471,"quality_controlled":"1","publist_id":"5477"},{"oa_version":"Preprint","type":"journal_article","date_published":"2015-09-01T00:00:00Z","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"doi":"10.1142/S0129055X1550018X","publication_status":"published","publication":"Reviews in Mathematical Physics","date_created":"2018-12-11T11:53:24Z","quality_controlled":"1","citation":{"short":"J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).","ieee":"J. Lee and K. Schnelli, “Edge universality for deformed Wigner matrices,” <i>Reviews in Mathematical Physics</i>, vol. 27, no. 8. World Scientific Publishing, 2015.","ama":"Lee J, Schnelli K. Edge universality for deformed Wigner matrices. <i>Reviews in Mathematical Physics</i>. 2015;27(8). doi:<a href=\"https://doi.org/10.1142/S0129055X1550018X\">10.1142/S0129055X1550018X</a>","chicago":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2015. <a href=\"https://doi.org/10.1142/S0129055X1550018X\">https://doi.org/10.1142/S0129055X1550018X</a>.","ista":"Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 27(8), 1550018.","mla":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” <i>Reviews in Mathematical Physics</i>, vol. 27, no. 8, 1550018, World Scientific Publishing, 2015, doi:<a href=\"https://doi.org/10.1142/S0129055X1550018X\">10.1142/S0129055X1550018X</a>.","apa":"Lee, J., &#38; Schnelli, K. (2015). Edge universality for deformed Wigner matrices. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129055X1550018X\">https://doi.org/10.1142/S0129055X1550018X</a>"},"intvolume":"        27","volume":27,"main_file_link":[{"url":"http://arxiv.org/abs/1407.8015","open_access":"1"}],"publist_id":"5475","scopus_import":1,"author":[{"first_name":"Jioon","last_name":"Lee","full_name":"Lee, Jioon"},{"full_name":"Schnelli, Kevin","last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","orcid":"0000-0003-0954-3231"}],"article_number":"1550018","_id":"1674","issue":"8","abstract":[{"lang":"eng","text":"We consider N × N random matrices of the form H = W + V where W is a real symmetric Wigner matrix and V a random or deterministic, real, diagonal matrix whose entries are independent of W. We assume subexponential decay for the matrix entries of W and we choose V so that the eigenvalues of W and V are typically of the same order. For a large class of diagonal matrices V, we show that the rescaled distribution of the extremal eigenvalues is given by the Tracy-Widom distribution F1 in the limit of large N. Our proofs also apply to the complex Hermitian setting, i.e. when W is a complex Hermitian Wigner matrix."}],"date_updated":"2021-01-12T06:52:26Z","year":"2015","day":"01","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"World Scientific Publishing","status":"public","oa":1,"title":"Edge universality for deformed Wigner matrices"},{"intvolume":"      9216","citation":{"ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. 2015;9216:585-605. doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">10.1007/978-3-662-48000-7_29</a>","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, 9216 (2015) 585–605.","ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.","mla":"Dziembowski, Stefan, et al. <i>Proofs of Space</i>. Vol. 9216, Springer, 2015, pp. 585–605, doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">10.1007/978-3-662-48000-7_29</a>.","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., &#38; Pietrzak, K. Z. (2015). Proofs of space. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">https://doi.org/10.1007/978-3-662-48000-7_29</a>","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">https://doi.org/10.1007/978-3-662-48000-7_29</a>."},"scopus_import":1,"oa_version":"None","date_published":"2015-08-01T00:00:00Z","publication_status":"published","conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","location":"Santa Barbara, CA, United States","end_date":"2015-08-20"},"doi":"10.1007/978-3-662-48000-7_29","month":"08","ec_funded":1,"status":"public","_id":"1675","date_updated":"2023-02-23T10:35:50Z","abstract":[{"text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble).","lang":"eng"}],"year":"2015","quality_controlled":"1","volume":9216,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2274"}]},"publist_id":"5474","pubrep_id":"671","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"},{"_id":"KrPi"}],"page":"585 - 605","date_created":"2018-12-11T11:53:24Z","alternative_title":["LNCS"],"series_title":"Lecture Notes in Computer Science","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Proofs of space","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"author":[{"full_name":"Dziembowski, Stefan","last_name":"Dziembowski","first_name":"Stefan"},{"last_name":"Faust","first_name":"Sebastian","full_name":"Faust, Sebastian"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"day":"01"},{"_id":"1676","author":[{"orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"last_name":"Raz","first_name":"Erez","full_name":"Raz, Erez"}],"day":"01","year":"2015","date_updated":"2021-01-12T06:52:27Z","issue":"10","month":"10","title":"Editorial overview: Cell adhesion and migration","status":"public","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"date_published":"2015-10-01T00:00:00Z","oa_version":"None","type":"journal_article","page":"4 - 6","date_created":"2018-12-11T11:53:25Z","publication":"Current Opinion in Cell Biology","publication_status":"published","doi":"10.1016/j.ceb.2015.09.004","citation":{"short":"M.K. Sixt, E. Raz, Current Opinion in Cell Biology 36 (2015) 4–6.","ieee":"M. K. Sixt and E. Raz, “Editorial overview: Cell adhesion and migration,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 4–6, 2015.","ama":"Sixt MK, Raz E. Editorial overview: Cell adhesion and migration. <i>Current Opinion in Cell Biology</i>. 2015;36(10):4-6. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">10.1016/j.ceb.2015.09.004</a>","mla":"Sixt, Michael K., and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 4–6, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">10.1016/j.ceb.2015.09.004</a>.","apa":"Sixt, M. K., &#38; Raz, E. (2015). Editorial overview: Cell adhesion and migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">https://doi.org/10.1016/j.ceb.2015.09.004</a>","ista":"Sixt MK, Raz E. 2015. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 36(10), 4–6.","chicago":"Sixt, Michael K, and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">https://doi.org/10.1016/j.ceb.2015.09.004</a>."},"volume":36,"intvolume":"        36","publist_id":"5473","scopus_import":1},{"doi":"10.1063/1.4932606","publication_status":"published","oa_version":"Preprint","date_published":"2015-10-09T00:00:00Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1506.04683","open_access":"1"}],"citation":{"ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301.","apa":"Alt, J. (2015). The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>","mla":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10, 103301, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>.","chicago":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>.","short":"J. Alt, Journal of Mathematical Physics 56 (2015).","ama":"Alt J. The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. 2015;56(10). doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>","ieee":"J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10. American Institute of Physics, 2015."},"intvolume":"        56","abstract":[{"lang":"eng","text":"We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale."}],"issue":"10","date_updated":"2023-09-07T12:38:08Z","year":"2015","article_number":"103301","_id":"1677","status":"public","oa":1,"month":"10","ec_funded":1,"publication":"Journal of Mathematical Physics","date_created":"2018-12-11T11:53:25Z","type":"journal_article","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"publist_id":"5472","volume":56,"quality_controlled":"1","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"day":"09","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes","full_name":"Alt, Johannes"}],"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Institute of Physics","title":"The local semicircle law for random matrices with a fourfold symmetry"},{"_id":"1678","year":"2015","date_updated":"2023-09-07T12:49:09Z","abstract":[{"lang":"eng","text":"High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes."}],"issue":"12","ec_funded":1,"month":"10","oa":1,"status":"public","date_published":"2015-10-12T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1038/nchembio.1933","citation":{"mla":"Inglés Prieto, Álvaro, et al. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 952–54, doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>.","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, Nowak M, Nijman S, Grusch M, Janovjak HL. 2015. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 11(12), 952–954.","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Muellner, M., Nowak, M., Nijman, S., Grusch, M., &#38; Janovjak, H. L. (2015). Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>","chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Markus Muellner, Matthias Nowak, Sebastian Nijman, Michael Grusch, and Harald L Janovjak. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>.","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, M. Muellner, M. Nowak, S. Nijman, M. Grusch, H.L. Janovjak, Nature Chemical Biology 11 (2015) 952–954.","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, et al. Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. 2015;11(12):952-954. doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>","ieee":"Á. Inglés Prieto <i>et al.</i>, “Light-assisted small-molecule screening against protein kinases,” <i>Nature Chemical Biology</i>, vol. 11, no. 12. Nature Publishing Group, pp. 952–954, 2015."},"intvolume":"        11","ddc":["571"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:12Z","file":[{"date_created":"2018-12-12T10:10:51Z","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf","date_updated":"2020-07-14T12:45:12Z","access_level":"open_access","file_id":"4842","creator":"system","checksum":"e9fb251dfcb7cd209b83f17867e61321","file_size":1308364,"relation":"main_file","content_type":"application/pdf"}],"project":[{"grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7"},{"name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Molecular Drug Targets","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Inglés Prieto, Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","last_name":"Inglés Prieto","orcid":"0000-0002-5409-8571","first_name":"Álvaro"},{"full_name":"Gschaider-Reichhart, Eva","first_name":"Eva","orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart"},{"full_name":"Muellner, Markus","first_name":"Markus","last_name":"Muellner"},{"full_name":"Nowak, Matthias","id":"30845DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Nowak","first_name":"Matthias"},{"last_name":"Nijman","first_name":"Sebastian","full_name":"Nijman, Sebastian"},{"full_name":"Grusch, Michael","first_name":"Michael","last_name":"Grusch"},{"first_name":"Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"}],"day":"12","acknowledgement":"This work was supported by grants from the European Union Seventh Framework Programme (CIG-303564 to H.J. and ERC-StG-311166 to S.M.B.N.), the Human Frontier Science Program (RGY0084_2012 to H.J.) and the Herzfelder Foundation (to M.G.). A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W 1232) and a FemTech fellowship (3580812 Austrian Research Promotion Agency).","title":"Light-assisted small-molecule screening against protein kinases","publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"type":"journal_article","page":"952 - 954","date_created":"2018-12-11T11:53:25Z","publication":"Nature Chemical Biology","has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"418"}]},"volume":11,"quality_controlled":"1","publist_id":"5471","pubrep_id":"837"},{"publication":"Physics of Fluids","date_created":"2018-12-11T11:53:26Z","has_accepted_license":"1","department":[{"_id":"BjHo"}],"language":[{"iso":"eng"}],"type":"journal_article","pubrep_id":"748","publist_id":"5469","volume":27,"quality_controlled":"1","day":"24","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","content_type":"application/pdf","file_size":872366,"file_name":"IST-2017-748-v1+1_1.4930850.pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:13:35Z","checksum":"604bba3c2496aadb3efcff77de01ce6c","file_id":"5019","creator":"system","access_level":"open_access"}],"author":[{"last_name":"Lemoult","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M","full_name":"Lemoult, Grégoire M"},{"last_name":"Maier","id":"384F7C04-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","full_name":"Maier, Philipp"},{"orcid":"0000-0003-2057-2754","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","full_name":"Hof, Björn"}],"title":"Taylor's Forest","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Institute of Physics","doi":"10.1063/1.4930850","publication_status":"published","date_published":"2015-09-24T00:00:00Z","oa_version":"Published Version","ddc":["532"],"file_date_updated":"2020-07-14T12:45:12Z","scopus_import":1,"intvolume":"        27","citation":{"chicago":"Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” <i>Physics of Fluids</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>.","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","apa":"Lemoult, G. M., Maier, P., &#38; Hof, B. (2015). Taylor’s Forest. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>","mla":"Lemoult, Grégoire M., et al. “Taylor’s Forest.” <i>Physics of Fluids</i>, vol. 27, no. 9, 091102, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>.","ama":"Lemoult GM, Maier P, Hof B. Taylor’s Forest. <i>Physics of Fluids</i>. 2015;27(9). doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>","ieee":"G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” <i>Physics of Fluids</i>, vol. 27, no. 9. American Institute of Physics, 2015.","short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015)."},"year":"2015","issue":"9","date_updated":"2021-01-12T06:52:28Z","_id":"1679","article_number":"091102","oa":1,"status":"public","month":"09"}]