[{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"07","citation":{"chicago":"Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.","mla":"Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.","short":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018).","ista":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.","ieee":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","apa":"Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-02721-8","ama":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8"},"publication":"Nature Communications","date_published":"2018-02-07T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"Direct reciprocity is a mechanism for cooperation among humans. Many of our daily interactions are repeated. We interact repeatedly with our family, friends, colleagues, members of the local and even global community. In the theory of repeated games, it is a tacit assumption that the various games that a person plays simultaneously have no effect on each other. Here we introduce a general framework that allows us to analyze “crosstalk” between a player’s concurrent games. In the presence of crosstalk, the action a person experiences in one game can alter the person’s decision in another. We find that crosstalk impedes the maintenance of cooperation and requires stronger levels of forgiveness. The magnitude of the effect depends on the population structure. In more densely connected social groups, crosstalk has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract crosstalk. The crosstalk framework provides a unified interpretation of direct and upstream reciprocity in the context of repeated games.","lang":"eng"}],"intvolume":" 9","status":"public","title":"Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness","ddc":["004"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"454","file":[{"checksum":"b6b90367545b4c615891c960ab0567f1","date_created":"2018-12-12T10:09:18Z","date_updated":"2020-07-14T12:46:31Z","file_id":"4741","relation":"main_file","creator":"system","file_size":843646,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf"}],"oa_version":"Published Version","pubrep_id":"964","month":"02","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":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000424318200001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41467-017-02721-8","article_number":"555","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"publist_id":"7368","file_date_updated":"2020-07-14T12:46:31Z","publisher":"Nature Publishing Group","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"This work was supported by the European Research Council (ERC) start grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23 (C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.) and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported in part by\r\na gift from B Wu and Eric Larson.","year":"2018","volume":9,"date_updated":"2023-09-11T12:51:03Z","date_created":"2018-12-11T11:46:34Z","author":[{"full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes","last_name":"Reiter"},{"first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"first_name":"David","last_name":"Rand","full_name":"Rand, David"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}]},{"abstract":[{"lang":"eng","text":"Fast-spiking, parvalbumin-expressing GABAergic interneurons (PV+-BCs) express a complex machinery of rapid signaling mechanisms, including specialized voltage-gated ion channels to generate brief action potentials (APs). However, short APs are associated with overlapping Na+ and K+ fluxes and are therefore energetically expensive. How the potentially vicious combination of high AP frequency and inefficient spike generation can be reconciled with limited energy supply is presently unclear. To address this question, we performed direct recordings from the PV+-BC axon, the subcellular structure where active conductances for AP initiation and propagation are located. Surprisingly, the energy required for the AP was, on average, only ∼1.6 times the theoretical minimum. High energy efficiency emerged from the combination of fast inactivation of Na+ channels and delayed activation of Kv3-type K+ channels, which minimized ion flux overlap during APs. Thus, the complementary tuning of axonal Na+ and K+ channel gating optimizes both fast signaling properties and metabolic efficiency. Hu et al. demonstrate that action potentials in parvalbumin-expressing GABAergic interneuron axons are energetically efficient, which is highly unexpected given their brief duration. High energy efficiency emerges from the combination of fast inactivation of voltage-gated Na+ channels and delayed activation of Kv3 channels in the axon. "}],"issue":"1","type":"journal_article","file":[{"creator":"dernst","content_type":"application/pdf","file_size":3180444,"file_name":"2018_Neuron_Hu.pdf","access_level":"open_access","date_created":"2018-12-17T10:37:50Z","date_updated":"2020-07-14T12:46:03Z","checksum":"76070f3729f9c603e1080d0151aa2b11","file_id":"5690","relation":"main_file"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"320","ddc":["570"],"title":"Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons","status":"public","intvolume":" 98","day":"04","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","date_published":"2018-04-04T00:00:00Z","publication":"Neuron","citation":{"chicago":"Hu, Hua, Fabian Roth, David H Vandael, and Peter M Jonas. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” Neuron. Elsevier, 2018. https://doi.org/10.1016/j.neuron.2018.02.024.","short":"H. Hu, F. Roth, D.H. Vandael, P.M. Jonas, Neuron 98 (2018) 156–165.","mla":"Hu, Hua, et al. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” Neuron, vol. 98, no. 1, Elsevier, 2018, pp. 156–65, doi:10.1016/j.neuron.2018.02.024.","ieee":"H. Hu, F. Roth, D. H. Vandael, and P. M. Jonas, “Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons,” Neuron, vol. 98, no. 1. Elsevier, pp. 156–165, 2018.","apa":"Hu, H., Roth, F., Vandael, D. H., & Jonas, P. M. (2018). Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.02.024","ista":"Hu H, Roth F, Vandael DH, Jonas PM. 2018. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 98(1), 156–165.","ama":"Hu H, Roth F, Vandael DH, Jonas PM. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 2018;98(1):156-165. doi:10.1016/j.neuron.2018.02.024"},"page":"156 - 165","file_date_updated":"2020-07-14T12:46:03Z","ec_funded":1,"publist_id":"7545","author":[{"full_name":"Hu, Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","first_name":"Hua","last_name":"Hu"},{"last_name":"Roth","first_name":"Fabian","full_name":"Roth, Fabian"},{"id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676","first_name":"David H","last_name":"Vandael","full_name":"Vandael, David H"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/a-certain-type-of-neurons-is-more-energy-efficient-than-previously-assumed/","relation":"press_release","description":"News on IST Homepage"}]},"date_created":"2018-12-11T11:45:48Z","date_updated":"2023-09-11T12:45:10Z","volume":98,"year":"2018","publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Elsevier","month":"04","doi":"10.1016/j.neuron.2018.02.024","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000429192100016"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020"},{"grant_number":"P24909-B24","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312"}]},{"citation":{"mla":"Payne, Pavel, et al. “CRISPR-Based Herd Immunity Can Limit Phage Epidemics in Bacterial Populations.” ELife, vol. 7, e32035, eLife Sciences Publications, 2018, doi:10.7554/eLife.32035.","short":"P. Payne, L. Geyrhofer, N.H. Barton, J.P. Bollback, ELife 7 (2018).","chicago":"Payne, Pavel, Lukas Geyrhofer, Nicholas H Barton, and Jonathan P Bollback. “CRISPR-Based Herd Immunity Can Limit Phage Epidemics in Bacterial Populations.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.32035.","ama":"Payne P, Geyrhofer L, Barton NH, Bollback JP. CRISPR-based herd immunity can limit phage epidemics in bacterial populations. eLife. 2018;7. doi:10.7554/eLife.32035","ista":"Payne P, Geyrhofer L, Barton NH, Bollback JP. 2018. CRISPR-based herd immunity can limit phage epidemics in bacterial populations. eLife. 7, e32035.","ieee":"P. Payne, L. Geyrhofer, N. H. Barton, and J. P. Bollback, “CRISPR-based herd immunity can limit phage epidemics in bacterial populations,” eLife, vol. 7. eLife Sciences Publications, 2018.","apa":"Payne, P., Geyrhofer, L., Barton, N. H., & Bollback, J. P. (2018). CRISPR-based herd immunity can limit phage epidemics in bacterial populations. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.32035"},"publication":"eLife","date_published":"2018-03-09T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"09","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"423","intvolume":" 7","ddc":["576"],"title":"CRISPR-based herd immunity can limit phage epidemics in bacterial populations","status":"public","file":[{"date_created":"2018-12-17T10:36:07Z","date_updated":"2020-07-14T12:46:25Z","checksum":"447cf6e680bdc3c01062a8737d876569","file_id":"5689","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3533881,"file_name":"2018_eLife_Payne.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Herd immunity, a process in which resistant individuals limit the spread of a pathogen among susceptible hosts has been extensively studied in eukaryotes. Even though bacteria have evolved multiple immune systems against their phage pathogens, herd immunity in bacteria remains unexplored. Here we experimentally demonstrate that herd immunity arises during phage epidemics in structured and unstructured Escherichia coli populations consisting of differing frequencies of susceptible and resistant cells harboring CRISPR immunity. In addition, we develop a mathematical model that quantifies how herd immunity is affected by spatial population structure, bacterial growth rate, and phage replication rate. Using our model we infer a general epidemiological rule describing the relative speed of an epidemic in partially resistant spatially structured populations. Our experimental and theoretical findings indicate that herd immunity may be important in bacterial communities, allowing for stable coexistence of bacteria and their phages and the maintenance of polymorphism in bacterial immunity.","lang":"eng"}],"external_id":{"isi":["000431035800001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"doi":"10.7554/eLife.32035","language":[{"iso":"eng"}],"month":"03","acknowledgement":"We are grateful to Remy Chait for his help and assistance with establishing our experimental setups and to Tobias Bergmiller for valuable insights into some specific experimental details. We thank Luciano Marraffini for donating us the pCas9 plasmid used in this study. We also want to express our gratitude to Seth Barribeau, Andrea Betancourt, Călin Guet, Mato Lagator, Tiago Paixão and Maroš Pleška for valuable discussions on the manuscript. Finally, we would like to thank the \r\neditors and reviewers for their helpful comments and suggestions.","year":"2018","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"publisher":"eLife Sciences Publications","publication_status":"published","related_material":{"record":[{"relation":"research_data","status":"public","id":"9840"}]},"author":[{"full_name":"Payne, Pavel","orcid":"0000-0002-2711-9453","id":"35F78294-F248-11E8-B48F-1D18A9856A87","last_name":"Payne","first_name":"Pavel"},{"last_name":"Geyrhofer","first_name":"Lukas","full_name":"Geyrhofer, Lukas"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","first_name":"Jonathan P","last_name":"Bollback","full_name":"Bollback, Jonathan P"}],"volume":7,"date_updated":"2023-09-11T12:49:17Z","date_created":"2018-12-11T11:46:23Z","article_number":"e32035","ec_funded":1,"publist_id":"7400","file_date_updated":"2020-07-14T12:46:25Z"},{"oa_version":"Preprint","_id":"5791","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Crossing minimization in perturbed drawings","abstract":[{"lang":"eng","text":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a “compromised” drawing by a piecewise linear map φ:G → ℝ. We wish to perturb φ by an arbitrarily small ε>0 into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An ε-perturbation, for every ε>0, is given by a piecewise linear map (Formula Presented), where with ||·|| is the uniform norm (i.e., sup norm). We present a polynomial-time solution for this optimization problem when G is a cycle and the map φ has no spurs (i.e., no two adjacent edges are mapped to overlapping arcs). We also show that the problem becomes NP-complete (i) when G is an arbitrary graph and φ has no spurs, and (ii) when φ may have spurs and G is a cycle or a union of disjoint paths."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2018-12-18T00:00:00Z","citation":{"ama":"Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282. Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16","apa":"Fulek, R., & Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the Graph Drawing and Network Visualization, Barcelona, Spain: Springer. https://doi.org/10.1007/978-3-030-04414-5_16","ieee":"R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241.","ista":"Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.","short":"R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.","mla":"Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.","chicago":"Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,” 11282:229–41. Springer, 2018. https://doi.org/10.1007/978-3-030-04414-5_16."},"page":"229-241","article_processing_charge":"No","day":"18","scopus_import":"1","author":[{"last_name":"Fulek","first_name":"Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav"},{"full_name":"Tóth, Csaba D.","last_name":"Tóth","first_name":"Csaba D."}],"volume":"11282 ","date_updated":"2023-09-11T12:49:55Z","date_created":"2018-12-30T22:59:15Z","year":"2018","department":[{"_id":"UlWa"}],"publisher":"Springer","publication_status":"published","doi":"10.1007/978-3-030-04414-5_16","conference":{"name":"Graph Drawing and Network Visualization","start_date":"2018-09-26","location":"Barcelona, Spain","end_date":"2018-09-28"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1808.07608","open_access":"1"}],"external_id":{"arxiv":["1808.07608"],"isi":["000672802500016"]},"oa":1,"quality_controlled":"1","isi":1,"publication_identifier":{"isbn":["9783030044138"]},"month":"12"},{"issue":"5","abstract":[{"text":"Over the past decade, the edge of chaos has proven to be a fruitful starting point for investigations of shear flows when the laminar base flow is linearly stable. Numerous computational studies of shear flows demonstrated the existence of states that separate laminar and turbulent regions of the state space. In addition, some studies determined invariant solutions that reside on this edge. In this paper, we study the unstable manifold of one such solution with the aid of continuous symmetry reduction, which we formulate here for the simultaneous quotiening of axial and azimuthal symmetries. Upon our investigation of the unstable manifold, we discover a previously unknown traveling-wave solution on the laminar-turbulent boundary with a relatively complex structure. By means of low-dimensional projections, we visualize different dynamical paths that connect these solutions to the turbulence. Our numerical experiments demonstrate that the laminar-turbulent boundary exhibits qualitatively different regions whose properties are influenced by the nearby invariant solutions.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","_id":"291","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 3","title":"Complexity of the laminar-turbulent boundary in pipe flow","status":"public","article_processing_charge":"No","day":"30","scopus_import":"1","date_published":"2018-05-30T00:00:00Z","citation":{"ama":"Budanur NB, Hof B. Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. 2018;3(5). doi:10.1103/PhysRevFluids.3.054401","apa":"Budanur, N. B., & Hof, B. (2018). Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.3.054401","ieee":"N. B. Budanur and B. Hof, “Complexity of the laminar-turbulent boundary in pipe flow,” Physical Review Fluids, vol. 3, no. 5. American Physical Society, 2018.","ista":"Budanur NB, Hof B. 2018. Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. 3(5), 054401.","short":"N.B. Budanur, B. Hof, Physical Review Fluids 3 (2018).","mla":"Budanur, Nazmi B., and Björn Hof. “Complexity of the Laminar-Turbulent Boundary in Pipe Flow.” Physical Review Fluids, vol. 3, no. 5, 054401, American Physical Society, 2018, doi:10.1103/PhysRevFluids.3.054401.","chicago":"Budanur, Nazmi B, and Björn Hof. “Complexity of the Laminar-Turbulent Boundary in Pipe Flow.” Physical Review Fluids. American Physical Society, 2018. https://doi.org/10.1103/PhysRevFluids.3.054401."},"publication":"Physical Review Fluids","publist_id":"7590","article_number":"054401","author":[{"full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"volume":3,"date_created":"2018-12-11T11:45:39Z","date_updated":"2023-09-11T12:45:44Z","year":"2018","publisher":"American Physical Society","department":[{"_id":"BjHo"}],"publication_status":"published","month":"05","doi":"10.1103/PhysRevFluids.3.054401","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.01918"}],"external_id":{"arxiv":["1802.01918"],"isi":["000433426200001"]},"quality_controlled":"1","isi":1}]