[{"issue":"7574","abstract":[{"lang":"eng","text":"Over a century of research into the origin of turbulence in wall-bounded shear flows has resulted in a puzzling picture in which turbulence appears in a variety of different states competing with laminar background flow. At moderate flow speeds, turbulence is confined to localized patches; it is only at higher speeds that the entire flow becomes turbulent. The origin of the different states encountered during this transition, the front dynamics of the turbulent regions and the transformation to full turbulence have yet to be explained. By combining experiments, theory and computer simulations, here we uncover a bifurcation scenario that explains the transformation to fully turbulent pipe flow and describe the front dynamics of the different states encountered in the process. Key to resolving this problem is the interpretation of the flow as a bistable system with nonlinear propagation (advection) of turbulent fronts. These findings bridge the gap between our understanding of the onset of turbulence and fully turbulent flows."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 526","status":"public","title":"The rise of fully turbulent flow","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1664","day":"21","scopus_import":1,"date_published":"2015-10-21T00:00:00Z","page":"550 - 553","citation":{"chicago":"Barkley, Dwight, Baofang Song, Mukund Vasudevan, Grégoire M Lemoult, Marc Avila, and Björn Hof. “The Rise of Fully Turbulent Flow.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15701.","mla":"Barkley, Dwight, et al. “The Rise of Fully Turbulent Flow.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 550–53, doi:10.1038/nature15701.","short":"D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature 526 (2015) 550–553.","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.","apa":"Barkley, D., Song, B., Vasudevan, M., Lemoult, G. M., Avila, M., & Hof, B. (2015). The rise of fully turbulent flow. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15701","ieee":"D. Barkley, B. Song, M. Vasudevan, G. M. Lemoult, M. Avila, and B. Hof, “The rise of fully turbulent flow,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp. 550–553, 2015.","ama":"Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. The rise of fully turbulent flow. Nature. 2015;526(7574):550-553. doi:10.1038/nature15701"},"publication":"Nature","publist_id":"5485","ec_funded":1,"volume":526,"date_updated":"2021-01-12T06:52:22Z","date_created":"2018-12-11T11:53:20Z","author":[{"full_name":"Barkley, Dwight","last_name":"Barkley","first_name":"Dwight"},{"full_name":"Song, Baofang","last_name":"Song","first_name":"Baofang"},{"last_name":"Vasudevan","first_name":"Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","full_name":"Vasudevan, Mukund"},{"full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M","last_name":"Lemoult"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"},{"full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Nature Publishing Group","department":[{"_id":"BjHo"}],"publication_status":"published","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.","year":"2015","month":"10","language":[{"iso":"eng"}],"doi":"10.1038/nature15701","project":[{"call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.09143"}],"oa":1},{"publication_identifier":{"eisbn":["978-3-662-48000-7"],"isbn":["978-3-662-47999-5"]},"month":"08","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48000-7_37","conference":{"end_date":"2015-08-20","location":"Santa Barbara, CA, United States","start_date":"2015-08-16","name":"CRYPTO: International Cryptology Conference"},"ec_funded":1,"publist_id":"5476","file_date_updated":"2020-07-14T12:45:11Z","department":[{"_id":"KrPi"}],"publisher":"Springer","publication_status":"published","year":"2015","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.","volume":9216,"date_created":"2018-12-11T11:53:23Z","date_updated":"2022-06-07T09:51:55Z","author":[{"first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"last_name":"Ostrovsky","first_name":"Rafail","full_name":"Ostrovsky, Rafail"},{"first_name":"Hongsheng","last_name":"Zhou","full_name":"Zhou, Hongsheng"},{"first_name":"Vassilis","last_name":"Zikas","full_name":"Zikas, Vassilis"}],"series_title":"Lecture Notes in Computer Science","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","page":"763 - 780","citation":{"chicago":"Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” In Advances in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_37.","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.” Advances in Cryptology - CRYPTO 2015, vol. 9216, Springer, 2015, pp. 763–80, doi:10.1007/978-3-662-48000-7_37.","ieee":"J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in Advances in Cryptology - CRYPTO 2015, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.","apa":"Alwen, J. F., Ostrovsky, R., Zhou, H., & Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_37","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: Advances in Cryptology - CRYPTO 2015. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:10.1007/978-3-662-48000-7_37"},"publication":"Advances in Cryptology - CRYPTO 2015","date_published":"2015-08-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Composable notions of incoercibility aim to forbid a coercer from using anything beyond the coerced parties’ inputs and outputs to catch them when they try to deceive him. Existing definitions are restricted to weak coercion types, and/or are not universally composable. Furthermore, they often make too strong assumptions on the knowledge of coerced parties—e.g., they assume they known the identities and/or the strategies of other coerced parties, or those of corrupted parties— which makes them unsuitable for applications of incoercibility such as e-voting, where colluding adversarial parties may attempt to coerce honest voters, e.g., by offering them money for a promised vote, and use their own view to check that the voter keeps his end of the bargain. In this work we put forward the first universally composable notion of incoercible multi-party computation, which satisfies the above intuition and does not assume collusions among coerced parties or knowledge of the corrupted set. We define natural notions of UC incoercibility corresponding to standard coercion-types, i.e., receipt-freeness and resistance to full-active coercion. Importantly, our suggested notion has the unique property that it builds on top of the well studied UC framework by Canetti instead of modifying it. This guarantees backwards compatibility, and allows us to inherit results from the rich UC literature. We then present MPC protocols which realize our notions of UC incoercibility given access to an arguably minimal setup—namely honestly generate tamper-proof hardware performing a very simple cryptographic operation—e.g., a smart card. This is, to our knowledge, the first proposed construction of an MPC protocol (for more than two parties) that is incoercibly secure and universally composable, and therefore the first construction of a universally composable receipt-free e-voting protocol.","lang":"eng"}],"intvolume":" 9216","title":"Incoercible multi-party computation and universally composable receipt-free voting","ddc":["000"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1672","file":[{"access_level":"open_access","file_name":"2015_CRYPTO_Alwen.pdf","creator":"dernst","content_type":"application/pdf","file_size":397363,"file_id":"7853","relation":"main_file","checksum":"5b6649e80d1f781a8910f7cce6427f78","date_created":"2020-05-15T08:55:29Z","date_updated":"2020-07-14T12:45:11Z"}],"oa_version":"Submitted Version"},{"alternative_title":["LNCS"],"type":"conference","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."}],"title":"The chain rule for HILL pseudoentropy, revisited","status":"public","ddc":["005"],"intvolume":" 9230","_id":"1669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2016-669-v1+1_599.pdf","content_type":"application/pdf","file_size":443340,"creator":"system","relation":"main_file","file_id":"5351","checksum":"8cd4215b83efba720e8cf27c23ff4781","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:18:29Z"}],"pubrep_id":"669","series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"15","has_accepted_license":"1","page":"81 - 98","citation":{"ama":"Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98. doi:10.1007/978-3-319-22174-8_5","ieee":"K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.","apa":"Pietrzak, K. Z., & 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. https://doi.org/10.1007/978-3-319-22174-8_5","ista":"Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.","short":"K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.","mla":"Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.","chicago":"Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22174-8_5."},"date_published":"2015-08-15T00:00:00Z","file_date_updated":"2020-07-14T12:45:11Z","publist_id":"5480","ec_funded":1,"publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2015","date_created":"2018-12-11T11:53:22Z","date_updated":"2021-01-12T06:52:24Z","volume":9230,"author":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"month":"08","quality_controlled":"1","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"LATINCRYPT: Cryptology and Information Security in Latin America","start_date":"2015-08-23","location":"Guadalajara, Mexico","end_date":"2015-08-26"},"doi":"10.1007/978-3-319-22174-8_5"},{"has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2015-08-01T00:00:00Z","citation":{"apa":"Gazi, P., Pietrzak, K. Z., & 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. https://doi.org/10.1007/978-3-662-47989-6_18","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.","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:10.1007/978-3-662-47989-6_18","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. https://doi.org/10.1007/978-3-662-47989-6_18.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","mla":"Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18."},"page":"368 - 387","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"}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"673","oa_version":"Submitted Version","file":[{"checksum":"17d854227b3b753fd34f5d29e5b5a32e","date_created":"2018-12-12T10:10:38Z","date_updated":"2020-07-14T12:45:11Z","file_id":"4827","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":592296,"access_level":"open_access","file_name":"IST-2016-673-v1+1_053.pdf"}],"_id":"1671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9215","status":"public","title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","ddc":["004","005"],"month":"08","doi":"10.1007/978-3-662-47989-6_18","conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","start_date":"2015-08-16","end_date":"2015-08-20"},"language":[{"iso":"eng"}],"oa":1,"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","publist_id":"5478","ec_funded":1,"file_date_updated":"2020-07-14T12:45:11Z","author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Tessaro, Stefano","first_name":"Stefano","last_name":"Tessaro"}],"volume":9215,"date_created":"2018-12-11T11:53:23Z","date_updated":"2021-01-12T06:52:25Z","year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published"},{"type":"journal_article","abstract":[{"text":"When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement-that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two. ","lang":"eng"}],"issue":"2181","status":"public","ddc":["000"],"title":"Amplifiers of selection","intvolume":" 471","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1673","file":[{"file_name":"2015_rspa_Adlam.pdf","access_level":"open_access","content_type":"application/pdf","file_size":391466,"creator":"kschuh","relation":"main_file","file_id":"6342","date_created":"2019-04-18T12:39:56Z","date_updated":"2020-07-14T12:45:11Z","checksum":"e613d94d283c776322403a28aad11bdd"}],"oa_version":"Published Version","scopus_import":1,"day":"08","has_accepted_license":"1","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","citation":{"ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181. Royal Society of London, 2015.","apa":"Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2015.0114","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.","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181). doi:10.1098/rspa.2015.0114","chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.","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.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114."},"date_published":"2015-09-08T00:00:00Z","article_number":"20150114","file_date_updated":"2020-07-14T12:45:11Z","publist_id":"5477","ec_funded":1,"publication_status":"published","publisher":"Royal Society of London","department":[{"_id":"KrCh"}],"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). ","year":"2015","date_created":"2018-12-11T11:53:24Z","date_updated":"2021-01-12T06:52:26Z","volume":471,"author":[{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"month":"09","quality_controlled":"1","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1098/rspa.2015.0114"}]