[{"author":[{"first_name":"Foteini","last_name":"Baldimtsi","full_name":"Baldimtsi, Foteini"},{"last_name":"Chase","first_name":"Melissa","full_name":"Chase, Melissa"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"},{"full_name":"Kohlweiss, Markulf","first_name":"Markulf","last_name":"Kohlweiss"}],"oa_version":"Published Version","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","volume":9020,"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"isbn":["978-3-662-46446-5"]},"status":"public","main_file_link":[{"url":"https://doi.org/10.1007/978-3-662-46447-2_5","open_access":"1"}],"_id":"1651","type":"conference","date_created":"2018-12-11T11:53:15Z","conference":{"name":"PKC: Public Key Crypography","location":"Gaithersburg, MD, United States","start_date":"2015-03-30","end_date":"2015-04-01"},"ec_funded":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Baldimtsi, F., Chase, M., Fuchsbauer, G., &#38; Kohlweiss, M. (2015). Anonymous transferable e-cash. In <i>Public-Key Cryptography - PKC 2015</i> (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>","ista":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS, vol. 9020, 101–124.","chicago":"Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.” In <i>Public-Key Cryptography - PKC 2015</i>, 9020:101–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>.","ama":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash. In: <i>Public-Key Cryptography - PKC 2015</i>. Vol 9020. Springer; 2015:101-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>","ieee":"F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable e-cash,” in <i>Public-Key Cryptography - PKC 2015</i>, Gaithersburg, MD, United States, 2015, vol. 9020, pp. 101–124.","short":"F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography - PKC 2015, Springer, 2015, pp. 101–124.","mla":"Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” <i>Public-Key Cryptography - PKC 2015</i>, vol. 9020, Springer, 2015, pp. 101–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>."},"department":[{"_id":"KrPi"}],"date_updated":"2022-05-23T10:08:37Z","title":"Anonymous transferable e-cash","date_published":"2015-03-17T00:00:00Z","publisher":"Springer","publication_status":"published","abstract":[{"text":"Cryptographic e-cash allows off-line electronic transactions between a bank, users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions has been proposed in the literature; however, these traditional e-cash schemes only allow coins to be transferred once between users and merchants. Ideally, we would like users to be able to transfer coins between each other multiple times before deposit, as happens with physical cash. “Transferable” e-cash schemes are the solution to this problem. Unfortunately, the currently proposed schemes are either completely impractical or do not achieve the desirable anonymity properties without compromises, such as assuming the existence of a trusted “judge” who can trace all coins and users in the system. This paper presents the first efficient and fully anonymous transferable e-cash scheme without any trusted third parties. We start by revising the security and anonymity properties of transferable e-cash to capture issues that were previously overlooked. For our construction we use the recently proposed malleable signatures by Chase et al. to allow the secure and anonymous transfer of coins, combined with a new efficient double-spending detection mechanism. Finally, we discuss an instantiation of our construction.","lang":"eng"}],"day":"17","doi":"10.1007/978-3-662-46447-2_5","page":"101 - 124","year":"2015","acknowledgement":"Work done as an intern in Microsoft Research Redmond and as a student at Brown University, where supported by NSF grant 0964379. Supported by the European Research Council, ERC Starting Grant (259668-PSPC).","oa":1,"publication":"Public-Key Cryptography - PKC 2015","publist_id":"5499","intvolume":"      9020","scopus_import":"1"},{"_id":"1652","type":"conference","oa":1,"date_created":"2018-12-11T11:53:16Z","day":"01","year":"2015","status":"public","main_file_link":[{"url":"http://eprint.iacr.org/2014/238","open_access":"1"}],"page":"595 - 603","doi":"10.1145/2746539.2746622","scopus_import":1,"publication":"Proceedings of the 47th annual ACM symposium on Theory of computing","publist_id":"5498","conference":{"start_date":"2015-06-14","end_date":"2015-06-17","name":"STOC: Symposium on the Theory of Computing","location":"Portland, OR, United States"},"ec_funded":1,"oa_version":"Submitted Version","citation":{"mla":"Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>, ACM, 2015, pp. 595–603, doi:<a href=\"https://doi.org/10.1145/2746539.2746622\">10.1145/2746539.2746622</a>.","short":"J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.","chicago":"Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” In <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>, 595–603. ACM, 2015. <a href=\"https://doi.org/10.1145/2746539.2746622\">https://doi.org/10.1145/2746539.2746622</a>.","ista":"Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 595–603.","ama":"Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>. ACM; 2015:595-603. doi:<a href=\"https://doi.org/10.1145/2746539.2746622\">10.1145/2746539.2746622</a>","apa":"Alwen, J. F., &#38; Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In <i>Proceedings of the 47th annual ACM symposium on Theory of computing</i> (pp. 595–603). Portland, OR, United States: ACM. <a href=\"https://doi.org/10.1145/2746539.2746622\">https://doi.org/10.1145/2746539.2746622</a>","ieee":"J. F. Alwen and V. Serbinenko, “High parallel complexity graphs and memory-hard functions,” in <i>Proceedings of the 47th annual ACM symposium on Theory of computing</i>, Portland, OR, United States, 2015, pp. 595–603."},"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:52:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"last_name":"Serbinenko","first_name":"Vladimir","full_name":"Serbinenko, Vladimir"}],"month":"06","publication_status":"published","abstract":[{"text":"We develop new theoretical tools for proving lower-bounds on the (amortized) complexity of certain functions in models of parallel computation. We apply the tools to construct a class of functions with high amortized memory complexity in the parallel Random Oracle Model (pROM); a variant of the standard ROM allowing for batches of simultaneous queries. In particular we obtain a new, more robust, type of Memory-Hard Functions (MHF); a security primitive which has recently been gaining acceptance in practice as an effective means of countering brute-force attacks on security relevant functions. Along the way we also demonstrate an important shortcoming of previous definitions of MHFs and give a new definition addressing the problem. The tools we develop represent an adaptation of the powerful pebbling paradigm (initially introduced by Hewitt and Paterson [HP70] and Cook [Coo73]) to a simple and intuitive parallel setting. We define a simple pebbling game Gp over graphs which aims to abstract parallel computation in an intuitive way. As a conceptual contribution we define a measure of pebbling complexity for graphs called cumulative complexity (CC) and show how it overcomes a crucial shortcoming (in the parallel setting) exhibited by more traditional complexity measures used in the past. As a main technical contribution we give an explicit construction of a constant in-degree family of graphs whose CC in Gp approaches maximality to within a polylogarithmic factor for any graph of equal size (analogous to the graphs of Tarjan et. al. [PTC76, LT82] for sequential pebbling games). Finally, for a given graph G and related function fG, we derive a lower-bound on the amortized memory complexity of fG in the pROM in terms of the CC of G in the game Gp.","lang":"eng"}],"title":"High parallel complexity graphs and memory-hard functions","date_published":"2015-06-01T00:00:00Z","publisher":"ACM","language":[{"iso":"eng"}]},{"doi":"10.1007/978-3-662-48800-3_4","day":"30","page":"85 - 109","year":"2015","oa":1,"intvolume":"      9453","publist_id":"5496","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"mla":"Gazi, Peter, et al. <i>Generic Security of NMAC and HMAC with Input Whitening</i>. Vol. 9453, Springer, 2015, pp. 85–109, doi:<a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">10.1007/978-3-662-48800-3_4</a>.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.","ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">https://doi.org/10.1007/978-3-662-48800-3_4</a>","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security of NMAC and HMAC with Input Whitening.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">https://doi.org/10.1007/978-3-662-48800-3_4</a>.","ama":"Gazi P, Pietrzak KZ, Tessaro S. Generic security of NMAC and HMAC with input whitening. 2015;9453:85-109. doi:<a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">10.1007/978-3-662-48800-3_4</a>"},"date_updated":"2021-01-12T06:52:16Z","department":[{"_id":"KrPi"}],"title":"Generic security of NMAC and HMAC with input whitening","publisher":"Springer","date_published":"2015-12-30T00:00:00Z","file_date_updated":"2020-07-14T12:45:08Z","ddc":["004","005"],"series_title":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"HMAC and its variant NMAC are the most popular approaches to deriving a MAC (and more generally, a PRF) from a cryptographic hash function. Despite nearly two decades of research, their exact security still remains far from understood in many different contexts. Indeed, recent works have re-surfaced interest for {\\em generic} attacks, i.e., attacks that treat the compression function of the underlying hash function as a black box.\r\n\r\nGeneric security can be proved in a model where the underlying compression function is modeled as a random function -- yet, to date, the question of proving tight, non-trivial bounds on the generic security of HMAC/NMAC even as a PRF remains a challenging open question.\r\n\r\nIn this paper, we ask the question of whether a small modification to HMAC and NMAC can allow us to exactly characterize the security of the resulting constructions, while only incurring little penalty with respect to efficiency. To this end, we present simple variants of NMAC and HMAC, for which we prove tight bounds on the generic PRF security, expressed in terms of numbers of construction and compression function queries necessary to break the construction. All of our constructions are obtained via a (near) {\\em black-box} modification of NMAC and HMAC, which can be interpreted as an initial step of key-dependent message pre-processing.\r\n\r\nWhile our focus is on PRF security, a further attractive feature of our new constructions is that they clearly defeat all recent generic attacks against properties such as state recovery and universal forgery. These exploit properties of the so-called ``functional graph'' which are not directly accessible in our new constructions. "}],"publication_status":"published","status":"public","type":"conference","_id":"1654","date_created":"2018-12-11T11:53:17Z","ec_funded":1,"conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","location":"Auckland, New Zealand","end_date":"2015-12-03","start_date":"2015-11-29"},"pubrep_id":"676","author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","first_name":"Peter","last_name":"Gazi"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefano","last_name":"Tessaro","full_name":"Tessaro, Stefano"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"volume":9453,"language":[{"iso":"eng"}],"file":[{"checksum":"d1e53203db2d8573a560995ccdffac62","file_id":"4732","creator":"system","access_level":"open_access","file_size":512071,"relation":"main_file","file_name":"IST-2016-676-v1+1_881.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:09:09Z","date_updated":"2020-07-14T12:45:08Z"}],"month":"12","has_accepted_license":"1"},{"page":"7266 - 7297","day":"23","doi":"10.3390/e17107266","year":"2015","acknowledgement":"This work was supported by the DFG priority program 1527 (Autonomous Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734.","oa":1,"publication":"Entropy","publist_id":"5495","intvolume":"        17","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"ieee":"G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous robots,” <i>Entropy</i>, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.","ista":"Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots. Entropy. 17(10), 7266–7297.","ama":"Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots. <i>Entropy</i>. 2015;17(10):7266-7297. doi:<a href=\"https://doi.org/10.3390/e17107266\">10.3390/e17107266</a>","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” <i>Entropy</i>. MDPI, 2015. <a href=\"https://doi.org/10.3390/e17107266\">https://doi.org/10.3390/e17107266</a>.","apa":"Martius, G. S., &#38; Olbrich, E. (2015). Quantifying emergent behavior of autonomous robots. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e17107266\">https://doi.org/10.3390/e17107266</a>","short":"G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297.","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” <i>Entropy</i>, vol. 17, no. 10, MDPI, 2015, pp. 7266–97, doi:<a href=\"https://doi.org/10.3390/e17107266\">10.3390/e17107266</a>."},"department":[{"_id":"ChLa"},{"_id":"GaTk"}],"date_updated":"2023-10-17T11:42:00Z","title":"Quantifying emergent behavior of autonomous robots","file_date_updated":"2020-07-14T12:45:08Z","date_published":"2015-10-23T00:00:00Z","publisher":"MDPI","ddc":["000"],"publication_status":"published","abstract":[{"lang":"eng","text":"Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration."}],"status":"public","_id":"1655","type":"journal_article","date_created":"2018-12-11T11:53:17Z","ec_funded":1,"pubrep_id":"464","author":[{"last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","full_name":"Martius, Georg S"},{"full_name":"Olbrich, Eckehard","first_name":"Eckehard","last_name":"Olbrich"}],"oa_version":"Published Version","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","volume":17,"article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:12:25Z","file_name":"IST-2016-464-v1+1_entropy-17-07266.pdf","relation":"main_file","creator":"system","file_id":"4943","checksum":"945d99631a96e0315acb26dc8541dcf9","file_size":6455007,"access_level":"open_access"}],"issue":"10","has_accepted_license":"1","month":"10"},{"oa":1,"acknowledgement":"A technical report of the article is available at: https://research-explorer.app.ist.ac.at/record/5439","day":"01","year":"2015","page":"750 - 761","doi":"10.1109/LICS.2015.74","related_material":{"record":[{"relation":"earlier_version","id":"5439","status":"public"}]},"scopus_import":1,"publist_id":"5491","publication":"LICS","date_updated":"2023-02-23T12:26:27Z","department":[{"_id":"ToHe"}],"citation":{"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>.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 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.","short":"U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.","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>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"publication_status":"published","ddc":["000"],"series_title":"Logic in Computer Science","file_date_updated":"2020-07-14T12:45:10Z","date_published":"2015-07-01T00:00:00Z","publisher":"IEEE","title":"The target discounted-sum problem","date_created":"2018-12-11T11:53:19Z","type":"conference","_id":"1659","publication_identifier":{"issn":["1043-6871 "],"eisbn":["978-1-4799-8875-4 "]},"status":"public","ec_funded":1,"conference":{"name":"LICS: Logic in Computer Science","location":"Kyoto, Japan","end_date":"2015-07-10","start_date":"2015-007-06"},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"has_accepted_license":"1","month":"07","file":[{"relation":"main_file","creator":"dernst","checksum":"6abebca9c1a620e9e103a8f9222befac","file_id":"7852","file_size":340215,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:10Z","date_created":"2020-05-15T08:53:29Z","file_name":"2015_LICS_Boker.pdf"}],"language":[{"iso":"eng"}],"article_processing_charge":"No"},{"type":"conference","_id":"1660","date_created":"2018-12-11T11:53:19Z","oa":1,"doi":"10.1109/LICS.2015.15","page":"44 - 55","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1505.02655"}],"year":"2015","status":"public","day":"01","scopus_import":1,"ec_funded":1,"publist_id":"5490","conference":{"start_date":"2015-07-06","end_date":"2015-07-10","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"citation":{"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>.","short":"T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.","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.","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.","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>.","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>"},"oa_version":"Preprint","date_updated":"2021-01-12T06:52:20Z","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LICS"],"author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"full_name":"Kiefer, Stefan","last_name":"Kiefer","first_name":"Stefan"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr"}],"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"}],"publication_status":"published","month":"07","title":"Long-run average behaviour of probabilistic vector addition systems","language":[{"iso":"eng"}],"publisher":"IEEE","date_published":"2015-07-01T00:00:00Z"},{"citation":{"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>.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","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>","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>.","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.","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>"},"date_updated":"2025-06-02T08:53:41Z","department":[{"_id":"KrCh"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"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.","lang":"eng"}],"publication_status":"published","title":"Improved algorithms for one-pair and k-pair Streett objectives","date_published":"2015-07-01T00:00:00Z","publisher":"IEEE","oa":1,"doi":"10.1109/LICS.2015.34","year":"2015","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.","related_material":{"record":[{"status":"public","id":"464","relation":"later_version"}]},"scopus_import":"1","publication":"Proceedings - Symposium on Logic in Computer Science","publist_id":"5489","oa_version":"Submitted Version","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"quality_controlled":"1","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"article_number":"7174888","month":"07","article_processing_charge":"No","volume":"2015-July","language":[{"iso":"eng"}],"_id":"1661","type":"conference","date_created":"2018-12-11T11:53:19Z","main_file_link":[{"url":"https://eprints.cs.univie.ac.at/4368/","open_access":"1"}],"status":"public","ec_funded":1,"conference":{"end_date":"2015-07-10","start_date":"2015-07-06","name":"LICS: Logic in Computer Science","location":"Kyoto, Japan"}},{"scopus_import":1,"publist_id":"5485","intvolume":"       526","publication":"Nature","oa":1,"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.","page":"550 - 553","year":"2015","doi":"10.1038/nature15701","day":"21","publication_status":"published","abstract":[{"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.","lang":"eng"}],"date_published":"2015-10-21T00:00:00Z","publisher":"Nature Publishing Group","title":"The rise of fully turbulent flow","department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T06:52:22Z","citation":{"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>","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>.","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.","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.","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>.","short":"D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature 526 (2015) 550–553."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_created":"2018-12-11T11:53:20Z","_id":"1664","type":"journal_article","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.09143"}],"month":"10","issue":"7574","language":[{"iso":"eng"}],"volume":526,"quality_controlled":"1","project":[{"name":"Decoding the complexity of turbulence at its origin","grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Preprint","author":[{"last_name":"Barkley","first_name":"Dwight","full_name":"Barkley, Dwight"},{"first_name":"Baofang","last_name":"Song","full_name":"Song, Baofang"},{"full_name":"Vasudevan, Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","first_name":"Mukund","last_name":"Vasudevan"},{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","full_name":"Lemoult, Grégoire M","first_name":"Grégoire M","last_name":"Lemoult"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754"}]},{"abstract":[{"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.","lang":"eng"}],"publication_status":"published","date_published":"2015-10-22T00:00:00Z","publisher":"Nature Publishing Group","pmid":1,"title":"Mutations driving CLL and their evolution in progression and relapse","date_updated":"2021-01-12T06:52:23Z","department":[{"_id":"KrCh"}],"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.","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>.","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.","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.","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>","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>.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["26466571"]},"scopus_import":1,"intvolume":"       526","publist_id":"5484","publication":"Nature","oa":1,"doi":"10.1038/nature15395","page":"525 - 530","year":"2015","day":"22","month":"10","issue":"7574","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":526,"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"first_name":"Dan","last_name":"Landau","full_name":"Landau, Dan"},{"first_name":"Eugen","last_name":"Tausch","full_name":"Tausch, Eugen"},{"full_name":"Taylor Weiner, Amaro","first_name":"Amaro","last_name":"Taylor Weiner"},{"full_name":"Stewart, Chip","first_name":"Chip","last_name":"Stewart"},{"full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","last_name":"Reiter","first_name":"Johannes"},{"full_name":"Bahlo, Jasmin","last_name":"Bahlo","first_name":"Jasmin"},{"full_name":"Kluth, Sandra","first_name":"Sandra","last_name":"Kluth"},{"first_name":"Ivana","last_name":"Božić","full_name":"Božić, Ivana"},{"last_name":"Lawrence","first_name":"Michael","full_name":"Lawrence, Michael"},{"full_name":"Böttcher, Sebastian","last_name":"Böttcher","first_name":"Sebastian"},{"first_name":"Scott","last_name":"Carter","full_name":"Carter, Scott"},{"last_name":"Cibulskis","first_name":"Kristian","full_name":"Cibulskis, Kristian"},{"full_name":"Mertens, Daniel","last_name":"Mertens","first_name":"Daniel"},{"last_name":"Sougnez","first_name":"Carrie","full_name":"Sougnez, Carrie"},{"full_name":"Rosenberg, Mara","first_name":"Mara","last_name":"Rosenberg"},{"first_name":"Julian","last_name":"Hess","full_name":"Hess, Julian"},{"full_name":"Edelmann, Jennifer","first_name":"Jennifer","last_name":"Edelmann"},{"last_name":"Kless","first_name":"Sabrina","full_name":"Kless, Sabrina"},{"full_name":"Kneba, Michael","last_name":"Kneba","first_name":"Michael"},{"full_name":"Ritgen, Matthias","first_name":"Matthias","last_name":"Ritgen"},{"full_name":"Fink, Anna","first_name":"Anna","last_name":"Fink"},{"full_name":"Fischer, Kirsten","last_name":"Fischer","first_name":"Kirsten"},{"last_name":"Gabriel","first_name":"Stacey","full_name":"Gabriel, Stacey"},{"full_name":"Lander, Eric","first_name":"Eric","last_name":"Lander"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"last_name":"Döhner","first_name":"Hartmut","full_name":"Döhner, Hartmut"},{"last_name":"Hallek","first_name":"Michael","full_name":"Hallek, Michael"},{"first_name":"Donna","last_name":"Neuberg","full_name":"Neuberg, Donna"},{"first_name":"Gad","last_name":"Getz","full_name":"Getz, Gad"},{"full_name":"Stilgenbauer, Stephan","last_name":"Stilgenbauer","first_name":"Stephan"},{"full_name":"Wu, Catherine","first_name":"Catherine","last_name":"Wu"}],"ec_funded":1,"date_created":"2018-12-11T11:53:21Z","_id":"1665","type":"journal_article","article_type":"original","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/"}],"status":"public"},{"citation":{"short":"M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, PLoS Genetics 11 (2015).","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>.","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.","ista":"Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Dynamics of transcription factor binding site evolution. PLoS Genetics. 11(11).","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>.","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>"},"date_updated":"2023-09-07T11:53:49Z","department":[{"_id":"NiBa"},{"_id":"CaGu"},{"_id":"GaTk"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","title":"Dynamics of transcription factor binding site evolution","date_published":"2015-11-06T00:00:00Z","file_date_updated":"2020-07-14T12:45:10Z","publisher":"Public Library of Science","oa":1,"doi":"10.1371/journal.pgen.1005639","year":"2015","day":"06","related_material":{"record":[{"status":"public","id":"9712","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"1131"}]},"scopus_import":1,"publication":"PLoS Genetics","intvolume":"        11","publist_id":"5483","oa_version":"Published Version","project":[{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"quality_controlled":"1","author":[{"id":"37C323C6-F248-11E8-B48F-1D18A9856A87","full_name":"Tugrul, Murat","first_name":"Murat","last_name":"Tugrul","orcid":"0000-0002-8523-0758"},{"first_name":"Tiago","last_name":"Paixao","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"orcid":"0000-0002-6699-1455","first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"issue":"11","file":[{"file_name":"IST-2016-463-v1+1_journal.pgen.1005639.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:10Z","date_created":"2018-12-12T10:07:58Z","creator":"system","file_id":"4657","checksum":"a4e72fca5ccf40ddacf4d08c8e46b554","file_size":2580778,"access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","month":"11","volume":11,"language":[{"iso":"eng"}],"_id":"1666","type":"journal_article","date_created":"2018-12-11T11:53:21Z","status":"public","pubrep_id":"463","ec_funded":1},{"scopus_import":1,"publist_id":"5482","intvolume":"      9259","oa":1,"doi":"10.1007/978-3-319-22264-6_10","page":"141 - 159","day":"22","year":"2015","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.","series_title":"Lecture Notes in Computer Science","publication_status":"published","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."}],"title":"Optimizing performance of continuous-time stochastic systems using timeout synthesis","publisher":"Springer","date_published":"2015-08-22T00:00:00Z","citation":{"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>.","short":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159.","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.","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>.","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.","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>","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>"},"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:52:24Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Madrid, Spain","name":"QEST: Quantitative Evaluation of Systems","end_date":"2015-09-03","start_date":"2015-09-01"},"ec_funded":1,"type":"conference","_id":"1667","date_created":"2018-12-11T11:53:22Z","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1407.4777","open_access":"1"}],"month":"08","volume":9259,"language":[{"iso":"eng"}],"oa_version":"Preprint","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Korenčiak","first_name":"L'Uboš","full_name":"Korenčiak, L'Uboš"},{"last_name":"Krčál","first_name":"Jan","full_name":"Krčál, Jan"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny"},{"full_name":"Řehák, Vojtěch","first_name":"Vojtěch","last_name":"Řehák"}]},{"author":[{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi"},{"full_name":"Lee, Jooyoung","last_name":"Lee","first_name":"Jooyoung"},{"last_name":"Seurin","first_name":"Yannick","full_name":"Seurin, Yannick"},{"full_name":"Steinberger, John","first_name":"John","last_name":"Steinberger"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"oa_version":"Submitted Version","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"quality_controlled":"1","volume":9054,"language":[{"iso":"eng"}],"month":"08","status":"public","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2015/397"}],"type":"conference","_id":"1668","date_created":"2018-12-11T11:53:22Z","conference":{"location":"Istanbul, Turkey","name":"FSE: Fast Software Encryption","end_date":"2015-03-11","start_date":"2015-03-08"},"ec_funded":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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>.","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>","short":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 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>."},"department":[{"_id":"KrPi"}],"date_updated":"2020-08-11T10:09:26Z","title":"Relaxing full-codebook security: A refined analysis of key-length extension schemes","date_published":"2015-08-12T00:00:00Z","publisher":"Springer","series_title":"Lecture Notes in Computer Science","publication_status":"published","abstract":[{"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 ","lang":"eng"}],"page":"319 - 341","doi":"10.1007/978-3-662-48116-5_16","year":"2015","day":"12","oa":1,"publist_id":"5481","intvolume":"      9054","scopus_import":1},{"conference":{"start_date":"2015-08-23","end_date":"2015-08-26","location":"Guadalajara, Mexico","name":"LATINCRYPT: Cryptology and Information Security in Latin America"},"ec_funded":1,"pubrep_id":"669","status":"public","date_created":"2018-12-11T11:53:22Z","type":"conference","_id":"1669","language":[{"iso":"eng"}],"volume":9230,"month":"08","has_accepted_license":"1","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:18:29Z","date_updated":"2020-07-14T12:45:11Z","file_name":"IST-2016-669-v1+1_599.pdf","relation":"main_file","file_id":"5351","checksum":"8cd4215b83efba720e8cf27c23ff4781","creator":"system","access_level":"open_access","file_size":443340}],"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"project":[{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","oa_version":"Submitted Version","publist_id":"5480","intvolume":"      9230","scopus_import":1,"day":"15","year":"2015","page":"81 - 98","doi":"10.1007/978-3-319-22174-8_5","oa":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:45:11Z","date_published":"2015-08-15T00:00:00Z","title":"The chain rule for HILL pseudoentropy, revisited","publication_status":"published","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."}],"ddc":["005"],"series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:52:24Z","citation":{"short":"K.Z. Pietrzak, M. Skórski, 9230 (2015) 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>.","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>","ista":"Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.","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>.","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>"}},{"scopus_import":1,"intvolume":"      9215","publist_id":"5478","oa":1,"year":"2015","page":"368 - 387","doi":"10.1007/978-3-662-47989-6_18","day":"01","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"}],"publication_status":"published","ddc":["004","005"],"publisher":"Springer","file_date_updated":"2020-07-14T12:45:11Z","date_published":"2015-08-01T00:00:00Z","title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","date_updated":"2021-01-12T06:52:25Z","department":[{"_id":"KrPi"}],"citation":{"short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","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>.","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.","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.","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>.","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>","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"pubrep_id":"673","ec_funded":1,"conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","end_date":"2015-08-20","start_date":"2015-08-16"},"date_created":"2018-12-11T11:53:23Z","type":"conference","_id":"1671","status":"public","has_accepted_license":"1","month":"08","file":[{"relation":"main_file","file_id":"4827","checksum":"17d854227b3b753fd34f5d29e5b5a32e","creator":"system","access_level":"open_access","file_size":592296,"content_type":"application/pdf","date_created":"2018-12-12T10:10:38Z","date_updated":"2020-07-14T12:45:11Z","file_name":"IST-2016-673-v1+1_053.pdf"}],"language":[{"iso":"eng"}],"volume":9215,"quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"oa_version":"Submitted Version","author":[{"last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Tessaro, Stefano","first_name":"Stefano","last_name":"Tessaro"}]},{"year":"2015","day":"01","page":"763 - 780","doi":"10.1007/978-3-662-48000-7_37","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.","oa":1,"publication":"Advances in Cryptology - CRYPTO 2015","intvolume":"      9216","publist_id":"5476","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"short":"J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 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>.","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.","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>","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."},"date_updated":"2022-06-07T09:51:55Z","department":[{"_id":"KrPi"}],"title":"Incoercible multi-party computation and universally composable receipt-free voting","publisher":"Springer","date_published":"2015-08-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:11Z","series_title":"Lecture Notes in Computer Science","ddc":["000"],"abstract":[{"lang":"eng","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."}],"publication_status":"published","publication_identifier":{"isbn":["978-3-662-47999-5"],"eisbn":["978-3-662-48000-7"]},"status":"public","_id":"1672","type":"conference","date_created":"2018-12-11T11:53:23Z","ec_funded":1,"conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","end_date":"2015-08-20","start_date":"2015-08-16"},"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F"},{"last_name":"Ostrovsky","first_name":"Rafail","full_name":"Ostrovsky, Rafail"},{"first_name":"Hongsheng","last_name":"Zhou","full_name":"Zhou, Hongsheng"},{"last_name":"Zikas","first_name":"Vassilis","full_name":"Zikas, Vassilis"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"article_processing_charge":"No","volume":9216,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_size":397363,"access_level":"open_access","creator":"dernst","checksum":"5b6649e80d1f781a8910f7cce6427f78","file_id":"7853","date_updated":"2020-07-14T12:45:11Z","date_created":"2020-05-15T08:55:29Z","content_type":"application/pdf","file_name":"2015_CRYPTO_Alwen.pdf"}],"month":"08","has_accepted_license":"1"},{"ec_funded":1,"type":"journal_article","_id":"1673","date_created":"2018-12-11T11:53:24Z","status":"public","article_number":"20150114","file":[{"date_created":"2019-04-18T12:39:56Z","date_updated":"2020-07-14T12:45:11Z","content_type":"application/pdf","file_name":"2015_rspa_Adlam.pdf","relation":"main_file","access_level":"open_access","file_size":391466,"file_id":"6342","checksum":"e613d94d283c776322403a28aad11bdd","creator":"kschuh"}],"issue":"2181","has_accepted_license":"1","month":"09","volume":471,"language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"quality_controlled":"1","author":[{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"scopus_import":1,"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","publist_id":"5477","intvolume":"       471","oa":1,"year":"2015","doi":"10.1098/rspa.2015.0114","day":"08","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). ","ddc":["000"],"publication_status":"published","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"}],"title":"Amplifiers of selection","file_date_updated":"2020-07-14T12:45:11Z","publisher":"Royal Society of London","date_published":"2015-09-08T00:00:00Z","citation":{"short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).","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>.","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>","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>.","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>","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.","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."},"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:52:26Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8015"}],"doi":"10.1142/S0129055X1550018X","status":"public","year":"2015","day":"01","_id":"1674","type":"journal_article","oa":1,"date_created":"2018-12-11T11:53:24Z","publication":"Reviews in Mathematical Physics","intvolume":"        27","publist_id":"5475","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jioon","last_name":"Lee","full_name":"Lee, Jioon"},{"first_name":"Kevin","last_name":"Schnelli","orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","full_name":"Schnelli, Kevin"}],"citation":{"short":"J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).","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>.","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>","ista":"Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 27(8), 1550018.","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>.","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>","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."},"oa_version":"Preprint","date_updated":"2021-01-12T06:52:26Z","quality_controlled":"1","department":[{"_id":"LaEr"}],"title":"Edge universality for deformed Wigner matrices","volume":27,"publisher":"World Scientific Publishing","date_published":"2015-09-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"8","article_number":"1550018","abstract":[{"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.","lang":"eng"}],"month":"09","publication_status":"published"},{"publication":"Journal of Mathematical Physics","publist_id":"5472","intvolume":"        56","scopus_import":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"149"}]},"day":"09","year":"2015","doi":"10.1063/1.4932606","oa":1,"title":"The local semicircle law for random matrices with a fourfold symmetry","date_published":"2015-10-09T00:00:00Z","publisher":"American Institute of Physics","publication_status":"published","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>.","short":"J. Alt, Journal of Mathematical Physics 56 (2015).","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>","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>","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>.","ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301.","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."},"department":[{"_id":"LaEr"}],"date_updated":"2023-09-07T12:38:08Z","ec_funded":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.04683"}],"status":"public","type":"journal_article","_id":"1677","date_created":"2018-12-11T11:53:25Z","volume":56,"language":[{"iso":"eng"}],"article_number":"103301","issue":"10","month":"10","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes"}],"oa_version":"Preprint","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1"},{"has_accepted_license":"1","month":"10","file":[{"relation":"main_file","creator":"system","file_id":"4842","checksum":"e9fb251dfcb7cd209b83f17867e61321","file_size":1308364,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:10:51Z","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf"}],"issue":"12","language":[{"iso":"eng"}],"volume":11,"project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)"},{"call_identifier":"FWF","name":"Molecular Drug Targets","_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto","first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7218-7738","last_name":"Gschaider-Reichhart","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Muellner","first_name":"Markus","full_name":"Muellner, Markus"},{"first_name":"Matthias","last_name":"Nowak","id":"30845DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Nowak, Matthias"},{"last_name":"Nijman","first_name":"Sebastian","full_name":"Nijman, Sebastian"},{"last_name":"Grusch","first_name":"Michael","full_name":"Grusch, Michael"},{"first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"}],"pubrep_id":"837","ec_funded":1,"date_created":"2018-12-11T11:53:25Z","type":"journal_article","_id":"1678","status":"public","publication_status":"published","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."}],"ddc":["571"],"date_published":"2015-10-12T00:00:00Z","file_date_updated":"2020-07-14T12:45:12Z","publisher":"Nature Publishing Group","title":"Light-assisted small-molecule screening against protein kinases","department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"date_updated":"2023-09-07T12:49:09Z","citation":{"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.","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>.","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>.","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.","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>","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>","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"418","status":"public"}]},"publist_id":"5471","intvolume":"        11","publication":"Nature Chemical Biology","oa":1,"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).","day":"12","doi":"10.1038/nchembio.1933","year":"2015","page":"952 - 954"},{"volume":27,"language":[{"iso":"eng"}],"issue":"9","article_number":"091102","file":[{"file_name":"IST-2017-748-v1+1_1.4930850.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:13:35Z","creator":"system","checksum":"604bba3c2496aadb3efcff77de01ce6c","file_id":"5019","file_size":872366,"access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","month":"09","author":[{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","full_name":"Lemoult, Grégoire M","last_name":"Lemoult","first_name":"Grégoire M"},{"last_name":"Maier","first_name":"Philipp","full_name":"Maier, Philipp","id":"384F7C04-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn"}],"oa_version":"Published Version","quality_controlled":"1","pubrep_id":"748","status":"public","type":"journal_article","_id":"1679","date_created":"2018-12-11T11:53:26Z","title":"Taylor's Forest","publisher":"American Institute of Physics","date_published":"2015-09-24T00:00:00Z","file_date_updated":"2020-07-14T12:45:12Z","ddc":["532"],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","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>.","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>","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.","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>.","short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015)."},"date_updated":"2021-01-12T06:52:28Z","department":[{"_id":"BjHo"}],"publication":"Physics of Fluids","intvolume":"        27","publist_id":"5469","scopus_import":1,"year":"2015","day":"24","doi":"10.1063/1.4930850","oa":1}]