[{"publication_identifier":{"issn":["01795376"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1007/s00454-017-9900-0","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07907"}],"external_id":{"arxiv":["1602.07907"]},"publist_id":"7283","volume":58,"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-21T17:01:34Z","related_material":{"record":[{"id":"1379","relation":"earlier_version","status":"public"}]},"author":[{"first_name":"Benjamin","last_name":"Burton","full_name":"Burton, Benjamin"},{"full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"}],"publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2017","article_processing_charge":"No","day":"09","scopus_import":1,"date_published":"2017-06-09T00:00:00Z","page":"871 - 888","article_type":"original","citation":{"mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017."},"publication":"Discrete & Computational Geometry","issue":"4","abstract":[{"text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 58","status":"public","title":"Finding non-orientable surfaces in 3-Manifolds","_id":"534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1002/ange.201611998","quality_controlled":"1","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets","call_identifier":"FWF"}],"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,"month":"05","date_updated":"2021-01-12T08:01:33Z","date_created":"2018-12-11T11:47:02Z","volume":129,"author":[{"full_name":"Kainrath, Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","last_name":"Kainrath","first_name":"Stephanie"},{"first_name":"Manuela","last_name":"Stadler","full_name":"Stadler, Manuela"},{"full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","first_name":"Eva","orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Distel","full_name":"Distel, Martin"},{"full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak"}],"publication_status":"published","department":[{"_id":"CaGu"},{"_id":"HaJa"}],"publisher":"Wiley","year":"2017","file_date_updated":"2020-07-14T12:46:39Z","ec_funded":1,"publist_id":"7279","date_published":"2017-05-20T00:00:00Z","page":"4679 - 4682","publication":"Angewandte Chemie","citation":{"ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998."},"day":"20","has_accepted_license":"1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","creator":"system","file_size":1668557,"content_type":"application/pdf","file_id":"5007","relation":"main_file","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","date_created":"2018-12-12T10:13:24Z","date_updated":"2020-07-14T12:46:39Z"}],"pubrep_id":"932","status":"public","title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","ddc":["571"],"intvolume":" 129","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"538","abstract":[{"text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. ","lang":"ger"}],"issue":"16","type":"journal_article"},{"type":"journal_article","abstract":[{"text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.","lang":"eng"}],"issue":"12","title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","status":"public","ddc":["576","616"],"intvolume":" 13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"540","file":[{"creator":"system","content_type":"application/pdf","file_size":4106772,"access_level":"open_access","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","date_created":"2018-12-12T10:12:26Z","date_updated":"2020-07-14T12:46:44Z","file_id":"4944","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"931","scopus_import":1,"day":"01","has_accepted_license":"1","publication":"PLoS Pathogens","citation":{"mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758.","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017."},"date_published":"2017-12-01T00:00:00Z","article_number":"e1006758","file_date_updated":"2020-07-14T12:46:44Z","publist_id":"7276","publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"GaNo"}],"year":"2017","date_created":"2018-12-11T11:47:03Z","date_updated":"2021-01-12T08:01:48Z","volume":13,"author":[{"full_name":"Khamina, Kseniya","last_name":"Khamina","first_name":"Kseniya"},{"full_name":"Lercher, Alexander","first_name":"Alexander","last_name":"Lercher"},{"full_name":"Caldera, Michael","last_name":"Caldera","first_name":"Michael"},{"first_name":"Christopher","last_name":"Schliehe","full_name":"Schliehe, Christopher"},{"first_name":"Bojan","last_name":"Vilagos","full_name":"Vilagos, Bojan"},{"full_name":"Sahin, Mehmet","first_name":"Mehmet","last_name":"Sahin"},{"full_name":"Kosack, Lindsay","first_name":"Lindsay","last_name":"Kosack"},{"last_name":"Bhattacharya","first_name":"Anannya","full_name":"Bhattacharya, Anannya"},{"first_name":"Peter","last_name":"Májek","full_name":"Májek, Peter"},{"last_name":"Stukalov","first_name":"Alexey","full_name":"Stukalov, Alexey"},{"full_name":"Sacco, Roberto","first_name":"Roberto","last_name":"Sacco","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leo","last_name":"James","full_name":"James, Leo"},{"full_name":"Pinschewer, Daniel","first_name":"Daniel","last_name":"Pinschewer"},{"full_name":"Bennett, Keiryn","last_name":"Bennett","first_name":"Keiryn"},{"last_name":"Menche","first_name":"Jörg","full_name":"Menche, Jörg"},{"last_name":"Bergthaler","first_name":"Andreas","full_name":"Bergthaler, Andreas"}],"month":"12","publication_identifier":{"issn":["15537366"]},"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"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1371/journal.ppat.1006758"},{"date_published":"2017-07-03T00:00:00Z","citation":{"ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017."},"publication":"Logical Methods in Computer Science","has_accepted_license":"1","day":"03","scopus_import":1,"pubrep_id":"957","oa_version":"Published Version","file":[{"checksum":"bfa405385ec6229ad5ead89ab5751639","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:18:32Z","file_id":"5354","relation":"main_file","creator":"system","file_size":511832,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"466","intvolume":" 13","ddc":["004"],"status":"public","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","issue":"2","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"type":"journal_article","doi":"10.23638/LMCS-13(2:15)2017","language":[{"iso":"eng"}],"oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020"}],"quality_controlled":"1","publication_identifier":{"issn":["18605974"]},"month":"07","related_material":{"record":[{"id":"1657","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5429"},{"id":"5435","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Zuzana","last_name":"Křetínská","full_name":"Křetínská, Zuzana"},{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"volume":13,"date_updated":"2023-02-23T12:26:16Z","date_created":"2018-12-11T11:46:38Z","year":"2017","department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","publication_status":"published","ec_funded":1,"publist_id":"7355","file_date_updated":"2020-07-14T12:46:33Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","article_number":"15"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"467","intvolume":" 18","title":"Nested weighted automata","status":"public","oa_version":"Preprint","type":"journal_article","issue":"4","abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769"},"publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2017-12-01T00:00:00Z","scopus_import":1,"day":"01","year":"2017","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1656"},{"status":"public","relation":"earlier_version","id":"5415"},{"id":"5436","status":"public","relation":"earlier_version"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"volume":18,"date_updated":"2023-02-23T12:26:19Z","date_created":"2018-12-11T11:46:38Z","article_number":"31","ec_funded":1,"publist_id":"7354","oa":1,"external_id":{"arxiv":["1606.03598"]},"main_file_link":[{"url":"https://arxiv.org/abs/1606.03598","open_access":"1"}],"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1145/3152769","language":[{"iso":"eng"}],"publication_identifier":{"issn":["15293785"]},"month":"12"},{"month":"09","publication_identifier":{"issn":["18605974"]},"quality_controlled":"1","project":[{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(3:23)2017","file_date_updated":"2020-07-14T12:46:33Z","publist_id":"7356","ec_funded":1,"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","year":"2017","date_created":"2018-12-11T11:46:37Z","date_updated":"2023-02-23T12:26:25Z","volume":13,"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"related_material":{"record":[{"id":"1610","relation":"earlier_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5438"}]},"scopus_import":1,"day":"13","has_accepted_license":"1","publication":"Logical Methods in Computer Science","citation":{"short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3)."},"date_published":"2017-09-13T00:00:00Z","type":"journal_article","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"issue":"3","status":"public","ddc":["004"],"title":"Edit distance for pushdown automata","intvolume":" 13","_id":"465","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2015-321-v1+1_main.pdf","access_level":"open_access","creator":"system","file_size":279071,"content_type":"application/pdf","file_id":"5090","relation":"main_file","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","checksum":"08041379ba408d40664f449eb5907a8f"},{"creator":"system","file_size":279071,"content_type":"application/pdf","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:38Z","checksum":"08041379ba408d40664f449eb5907a8f","file_id":"5091","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"955"},{"type":"journal_article","abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. "}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"512","title":"Amplification on undirected population structures: Comets beat stars","ddc":["004"],"status":"public","intvolume":" 7","pubrep_id":"938","file":[{"date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:18:35Z","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","relation":"main_file","file_id":"5357","content_type":"application/pdf","file_size":1536783,"creator":"system","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","access_level":"open_access"}],"oa_version":"Published Version","scopus_import":1,"day":"06","article_processing_charge":"No","has_accepted_license":"1","publication":"Scientific Reports","citation":{"ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017)."},"date_published":"2017-03-06T00:00:00Z","article_number":"82","file_date_updated":"2020-07-14T12:46:36Z","publist_id":"7307","ec_funded":1,"year":"2017","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","author":[{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"related_material":{"record":[{"id":"5449","relation":"earlier_version","status":"public"}]},"date_created":"2018-12-11T11:46:53Z","date_updated":"2023-02-23T12:26:57Z","volume":7,"month":"03","publication_identifier":{"issn":["20452322"]},"oa":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"},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"doi":"10.1038/s41598-017-00107-w","language":[{"iso":"eng"}]},{"date_published":"2017-12-27T00:00:00Z","citation":{"ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017)."},"publication":"Proceedings of the ACM on Programming Languages","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"27","scopus_import":"1","oa_version":"Published Version","file":[{"creator":"cchlebak","content_type":"application/pdf","file_size":460188,"access_level":"open_access","file_name":"2017_ACMProgLang_Chatterjee.pdf","success":1,"checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","date_created":"2021-12-07T08:06:28Z","date_updated":"2021-12-07T08:06:28Z","file_id":"10421","relation":"main_file"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10416","intvolume":" 2","status":"public","title":"Optimal Dyck reachability for data-dependence and Alias analysis","ddc":["000"],"issue":"POPL","abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks."}],"type":"journal_article","doi":"10.1145/3158118","conference":{"end_date":"2018-01-13","start_date":"2018-01-07","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"},"language":[{"iso":"eng"}],"oa":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":{"arxiv":["1910.00241"]},"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"quality_controlled":"1","publication_identifier":{"eissn":["2475-1421"]},"month":"12","related_material":{"record":[{"id":"5455","status":"public","relation":"earlier_version"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"volume":2,"date_created":"2021-12-05T23:01:48Z","date_updated":"2023-02-23T12:27:13Z","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","year":"2017","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2021-12-07T08:06:28Z","article_number":"30"},{"abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"870","file":[{"file_id":"5524","relation":"main_file","date_created":"2018-12-12T11:54:02Z","date_updated":"2020-07-14T12:46:59Z","checksum":"177a84a46e3ac17e87b31534ad16a4c9","file_name":"IST-2017-870-v1+1_main.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":960491}],"oa_version":"Published Version","_id":"5455","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","title":"Optimal Dyck reachability for data-dependence and alias analysis","ddc":["000"],"article_processing_charge":"No","has_accepted_license":"1","day":"23","date_published":"2017-10-23T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1"},"page":"37","file_date_updated":"2020-07-14T12:46:59Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"10416"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"date_created":"2018-12-12T11:39:26Z","date_updated":"2023-02-21T15:54:10Z","year":"2017","department":[{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"month":"10","doi":"10.15479/AT:IST-2017-870-v1-1","language":[{"iso":"eng"}],"oa":1},{"month":"06","day":"26","date_published":"2017-06-26T00:00:00Z","citation":{"chicago":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","mla":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","apa":"Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.","ieee":"B. Petritsch, Implementing the institutional data repository IST DataRep. IST Austria, 2017.","ama":"Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/724."}],"publication_date":"2017-06-26","extern":0,"abstract":[{"lang":"eng","text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep."}],"file_date_updated":"2020-07-14T12:46:59Z","type":"report","file":[{"checksum":"6321792dcfa82bf490f17615a9b22355","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:22Z","file_id":"5483","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":3460985,"access_level":"open_access","file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf"}],"date_created":"2018-12-12T11:39:24Z","date_updated":"2020-07-14T23:05:03Z","pubrep_id":"724","author":[{"first_name":"Barbara","last_name":"Petritsch","id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","full_name":"Barbara Petritsch"}],"department":[{"_id":"E-Lib"}],"publisher":"IST Austria","title":"Implementing the institutional data repository IST DataRep","status":"public","year":"2017","_id":"5450"},{"year":"2017","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"first_name":"Kapil","last_name":"Vaidya","full_name":"Vaidya, Kapil"}],"related_material":{"record":[{"id":"5448","relation":"earlier_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5456"}]},"date_created":"2021-12-05T23:01:49Z","date_updated":"2023-02-23T12:27:16Z","volume":2,"article_number":"31","ec_funded":1,"external_id":{"arxiv":["1610.01188"]},"oa":1,"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158119","open_access":"1"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"POPL: Programming Languages","end_date":"2018-01-13","location":"Los Angeles, CA, United States","start_date":"2018-01-07"},"doi":"10.1145/3158119","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"eissn":["2475-1421"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10417","title":"Data-centric dynamic partial order reduction","status":"public","intvolume":" 2","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.","lang":"eng"}],"issue":"POPL","publication":"Proceedings of the ACM on Programming Languages","citation":{"chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119"},"article_type":"original","date_published":"2017-12-27T00:00:00Z","scopus_import":"1","day":"27","article_processing_charge":"No"},{"author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"last_name":"Vaidya","first_name":"Kapil","full_name":"Vaidya, Kapil"}],"related_material":{"record":[{"id":"10417","status":"public","relation":"later_version"},{"id":"5448","status":"public","relation":"earlier_version"}]},"pubrep_id":"872","date_created":"2018-12-12T11:39:26Z","date_updated":"2023-02-23T12:26:54Z","oa_version":"Published Version","file":[{"checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:26Z","relation":"main_file","file_id":"5487","content_type":"application/pdf","file_size":910347,"creator":"system","access_level":"open_access","file_name":"IST-2017-872-v1+1_main.pdf"}],"year":"2017","_id":"5456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Data-centric dynamic partial order reduction","ddc":["000"],"status":"public","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2017-10-23T00:00:00Z","doi":"10.15479/AT:IST-2017-872-v1-1","language":[{"iso":"eng"}],"citation":{"ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1."},"oa":1,"page":"36","month":"10","day":"23","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"year":"2017","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"volume":83,"date_updated":"2021-01-12T08:02:34Z","date_created":"2018-12-11T11:47:08Z","article_number":"61","publist_id":"7263","file_date_updated":"2020-07-14T12:47:00Z","oa":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"},"quality_controlled":"1","doi":"10.4230/LIPIcs.MFCS.2017.61","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-395977046-0"]},"month":"11","_id":"551","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 83","status":"public","ddc":["004"],"title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","pubrep_id":"924","file":[{"access_level":"open_access","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","content_type":"application/pdf","file_size":535077,"creator":"system","relation":"main_file","file_id":"5322","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","date_created":"2018-12-12T10:18:04Z","date_updated":"2020-07-14T12:47:00Z"}],"oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. ","lang":"eng"}],"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61."},"publication":"Leibniz International Proceedings in Informatics","date_published":"2017-11-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01"},{"publication":"Leibniz International Proceedings in Informatics","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39."},"date_published":"2017-11-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","_id":"552","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Faster algorithms for mean-payoff parity games","ddc":["004"],"status":"public","intvolume":" 83","pubrep_id":"923","file":[{"date_created":"2018-12-12T10:16:57Z","date_updated":"2020-07-14T12:47:00Z","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","file_id":"5248","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":610339,"file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective)."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"conference":{"start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"doi":"10.4230/LIPIcs.MFCS.2017.39","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"year":"2017","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"date_updated":"2023-02-14T10:06:46Z","date_created":"2018-12-11T11:47:08Z","volume":83,"article_number":"39","file_date_updated":"2020-07-14T12:47:00Z","ec_funded":1,"publist_id":"7262"},{"volume":83,"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:08Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Hansen","first_name":"Kristofer","full_name":"Hansen, Kristofer"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2017","publist_id":"7261","file_date_updated":"2020-07-14T12:47:00Z","article_number":"55","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2017.55","conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.02434"}],"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,"publication_identifier":{"isbn":["978-395977046-0"]},"month":"11","file":[{"file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","access_level":"open_access","creator":"system","file_size":549967,"content_type":"application/pdf","file_id":"4753","relation":"main_file","date_created":"2018-12-12T10:09:29Z","date_updated":"2020-07-14T12:47:00Z","checksum":"7101facb56ade363205c695d72dbd173"}],"oa_version":"Published Version","pubrep_id":"922","intvolume":" 83","ddc":["004"],"status":"public","title":"Strategy complexity of concurrent safety games","_id":"553","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. ","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2017-11-01T00:00:00Z","citation":{"ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","day":"01","scopus_import":1},{"_id":"560","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","intvolume":" 473","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions."}],"issue":"2207","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","citation":{"chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104"},"date_published":"2017-11-01T00:00:00Z","scopus_import":1,"day":"01","year":"2017","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Royal Society of London","author":[{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","first_name":"Mate"},{"first_name":"Arnulf","last_name":"Jentzen","full_name":"Jentzen, Arnulf"},{"full_name":"Salimova, Diyora","last_name":"Salimova","first_name":"Diyora"}],"date_updated":"2021-01-12T08:03:04Z","date_created":"2018-12-11T11:47:11Z","volume":473,"article_number":"0104","publist_id":"7256","ec_funded":1,"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.03229","open_access":"1"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1098/rspa.2017.0104","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["13645021"]}},{"publication_identifier":{"isbn":["9-781-4704-3648-3"],"eisbn":["978-1-4704-4194-4"]},"month":"01","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1090/cln/028","language":[{"iso":"eng"}],"publist_id":"7247","ec_funded":1,"year":"2017","publisher":"American Mathematical Society","department":[{"_id":"LaEr"}],"publication_status":"published","author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"}],"volume":28,"date_updated":"2022-05-24T06:57:28Z","date_created":"2018-12-11T11:47:13Z","series_title":"Courant Lecture Notes","article_processing_charge":"No","day":"01","citation":{"short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028.","ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017.","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p."},"page":"226","date_published":"2017-01-01T00:00:00Z","type":"book","alternative_title":["Courant Lecture Notes"],"abstract":[{"text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n","lang":"eng"}],"_id":"567","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 28","status":"public","title":"A Dynamical Approach to Random Matrix Theory","oa_version":"None"},{"publication_status":"published","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publisher":"International Press","year":"2017","date_created":"2018-12-11T11:47:14Z","date_updated":"2021-01-12T08:03:12Z","volume":19,"author":[{"first_name":"Peter","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter"},{"first_name":"Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"publist_id":"7246","ec_funded":1,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.4310/HHA.2017.v19.n2.a16","month":"01","publication_identifier":{"issn":["15320073"]},"title":"Persistence of zero sets","status":"public","intvolume":" 19","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"568","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C)."}],"issue":"2","page":"313 - 342","publication":"Homology, Homotopy and Applications","citation":{"ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16."},"date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01"},{"article_number":"e28921","publist_id":"7244","ec_funded":1,"file_date_updated":"2020-07-14T12:47:10Z","year":"2017","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"publisher":"eLife Sciences Publications","publication_status":"published","author":[{"full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator","first_name":"Mato"},{"first_name":"Srdjan","last_name":"Sarikas","id":"35F0286E-F248-11E8-B48F-1D18A9856A87","full_name":"Sarikas, Srdjan"},{"full_name":"Acar, Hande","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1986-9753","first_name":"Hande","last_name":"Acar"},{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C"}],"volume":6,"date_created":"2018-12-11T11:47:14Z","date_updated":"2021-01-12T08:03:15Z","publication_identifier":{"issn":["2050084X"]},"month":"11","oa":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"},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"call_identifier":"H2020","name":"Selective Barriers to Horizontal Gene Transfer","grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.7554/eLife.28921","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. ","lang":"eng"}],"_id":"570","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 6","ddc":["576"],"title":"Regulatory network structure determines patterns of intermolecular epistasis","status":"public","pubrep_id":"918","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":8453470,"creator":"system","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","access_level":"open_access","date_created":"2018-12-12T10:14:42Z","date_updated":"2020-07-14T12:47:10Z","checksum":"273ab17f33305e4eaafd911ff88e7c5b","relation":"main_file","file_id":"5096"},{"file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","access_level":"open_access","creator":"system","file_size":1953221,"content_type":"application/pdf","file_id":"5097","relation":"main_file","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:14:43Z","checksum":"b433f90576c7be597cd43367946f8e7f"}],"scopus_import":1,"has_accepted_license":"1","day":"13","citation":{"ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017)."},"publication":"eLife","date_published":"2017-11-13T00:00:00Z"},{"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"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7554/eLife.30867","publication_identifier":{"issn":["2050084X"]},"month":"11","publisher":"eLife Sciences Publications","department":[{"_id":"MiSi"}],"publication_status":"published","year":"2017","volume":6,"date_updated":"2023-02-23T12:30:29Z","date_created":"2018-12-11T11:47:14Z","author":[{"first_name":"Felix","last_name":"Spira","full_name":"Spira, Felix"},{"last_name":"Cuylen Haering","first_name":"Sara","full_name":"Cuylen Haering, Sara"},{"full_name":"Mehta, Shalin","last_name":"Mehta","first_name":"Shalin"},{"full_name":"Samwer, Matthias","first_name":"Matthias","last_name":"Samwer"},{"full_name":"Reversat, Anne","last_name":"Reversat","first_name":"Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Verma, Amitabh","last_name":"Verma","first_name":"Amitabh"},{"full_name":"Oldenbourg, Rudolf","last_name":"Oldenbourg","first_name":"Rudolf"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"},{"full_name":"Gerlich, Daniel","first_name":"Daniel","last_name":"Gerlich"}],"article_number":"e30867","publist_id":"7245","file_date_updated":"2020-07-14T12:47:10Z","citation":{"mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867.","ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017."},"publication":"eLife","date_published":"2017-11-06T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"06","intvolume":" 6","title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","status":"public","ddc":["570"],"_id":"569","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_id":"4829","relation":"main_file","date_created":"2018-12-12T10:10:40Z","date_updated":"2020-07-14T12:47:10Z","checksum":"ba09c1451153d39e4f4b7cee013e314c","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","access_level":"open_access","creator":"system","file_size":9666973,"content_type":"application/pdf"},{"file_id":"4830","relation":"main_file","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:10:41Z","checksum":"01eb51f1d6ad679947415a51c988e137","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":5951246}],"pubrep_id":"919","type":"journal_article","abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}]},{"publist_id":"7243","ec_funded":1,"year":"2017","publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Cell Press","author":[{"first_name":"Florian R","last_name":"Gärtner","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6120-3723","full_name":"Gärtner, Florian R"},{"full_name":"Ahmad, Zerkah","first_name":"Zerkah","last_name":"Ahmad"},{"first_name":"Gerhild","last_name":"Rosenberger","full_name":"Rosenberger, Gerhild"},{"last_name":"Fan","first_name":"Shuxia","full_name":"Fan, Shuxia"},{"last_name":"Nicolai","first_name":"Leo","full_name":"Nicolai, Leo"},{"full_name":"Busch, Benjamin","last_name":"Busch","first_name":"Benjamin"},{"full_name":"Yavuz, Gökce","first_name":"Gökce","last_name":"Yavuz"},{"full_name":"Luckner, Manja","first_name":"Manja","last_name":"Luckner"},{"first_name":"Hellen","last_name":"Ishikawa Ankerhold","full_name":"Ishikawa Ankerhold, Hellen"},{"last_name":"Hennel","first_name":"Roman","full_name":"Hennel, Roman"},{"first_name":"Alexandre","last_name":"Benechet","full_name":"Benechet, Alexandre"},{"full_name":"Lorenz, Michael","first_name":"Michael","last_name":"Lorenz"},{"last_name":"Chandraratne","first_name":"Sue","full_name":"Chandraratne, Sue"},{"last_name":"Schubert","first_name":"Irene","full_name":"Schubert, Irene"},{"last_name":"Helmer","first_name":"Sebastian","full_name":"Helmer, Sebastian"},{"full_name":"Striednig, Bianca","last_name":"Striednig","first_name":"Bianca"},{"last_name":"Stark","first_name":"Konstantin","full_name":"Stark, Konstantin"},{"first_name":"Marek","last_name":"Janko","full_name":"Janko, Marek"},{"full_name":"Böttcher, Ralph","first_name":"Ralph","last_name":"Böttcher"},{"first_name":"Admar","last_name":"Verschoor","full_name":"Verschoor, Admar"},{"full_name":"Leon, Catherine","first_name":"Catherine","last_name":"Leon"},{"first_name":"Christian","last_name":"Gachet","full_name":"Gachet, Christian"},{"last_name":"Gudermann","first_name":"Thomas","full_name":"Gudermann, Thomas"},{"full_name":"Mederos Y Schnitzler, Michael","last_name":"Mederos Y Schnitzler","first_name":"Michael"},{"full_name":"Pincus, Zachary","last_name":"Pincus","first_name":"Zachary"},{"last_name":"Iannacone","first_name":"Matteo","full_name":"Iannacone, Matteo"},{"first_name":"Rainer","last_name":"Haas","full_name":"Haas, Rainer"},{"last_name":"Wanner","first_name":"Gerhard","full_name":"Wanner, Gerhard"},{"last_name":"Lauber","first_name":"Kirsten","full_name":"Lauber, Kirsten"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"},{"last_name":"Massberg","first_name":"Steffen","full_name":"Massberg, Steffen"}],"date_created":"2018-12-11T11:47:15Z","date_updated":"2021-01-12T08:03:15Z","volume":171,"month":"11","publication_identifier":{"issn":["00928674"]},"quality_controlled":"1","project":[{"name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","grant_number":"747687"}],"doi":"10.1016/j.cell.2017.11.001","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface.","lang":"eng"}],"issue":"6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"571","status":"public","title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","intvolume":" 171","oa_version":"None","scopus_import":1,"day":"30","publication":"Cell Press","citation":{"mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382.","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001.","ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382.","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001"},"page":"1368 - 1382","date_published":"2017-11-30T00:00:00Z"},{"oa_version":"Published Version","file":[{"date_created":"2018-12-12T10:08:55Z","date_updated":"2020-07-14T12:47:10Z","checksum":"82d51f11e493f7eec02976d9a9a9805e","relation":"main_file","file_id":"4718","content_type":"application/pdf","file_size":920962,"creator":"system","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","access_level":"open_access"}],"pubrep_id":"917","intvolume":" 18","ddc":["580"],"title":"Control of endogenous auxin levels in plant root development","status":"public","_id":"572","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"12","abstract":[{"text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture.","lang":"eng"}],"type":"journal_article","date_published":"2017-12-01T00:00:00Z","citation":{"ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587.","ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587.","short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017)."},"publication":"International Journal of Molecular Sciences","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","volume":18,"date_updated":"2021-01-12T08:03:16Z","date_created":"2018-12-11T11:47:15Z","author":[{"full_name":"Olatunji, Damilola","first_name":"Damilola","last_name":"Olatunji"},{"first_name":"Danny","last_name":"Geelen","full_name":"Geelen, Danny"},{"full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge"}],"department":[{"_id":"JiFr"}],"publisher":"MDPI","publication_status":"published","year":"2017","publist_id":"7242","file_date_updated":"2020-07-14T12:47:10Z","article_number":"2587","language":[{"iso":"eng"}],"doi":"10.3390/ijms18122587","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"},"oa":1,"month":"12"},{"extern":"1","place":"Cham","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"date_created":"2019-01-08T20:42:56Z","date_updated":"2022-01-28T07:48:24Z","volume":10256,"year":"2017","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","month":"05","publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"conference":{"end_date":"2017-06-21","location":"Plovdiv, Bulgaria","start_date":"2017-06-19","name":"IWCIA: International Workshop on Combinatorial Image Analysis"},"doi":"10.1007/978-3-319-59108-7_8","language":[{"iso":"eng"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept."}],"type":"book_chapter","alternative_title":["LNCS"],"oa_version":"None","_id":"5803","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Construction of persistent Voronoi diagram on 3D digital plane","status":"public","intvolume":" 10256","day":"17","article_processing_charge":"No","date_published":"2017-05-17T00:00:00Z","publication":"Combinatorial image analysis","citation":{"ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","apa":"Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8."},"page":"93-104"},{"article_number":"012004","publist_id":"7552","file_date_updated":"2020-07-14T12:46:00Z","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","year":"2017","volume":999,"date_created":"2018-12-11T11:45:46Z","date_updated":"2023-02-23T12:36:07Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"6013"}]},"author":[{"first_name":"Nicolas","last_name":"Camus","full_name":"Camus, Nicolas"},{"full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","last_name":"Yakaboylu","first_name":"Enderalp"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"first_name":"Michael","last_name":"Klaiber","full_name":"Klaiber, Michael"},{"full_name":"Laux, Martin","last_name":"Laux","first_name":"Martin"},{"full_name":"Mi, Yonghao","first_name":"Yonghao","last_name":"Mi"},{"full_name":"Hatsagortsyan, Karen","last_name":"Hatsagortsyan","first_name":"Karen"},{"first_name":"Thomas","last_name":"Pfeifer","full_name":"Pfeifer, Thomas"},{"first_name":"Cristoph","last_name":"Keitel","full_name":"Keitel, Cristoph"},{"full_name":"Moshammer, Robert","last_name":"Moshammer","first_name":"Robert"}],"publication_identifier":{"issn":["17426588"]},"month":"07","quality_controlled":"1","oa":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":{"arxiv":["1611.03701"]},"language":[{"iso":"eng"}],"doi":"10.1088/1742-6596/999/1/012004","conference":{"name":"Annual International Laser Physics Workshop LPHYS","end_date":"2017-08-21","location":"Kazan, Russian Federation","start_date":"2017-08-17"},"alternative_title":["Journal of Physics: Conference Series"],"type":"conference","issue":"1","abstract":[{"text":"Tunneling of a particle through a potential barrier remains one of the most remarkable quantum phenomena. Owing to advances in laser technology, electric fields comparable to those electrons experience in atoms are readily generated and open opportunities to dynamically investigate the process of electron tunneling through the potential barrier formed by the superposition of both laser and atomic fields. Attosecond-time and angstrom-space resolution of the strong laser-field technique allow to address fundamental questions related to tunneling, which are still open and debated: Which time is spent under the barrier and what momentum is picked up by the particle in the meantime? In this combined experimental and theoretical study we demonstrate that for strong-field ionization the leading quantum mechanical Wigner treatment for the time resolved description of tunneling is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously isolate its effects by performing a differential study of two systems with almost identical tunneling geometry. Moreover, working with a low frequency laser, we essentially limit the non-adiabaticity of the process as a major source of uncertainty. The agreement between experiment and theory implies two substantial corrections with respect to the widely employed quasiclassical treatment: In addition to a non-vanishing longitudinal momentum along the laser field-direction we provide clear evidence for a non-zero tunneling time delay. This addresses also the fundamental question how the transition occurs from the tunnel barrier to free space classical evolution of the ejected electron.","lang":"eng"}],"intvolume":" 999","status":"public","ddc":["530"],"title":"Experimental evidence for Wigner's tunneling time","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"313","oa_version":"Published Version","file":[{"file_id":"5871","relation":"main_file","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","date_updated":"2020-07-14T12:46:00Z","date_created":"2019-01-22T08:34:10Z","access_level":"open_access","file_name":"2017_Physics_Camus.pdf","creator":"dernst","file_size":949321,"content_type":"application/pdf"}],"scopus_import":1,"has_accepted_license":"1","day":"14","citation":{"ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s tunneling time. In: Vol 999. American Physical Society; 2017. doi:10.1088/1742-6596/999/1/012004","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K, Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference Series, vol. 999, 012004.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004","ieee":"N. Camus et al., “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","mla":"Camus, Nicolas, et al. Experimental Evidence for Wigner’s Tunneling Time. Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:10.1088/1742-6596/999/1/012004.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan, T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American Physical Society, 2017. https://doi.org/10.1088/1742-6596/999/1/012004."},"date_published":"2017-07-14T00:00:00Z"},{"article_number":"023201","date_updated":"2023-02-23T11:13:36Z","date_created":"2019-02-14T15:24:13Z","volume":119,"author":[{"full_name":"Camus, Nicolas","first_name":"Nicolas","last_name":"Camus"},{"full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"full_name":"Klaiber, Michael","last_name":"Klaiber","first_name":"Michael"},{"full_name":"Laux, Martin","last_name":"Laux","first_name":"Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"last_name":"Hatsagortsyan","first_name":"Karen Z.","full_name":"Hatsagortsyan, Karen Z."},{"full_name":"Pfeifer, Thomas","first_name":"Thomas","last_name":"Pfeifer"},{"last_name":"Keitel","first_name":"Christoph H.","full_name":"Keitel, Christoph H."},{"full_name":"Moshammer, Robert","first_name":"Robert","last_name":"Moshammer"}],"related_material":{"record":[{"id":"313","relation":"earlier_version","status":"public"}]},"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","year":"2017","month":"07","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevLett.119.023201","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1611.03701","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1611.03701"]},"abstract":[{"lang":"eng","text":"The first hundred attoseconds of the electron dynamics during strong field tunneling ionization are investigated. We quantify theoretically how the electron’s classical trajectories in the continuum emerge from the tunneling process and test the results with those achieved in parallel from attoclock measurements. An especially high sensitivity on the tunneling barrier is accomplished here by comparing the momentum distributions of two atomic species of slightly deviating atomic potentials (argon and krypton) being ionized under absolutely identical conditions with near-infrared laser pulses (1300 nm). The agreement between experiment and theory provides clear evidence for a nonzero tunneling time delay and a nonvanishing longitudinal momentum of the electron at the “tunnel exit.”"}],"issue":"2","type":"journal_article","oa_version":"Preprint","title":"Experimental evidence for quantum tunneling time","status":"public","intvolume":" 119","_id":"6013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"14","scopus_import":1,"date_published":"2017-07-14T00:00:00Z","publication":"Physical Review Letters","citation":{"short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K.Z. Hatsagortsyan, T. Pfeifer, C.H. Keitel, R. Moshammer, Physical Review Letters 119 (2017).","mla":"Camus, Nicolas, et al. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters, vol. 119, no. 2, 023201, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.023201.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Z. Hatsagortsyan, Thomas Pfeifer, Christoph H. Keitel, and Robert Moshammer. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.023201.","ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for quantum tunneling time. Physical Review Letters. 2017;119(2). doi:10.1103/PhysRevLett.119.023201","ieee":"N. Camus et al., “Experimental evidence for quantum tunneling time,” Physical Review Letters, vol. 119, no. 2. American Physical Society, 2017.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for quantum tunneling time. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.023201","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan KZ, Pfeifer T, Keitel CH, Moshammer R. 2017. Experimental evidence for quantum tunneling time. Physical Review Letters. 119(2), 023201."}},{"day":"05","scopus_import":1,"date_published":"2017-11-05T00:00:00Z","citation":{"mla":"Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3.","short":"J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.","chicago":"Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.","ama":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3","ista":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81.","ieee":"J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.","apa":"Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3"},"page":"56 - 81","abstract":[{"text":"Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"605","title":"Position based cryptography and multiparty communication complexity","status":"public","intvolume":" 10677","month":"11","publication_identifier":{"isbn":["978-331970499-9"]},"conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2017-11-12","location":"Baltimore, MD, United States","end_date":"2017-11-15"},"doi":"10.1007/978-3-319-70500-2_3","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2016/536","open_access":"1"}],"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"publist_id":"7200","ec_funded":1,"author":[{"first_name":"Joshua","last_name":"Brody","full_name":"Brody, Joshua"},{"last_name":"Dziembowski","first_name":"Stefan","full_name":"Dziembowski, Stefan"},{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"date_updated":"2021-01-12T08:05:53Z","date_created":"2018-12-11T11:47:27Z","volume":10677,"year":"2017","publication_status":"published","publisher":"Springer","editor":[{"full_name":"Kalai, Yael","last_name":"Kalai","first_name":"Yael"},{"full_name":"Reyzin, Leonid","first_name":"Leonid","last_name":"Reyzin"}],"department":[{"_id":"KrPi"}]},{"_id":"604","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 11","title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","status":"public","oa_version":"Submitted Version","type":"book_chapter","alternative_title":["Theoretical and Computational Chemistry Series"],"abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"citation":{"chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , The Royal Society of Chemistry, 2017, pp. 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, The Royal Society of Chemistry, 2017, pp. 444–95, doi:10.1039/9781782626800-00444.","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu and A. Osterwalder, Eds. The Royal Society of Chemistry, 2017, pp. 444–495.","apa":"Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). The Royal Society of Chemistry. https://doi.org/10.1039/9781782626800-00444","ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Vol 11. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444"},"publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","page":"444 - 495","date_published":"2017-12-14T00:00:00Z","scopus_import":1,"series_title":"Theoretical and Computational Chemistry Series","day":"14","year":"2017","editor":[{"first_name":"Oliver","last_name":"Dulieu","full_name":"Dulieu, Oliver"},{"full_name":"Osterwalder, Andreas","first_name":"Andreas","last_name":"Osterwalder"}],"publisher":"The Royal Society of Chemistry","department":[{"_id":"MiLe"}],"publication_status":"published","author":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"first_name":"Richard","last_name":"Schmidt","full_name":"Schmidt, Richard"}],"volume":11,"date_created":"2018-12-11T11:47:27Z","date_updated":"2021-01-12T08:05:50Z","publist_id":"7201","main_file_link":[{"url":"https://arxiv.org/abs/1703.06753","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1039/9781782626800-00444","language":[{"iso":"eng"}],"publication_identifier":{"issn":["20413181"]},"month":"12"},{"scopus_import":1,"day":"05","citation":{"mla":"Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17.","short":"J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.","chicago":"Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17.","ama":"Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17","ista":"Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.","apa":"Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17","ieee":"J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526."},"page":"493 - 526","date_published":"2017-11-05T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Several cryptographic schemes and applications are based on functions that are both reasonably efficient to compute and moderately hard to invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled and formalized explicitly. Instead, either the applications are proven directly based on the assumptions underlying the function, or some property of the function is proven, but the security of the application is argued only informally. The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. On a technical level, beyond the mentioned definitions, we instantiate the model for four different notions of hardness. We extend the work of Alwen and Serbinenko (STOC 2015) by providing a general tool for proving security for the first notion of memory-hard functions that allows for provably secure applications. The tool allows us to recover all of the graph-theoretic techniques developed for proving security under the older, non-composable, notion of security used by Alwen and Serbinenko. As an application of our definition of moderately hard functions, we prove the security of two different schemes for proofs of effort (PoE). We also formalize and instantiate the concept of a non-interactive proof of effort (niPoE), in which the proof is not bound to a particular communication context but rather any bit-string chosen by the prover.","lang":"eng"}],"_id":"609","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Moderately hard functions: Definition, instantiations, and applications","status":"public","intvolume":" 10677","oa_version":"Submitted Version","month":"11","publication_identifier":{"isbn":["978-331970499-9"]},"main_file_link":[{"url":"https://eprint.iacr.org/2017/945","open_access":"1"}],"oa":1,"quality_controlled":"1","conference":{"end_date":"2017-11-15","location":"Baltimore, MD, United States","start_date":"2017-11-12","name":"TCC: Theory of Cryptography"},"doi":"10.1007/978-3-319-70500-2_17","language":[{"iso":"eng"}],"publist_id":"7196","year":"2017","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","editor":[{"last_name":"Kalai","first_name":"Yael","full_name":"Kalai, Yael"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"}],"author":[{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"full_name":"Tackmann, Björn","first_name":"Björn","last_name":"Tackmann"}],"date_created":"2018-12-11T11:47:28Z","date_updated":"2021-01-12T08:06:04Z","volume":10677},{"month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1610.09063","open_access":"1"}],"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","doi":"10.1007/s11856-017-1607-7","language":[{"iso":"eng"}],"publist_id":"7194","ec_funded":1,"acknowledgement":"The work by Z. P. was partially supported by the Israel Science Foundation grant ISF-768/12. The work by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of the Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research work of M.T. was conducted at IST Austria, supported by an IST Fellowship. The research of P. P. was supported by the ERC Advanced grant no. 320924. The work by I. M. and U. W. was supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and SNSF-PP00P2-138948). The collaboration between U. W. and X. G. was partially supported by the LabEx Bézout (ANR-10-LABX-58).","year":"2017","department":[{"_id":"UlWa"}],"publisher":"Springer","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1511"}]},"author":[{"last_name":"Goaoc","first_name":"Xavier","full_name":"Goaoc, Xavier"},{"last_name":"Mabillard","first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Mabillard, Isaac"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","last_name":"Patakova","first_name":"Zuzana","full_name":"Patakova, Zuzana"},{"last_name":"Tancer","first_name":"Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"}],"volume":222,"date_updated":"2023-02-23T10:02:13Z","date_created":"2018-12-11T11:47:29Z","scopus_import":1,"day":"01","citation":{"mla":"Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics. Springer, 2017. https://doi.org/10.1007/s11856-017-1607-7.","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-017-1607-7","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017."},"publication":"Israel Journal of Mathematics","page":"841 - 866","date_published":"2017-10-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"The fact that the complete graph K5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph Kn embeds in a closed surface M (other than the Klein bottle) if and only if (n−3)(n−4) ≤ 6b1(M), where b1(M) is the first Z2-Betti number of M. On the other hand, van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of Kn+1) embeds in R2k if and only if n ≤ 2k + 1. Two decades ago, Kühnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k − 1)-connected 2k-manifold with kth Z2-Betti number bk only if the following generalized Heawood inequality holds: (k+1 n−k−1) ≤ (k+1 2k+1)bk. This is a common generalization of the case of graphs on surfaces as well as the van Kampen–Flores theorem. In the spirit of Kühnel’s conjecture, we prove that if the k-skeleton of the n-simplex embeds in a compact 2k-manifold with kth Z2-Betti number bk, then n ≤ 2bk(k 2k+2)+2k+4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k−1)-connected. Our results generalize to maps without q-covered points, in the spirit of Tverberg’s theorem, for q a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"610","intvolume":" 222","status":"public","title":"On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result","oa_version":"Preprint"},{"type":"journal_article","issue":"6365","publist_id":"7193","abstract":[{"lang":"eng","text":"Small RNAs (sRNAs) regulate genes in plants and animals. Here, we show that population-wide differences in color patterns in snapdragon flowers are caused by an inverted duplication that generates sRNAs. The complexity and size of the transcripts indicate that the duplication represents an intermediate on the pathway to microRNA evolution. The sRNAs repress a pigment biosynthesis gene, creating a yellow highlight at the site of pollinator entry. The inverted duplication exhibits steep clines in allele frequency in a natural hybrid zone, showing that the allele is under selection. Thus, regulatory interactions of evolutionarily recent sRNAs can be acted upon by selection and contribute to the evolution of phenotypic diversity."}],"department":[{"_id":"NiBa"}],"publisher":"American Association for the Advancement of Science","intvolume":" 358","title":"Evolution of flower color pattern through selection on regulatory small RNAs","publication_status":"published","status":"public","year":"2017","_id":"611","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":358,"date_created":"2018-12-11T11:47:29Z","date_updated":"2021-01-12T08:06:10Z","author":[{"full_name":"Bradley, Desmond","first_name":"Desmond","last_name":"Bradley"},{"last_name":"Xu","first_name":"Ping","full_name":"Xu, Ping"},{"last_name":"Mohorianu","first_name":"Irina","full_name":"Mohorianu, Irina"},{"last_name":"Whibley","first_name":"Annabel","full_name":"Whibley, Annabel"},{"last_name":"Field","first_name":"David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David"},{"first_name":"Hugo","last_name":"Tavares","full_name":"Tavares, Hugo"},{"full_name":"Couchman, Matthew","first_name":"Matthew","last_name":"Couchman"},{"last_name":"Copsey","first_name":"Lucy","full_name":"Copsey, Lucy"},{"full_name":"Carpenter, Rosemary","first_name":"Rosemary","last_name":"Carpenter"},{"last_name":"Li","first_name":"Miaomiao","full_name":"Li, Miaomiao"},{"full_name":"Li, Qun","last_name":"Li","first_name":"Qun"},{"first_name":"Yongbiao","last_name":"Xue","full_name":"Xue, Yongbiao"},{"last_name":"Dalmay","first_name":"Tamas","full_name":"Dalmay, Tamas"},{"first_name":"Enrico","last_name":"Coen","full_name":"Coen, Enrico"}],"scopus_import":1,"publication_identifier":{"issn":["00368075"]},"day":"17","month":"11","page":"925 - 928","quality_controlled":"1","citation":{"ama":"Bradley D, Xu P, Mohorianu I, et al. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 2017;358(6365):925-928. doi:10.1126/science.aao3526","ieee":"D. Bradley et al., “Evolution of flower color pattern through selection on regulatory small RNAs,” Science, vol. 358, no. 6365. American Association for the Advancement of Science, pp. 925–928, 2017.","apa":"Bradley, D., Xu, P., Mohorianu, I., Whibley, A., Field, D., Tavares, H., … Coen, E. (2017). Evolution of flower color pattern through selection on regulatory small RNAs. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao3526","ista":"Bradley D, Xu P, Mohorianu I, Whibley A, Field D, Tavares H, Couchman M, Copsey L, Carpenter R, Li M, Li Q, Xue Y, Dalmay T, Coen E. 2017. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 358(6365), 925–928.","short":"D. Bradley, P. Xu, I. Mohorianu, A. Whibley, D. Field, H. Tavares, M. Couchman, L. Copsey, R. Carpenter, M. Li, Q. Li, Y. Xue, T. Dalmay, E. Coen, Science 358 (2017) 925–928.","mla":"Bradley, Desmond, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science, vol. 358, no. 6365, American Association for the Advancement of Science, 2017, pp. 925–28, doi:10.1126/science.aao3526.","chicago":"Bradley, Desmond, Ping Xu, Irina Mohorianu, Annabel Whibley, David Field, Hugo Tavares, Matthew Couchman, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aao3526."},"publication":"Science","language":[{"iso":"eng"}],"date_published":"2017-11-17T00:00:00Z","doi":"10.1126/science.aao3526"},{"issue":"1","abstract":[{"lang":"eng","text":"Bacteria in groups vary individually, and interact with other bacteria and the environment to produce population-level patterns of gene expression. Investigating such behavior in detail requires measuring and controlling populations at the single-cell level alongside precisely specified interactions and environmental characteristics. Here we present an automated, programmable platform that combines image-based gene expression and growth measurements with on-line optogenetic expression control for hundreds of individual Escherichia coli cells over days, in a dynamically adjustable environment. This integrated platform broadly enables experiments that bridge individual and population behaviors. We demonstrate: (i) population structuring by independent closed-loop control of gene expression in many individual cells, (ii) cell-cell variation control during antibiotic perturbation, (iii) hybrid bio-digital circuits in single cells, and freely specifiable digital communication between individual bacteria. These examples showcase the potential for real-time integration of theoretical models with measurement and control of many individual cells to investigate and engineer microbial population behavior."}],"type":"journal_article","pubrep_id":"911","oa_version":"Published Version","file":[{"file_id":"5190","relation":"main_file","date_created":"2018-12-12T10:16:05Z","date_updated":"2020-07-14T12:47:20Z","checksum":"44bb5d0229926c23a9955d9fe0f9723f","file_name":"IST-2017-911-v1+1_s41467-017-01683-1.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":1951699}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"613","intvolume":" 8","ddc":["576","579"],"title":"Shaping bacterial population behavior through computer interfaced control of individual cells","status":"public","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"01","scopus_import":1,"date_published":"2017-12-01T00:00:00Z","citation":{"ama":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01683-1","ista":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. 2017. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 8(1), 1535.","ieee":"R. P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, and C. C. Guet, “Shaping bacterial population behavior through computer interfaced control of individual cells,” Nature Communications, vol. 8, no. 1. Nature Publishing Group, 2017.","apa":"Chait, R. P., Ruess, J., Bergmiller, T., Tkačik, G., & Guet, C. C. (2017). Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-01683-1","mla":"Chait, Remy P., et al. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications, vol. 8, no. 1, 1535, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01683-1.","short":"R.P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, C.C. Guet, Nature Communications 8 (2017).","chicago":"Chait, Remy P, Jakob Ruess, Tobias Bergmiller, Gašper Tkačik, and Calin C Guet. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01683-1."},"publication":"Nature Communications","ec_funded":1,"publist_id":"7191","file_date_updated":"2020-07-14T12:47:20Z","article_number":"1535","author":[{"orcid":"0000-0003-0876-3187","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","last_name":"Chait","first_name":"Remy P","full_name":"Chait, Remy P"},{"last_name":"Ruess","first_name":"Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","full_name":"Ruess, Jakob"},{"orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller","first_name":"Tobias","full_name":"Bergmiller, Tobias"},{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C"}],"volume":8,"date_created":"2018-12-11T11:47:30Z","date_updated":"2021-01-12T08:06:15Z","acknowledgement":"We are grateful to M. Lang, H. Janovjak, M. Khammash, A. Milias-Argeitis, M. Rullan, G. Batt, A. Bosma-Moody, Aryan, S. Leibler, and members of the Guet and Tkačik groups for helpful discussion, comments, and suggestions. We thank A. Moglich, T. Mathes, J. Tabor, and S. Schmidl for kind gifts of strains, and R. Hauschild, B. Knep, M. Lang, T. Asenov, E. Papusheva, T. Menner, T. Adletzberger, and J. Merrin for technical assistance. 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 no. [291734]. (to R.C. and J.R.), Austrian Science Fund grant FWF P28844 (to G.T.), and internal IST Austria Interdisciplinary Project Support. J.R. acknowledges support from the Agence Nationale de la Recherche (ANR) under Grant Nos. ANR-16-CE33-0018 (MEMIP), ANR-16-CE12-0025 (COGEX) and ANR-10-BINF-06-01 (ICEBERG).","year":"2017","publisher":"Nature Publishing Group","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publication_status":"published","publication_identifier":{"issn":["20411723"]},"month":"12","doi":"10.1038/s41467-017-01683-1","language":[{"iso":"eng"}],"oa":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"},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"quality_controlled":"1"},{"publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2017","volume":53,"date_created":"2018-12-11T11:47:30Z","date_updated":"2021-01-12T08:06:22Z","author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kevin","last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin"}],"ec_funded":1,"publist_id":"7189","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.00650"}],"language":[{"iso":"eng"}],"doi":"10.1214/16-AIHP765","publication_identifier":{"issn":["02460203"]},"month":"11","intvolume":" 53","title":"Universality for random matrix flows with time dependent density","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"615","oa_version":"Submitted Version","type":"journal_article","issue":"4","abstract":[{"text":"We show that the Dyson Brownian Motion exhibits local universality after a very short time assuming that local rigidity and level repulsion of the eigenvalues hold. These conditions are verified, hence bulk spectral universality is proven, for a large class of Wigner-like matrices, including deformed Wigner ensembles and ensembles with non-stochastic variance matrices whose limiting densities differ from Wigner's semicircle law.","lang":"eng"}],"page":"1606 - 1656","citation":{"apa":"Erdös, L., & Schnelli, K. (2017). Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/16-AIHP765","ieee":"L. Erdös and K. Schnelli, “Universality for random matrix flows with time dependent density,” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4. Institute of Mathematical Statistics, pp. 1606–1656, 2017.","ista":"Erdös L, Schnelli K. 2017. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 53(4), 1606–1656.","ama":"Erdös L, Schnelli K. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 2017;53(4):1606-1656. doi:10.1214/16-AIHP765","chicago":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-AIHP765.","short":"L. Erdös, K. Schnelli, Annales de l’institut Henri Poincare (B) Probability and Statistics 53 (2017) 1606–1656.","mla":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4, Institute of Mathematical Statistics, 2017, pp. 1606–56, doi:10.1214/16-AIHP765."},"publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","date_published":"2017-11-01T00:00:00Z","scopus_import":1,"day":"01"},{"intvolume":" 224","status":"public","title":"Extracerebral dysfunction in animal models of autism spectrum disorder","_id":"623","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","alternative_title":["ADVSANAT"],"type":"book_chapter","abstract":[{"lang":"eng","text":"Genetic factors might be largely responsible for the development of autism spectrum disorder (ASD) that alone or in combination with specific environmental risk factors trigger the pathology. Multiple mutations identified in ASD patients that impair synaptic function in the central nervous system are well studied in animal models. How these mutations might interact with other risk factors is not fully understood though. Additionally, how systems outside of the brain are altered in the context of ASD is an emerging area of research. Extracerebral influences on the physiology could begin in utero and contribute to changes in the brain and in the development of other body systems and further lead to epigenetic changes. Therefore, multiple recent studies have aimed at elucidating the role of gene-environment interactions in ASD. Here we provide an overview on the extracerebral systems that might play an important associative role in ASD and review evidence regarding the potential roles of inflammation, trace metals, metabolism, genetic susceptibility, enteric nervous system function and the microbiota of the gastrointestinal (GI) tract on the development of endophenotypes in animal models of ASD. By influencing environmental conditions, it might be possible to reduce or limit the severity of ASD pathology."}],"page":"159 - 187","citation":{"ama":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. Extracerebral dysfunction in animal models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:159-187. doi:10.1007/978-3-319-52498-6_9","apa":"Hill Yardin, E., Mckeown, S., Novarino, G., & Grabrucker, A. (2017). Extracerebral dysfunction in animal models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 159–187). Springer. https://doi.org/10.1007/978-3-319-52498-6_9","ieee":"E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral dysfunction in animal models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 159–187.","ista":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. 2017.Extracerebral dysfunction in animal models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 159–187.","short":"E. Hill Yardin, S. Mckeown, G. Novarino, A. Grabrucker, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 159–187.","mla":"Hill Yardin, Elisa, et al. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 159–87, doi:10.1007/978-3-319-52498-6_9.","chicago":"Hill Yardin, Elisa, Sonja Mckeown, Gaia Novarino, and Andreas Grabrucker. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:159–87. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_9."},"publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","date_published":"2017-05-28T00:00:00Z","series_title":"Advances in Anatomy Embryology and Cell Biology","scopus_import":1,"day":"28","editor":[{"first_name":"Michael","last_name":"Schmeisser","full_name":"Schmeisser, Michael"},{"full_name":"Boekers, Tobias","first_name":"Tobias","last_name":"Boekers"}],"department":[{"_id":"GaNo"}],"publisher":"Springer","publication_status":"published","year":"2017","volume":224,"date_updated":"2021-01-12T08:06:46Z","date_created":"2018-12-11T11:47:33Z","author":[{"last_name":"Hill Yardin","first_name":"Elisa","full_name":"Hill Yardin, Elisa"},{"full_name":"Mckeown, Sonja","first_name":"Sonja","last_name":"Mckeown"},{"full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","last_name":"Grabrucker","full_name":"Grabrucker, Andreas"}],"publist_id":"7177","quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-52498-6_9","publication_identifier":{"issn":["03015556"],"isbn":["978-3-319-52496-2"]},"month":"05"},{"publication_identifier":{"issn":["00405809"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1016/j.tpb.2017.06.001","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"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"},"oa":1,"publist_id":"7169","ec_funded":1,"file_date_updated":"2020-07-14T12:47:25Z","volume":118,"date_created":"2018-12-11T11:47:34Z","date_updated":"2021-01-12T08:06:50Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"}],"department":[{"_id":"NiBa"}],"publisher":"Academic Press","publication_status":"published","year":"2017","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-12-01T00:00:00Z","page":"50 - 73","citation":{"ama":"Barton NH, Etheridge A, Véber A. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 2017;118:50-73. doi:10.1016/j.tpb.2017.06.001","ista":"Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “The infinitesimal model: Definition derivation and implications,” Theoretical Population Biology, vol. 118. Academic Press, pp. 50–73, 2017.","apa":"Barton, N. H., Etheridge, A., & Véber, A. (2017). The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2017.06.001","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.","short":"N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017) 50–73.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology. Academic Press, 2017. https://doi.org/10.1016/j.tpb.2017.06.001."},"publication":"Theoretical Population Biology","abstract":[{"text":"Our focus here is on the infinitesimal model. In this model, one or several quantitative traits are described as the sum of a genetic and a non-genetic component, the first being distributed within families as a normal random variable centred at the average of the parental genetic components, and with a variance independent of the parental traits. Thus, the variance that segregates within families is not perturbed by selection, and can be predicted from the variance components. This does not necessarily imply that the trait distribution across the whole population should be Gaussian, and indeed selection or population structure may have a substantial effect on the overall trait distribution. One of our main aims is to identify some general conditions on the allelic effects for the infinitesimal model to be accurate. We first review the long history of the infinitesimal model in quantitative genetics. Then we formulate the model at the phenotypic level in terms of individual trait values and relationships between individuals, but including different evolutionary processes: genetic drift, recombination, selection, mutation, population structure, …. We give a range of examples of its application to evolutionary questions related to stabilising selection, assortative mating, effective population size and response to selection, habitat preference and speciation. We provide a mathematical justification of the model as the limit as the number M of underlying loci tends to infinity of a model with Mendelian inheritance, mutation and environmental noise, when the genetic component of the trait is purely additive. We also show how the model generalises to include epistatic effects. We prove in particular that, within each family, the genetic components of the individual trait values in the current generation are indeed normally distributed with a variance independent of ancestral traits, up to an error of order 1∕M. Simulations suggest that in some cases the convergence may be as fast as 1∕M.","lang":"eng"}],"type":"journal_article","file":[{"file_name":"IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf","access_level":"open_access","file_size":1133924,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4964","date_created":"2018-12-12T10:12:45Z","date_updated":"2020-07-14T12:47:25Z","checksum":"7dd02bfcfe8f244f4a6c19091aedf2c8"}],"oa_version":"Published Version","pubrep_id":"908","intvolume":" 118","status":"public","title":"The infinitesimal model: Definition derivation and implications","ddc":["576"],"_id":"626","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games."}],"alternative_title":["LNCS"],"type":"book_chapter","oa_version":"Submitted Version","file":[{"creator":"dernst","file_size":192826,"content_type":"application/pdf","access_level":"open_access","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","checksum":"b2402766ec02c79801aac634bd8f9f6c","date_created":"2019-11-19T08:06:50Z","date_updated":"2020-07-14T12:47:25Z","file_id":"7048","relation":"main_file"}],"intvolume":" 10460","title":"The cost of exactness in quantitative reachability","ddc":["000"],"status":"public","_id":"625","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","has_accepted_license":"1","day":"25","series_title":"Theoretical Computer Science and General Issues","scopus_import":"1","date_published":"2017-07-25T00:00:00Z","page":"367 - 381","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18","ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18"},"publication":"Models, Algorithms, Logics and Tools","publist_id":"7170","ec_funded":1,"file_date_updated":"2020-07-14T12:47:25Z","volume":10460,"date_created":"2018-12-11T11:47:34Z","date_updated":"2022-05-23T08:54:02Z","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"editor":[{"first_name":"Luca","last_name":"Aceto","full_name":"Aceto, Luca"},{"full_name":"Bacci, Giorgio","first_name":"Giorgio","last_name":"Bacci"},{"first_name":"Anna","last_name":"Ingólfsdóttir","full_name":"Ingólfsdóttir, Anna"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"last_name":"Mardare","first_name":"Radu","full_name":"Mardare, Radu"}],"publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2017","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-63120-2"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-63121-9_18","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","oa":1},{"month":"09","publication_identifier":{"issn":["21678359"]},"doi":"10.7717/peerj.3830","language":[{"iso":"eng"}],"oa":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"},"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:24Z","publist_id":"7172","article_number":"3830","author":[{"full_name":"Nikolic, Nela","last_name":"Nikolic","first_name":"Nela","orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zrinka","last_name":"Didara","full_name":"Didara, Zrinka"},{"last_name":"Moll","first_name":"Isabella","full_name":"Moll, Isabella"}],"date_updated":"2021-01-12T08:06:48Z","date_created":"2018-12-11T11:47:33Z","volume":2017,"acknowledgement":"Austrian Science Fund (FWF): M1697, P22249; Swiss National Science Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG F43","year":"2017","publication_status":"published","department":[{"_id":"CaGu"}],"publisher":"PeerJ","day":"21","has_accepted_license":"1","scopus_import":1,"date_published":"2017-09-21T00:00:00Z","publication":"PeerJ","citation":{"ieee":"N. Nikolic, Z. Didara, and I. Moll, “MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations,” PeerJ, vol. 2017, no. 9. PeerJ, 2017.","apa":"Nikolic, N., Didara, Z., & Moll, I. (2017). MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. PeerJ. https://doi.org/10.7717/peerj.3830","ista":"Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9), 3830.","ama":"Nikolic N, Didara Z, Moll I. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017;2017(9). doi:10.7717/peerj.3830","chicago":"Nikolic, Nela, Zrinka Didara, and Isabella Moll. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ. PeerJ, 2017. https://doi.org/10.7717/peerj.3830.","short":"N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017).","mla":"Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830."},"abstract":[{"text":"Bacteria adapt to adverse environmental conditions by altering gene expression patterns. Recently, a novel stress adaptation mechanism has been described that allows Escherichia coli to alter gene expression at the post-transcriptional level. The key player in this regulatory pathway is the endoribonuclease MazF, the toxin component of the toxin-antitoxin module mazEF that is triggered by various stressful conditions. In general, MazF degrades the majority of transcripts by cleaving at ACA sites, which results in the retardation of bacterial growth. Furthermore, MazF can process a small subset of mRNAs and render them leaderless by removing their ribosome binding site. MazF concomitantly modifies ribosomes, making them selective for the translation of leaderless mRNAs. In this study, we employed fluorescent reporter-systems to investigate mazEF expression during stressful conditions, and to infer consequences of the mRNA processing mediated by MazF on gene expression at the single-cell level. Our results suggest that mazEF transcription is maintained at low levels in single cells encountering adverse conditions, such as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as a model for MazF-mediated mRNA processing, we found that MazF activation promotes heterogeneity in the grcA reporter expression, resulting in a subpopulation of cells with increased levels of GrcA reporter protein.","lang":"eng"}],"issue":"9","type":"journal_article","pubrep_id":"909","file":[{"access_level":"open_access","file_name":"IST-2017-909-v1+1_peerj-3830.pdf","creator":"system","content_type":"application/pdf","file_size":682064,"file_id":"4908","relation":"main_file","checksum":"3d79ae6b6eabc90b0eaaed82ff3493b0","date_created":"2018-12-12T10:11:51Z","date_updated":"2020-07-14T12:47:24Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"624","title":"MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations","status":"public","ddc":["579"],"intvolume":" 2017"},{"ec_funded":1,"publist_id":"7166","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"full_name":"Murhekar, Aniket","last_name":"Murhekar","first_name":"Aniket"}],"volume":10426,"date_updated":"2021-01-12T08:06:55Z","date_created":"2018-12-11T11:47:35Z","year":"2017","publisher":"Springer","department":[{"_id":"KrCh"}],"editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"last_name":"Kunčak","first_name":"Viktor","full_name":"Kunčak, Viktor"}],"publication_status":"published","publication_identifier":{"isbn":["978-331963386-2"]},"month":"01","doi":"10.1007/978-3-319-63387-9_6","conference":{"name":"CAV: Computer Aided Verification","end_date":"2017-07-28","start_date":"2017-07-24","location":"Heidelberg, Germany"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00314"}],"oa":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","abstract":[{"text":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"628","intvolume":" 10426","title":"Automated recurrence analysis for almost linear expected runtime bounds","status":"public","day":"01","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","citation":{"ama":"Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6","ista":"Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.","apa":"Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6","ieee":"K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.","mla":"Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6."},"page":"118 - 139"},{"publist_id":"7165","author":[{"first_name":"Martin","last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin"},{"first_name":"Katja","last_name":"Zieske","full_name":"Zieske, Katja"},{"last_name":"Schwille","first_name":"Petra","full_name":"Schwille, Petra"}],"volume":84,"date_created":"2018-12-11T11:47:35Z","date_updated":"2021-01-12T08:06:57Z","pmid":1,"year":"2017","department":[{"_id":"MaLo"}],"publisher":"Springer","publication_status":"published","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"month":"05","doi":"10.1007/978-3-319-53047-5_15","language":[{"iso":"eng"}],"external_id":{"pmid":["28500535"]},"quality_controlled":"1","abstract":[{"text":"Even simple cells like bacteria have precisely regulated cellular anatomies, which allow them to grow, divide and to respond to internal or external cues with high fidelity. How spatial and temporal intracellular organization in prokaryotic cells is achieved and maintained on the basis of locally interacting proteins still remains largely a mystery. Bulk biochemical assays with purified components and in vivo experiments help us to approach key cellular processes from two opposite ends, in terms of minimal and maximal complexity. However, to understand how cellular phenomena emerge, that are more than the sum of their parts, we have to assemble cellular subsystems step by step from the bottom up. Here, we review recent in vitro reconstitution experiments with proteins of the bacterial cell division machinery and illustrate how they help to shed light on fundamental cellular mechanisms that constitute spatiotemporal order and regulate cell division.","lang":"eng"}],"type":"book_chapter","oa_version":"None","_id":"629","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 84","status":"public","title":"Reconstitution of protein dynamics involved in bacterial cell division","day":"13","scopus_import":1,"series_title":"Sub-Cellular Biochemistry","date_published":"2017-05-13T00:00:00Z","citation":{"chicago":"Loose, Martin, Katja Zieske, and Petra Schwille. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” In Prokaryotic Cytoskeletons, 84:419–44. Sub-Cellular Biochemistry. Springer, 2017. https://doi.org/10.1007/978-3-319-53047-5_15.","mla":"Loose, Martin, et al. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–44, doi:10.1007/978-3-319-53047-5_15.","short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","ista":"Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444.","ieee":"M. Loose, K. Zieske, and P. Schwille, “Reconstitution of protein dynamics involved in bacterial cell division,” in Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–444.","apa":"Loose, M., Zieske, K., & Schwille, P. (2017). Reconstitution of protein dynamics involved in bacterial cell division. In Prokaryotic Cytoskeletons (Vol. 84, pp. 419–444). Springer. https://doi.org/10.1007/978-3-319-53047-5_15","ama":"Loose M, Zieske K, Schwille P. Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. Vol 84. Sub-Cellular Biochemistry. Springer; 2017:419-444. doi:10.1007/978-3-319-53047-5_15"},"publication":"Prokaryotic Cytoskeletons","page":"419 - 444"},{"publist_id":"7164","file_date_updated":"2020-07-14T12:47:27Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","author":[{"full_name":"Sauermann, Stefan","last_name":"Sauermann","first_name":"Stefan"},{"full_name":"David, Veronika","last_name":"David","first_name":"Veronika"},{"first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"first_name":"Reinhard","last_name":"Egelkraut","full_name":"Egelkraut, Reinhard"},{"full_name":"Frohner, Matthias","last_name":"Frohner","first_name":"Matthias"},{"last_name":"Pohn","first_name":"Birgit","full_name":"Pohn, Birgit"},{"last_name":"Urbauer","first_name":"Philipp","full_name":"Urbauer, Philipp"},{"last_name":"Mense","first_name":"Alexander","full_name":"Mense, Alexander"}],"volume":236,"date_created":"2018-12-11T11:47:36Z","date_updated":"2021-01-12T08:06:59Z","year":"2017","publisher":"IOS Press","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"publication_status":"published","publication_identifier":{"isbn":["978-161499758-0"]},"month":"01","doi":"10.3233/978-1-61499-759-7-356","conference":{"start_date":"2017-05-23","location":"Vienna, Austria","end_date":"2017-05-24","name":"eHealth: Health Informatics Meets eHealth"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Background: Standards have become available to share semantically encoded vital parameters from medical devices, as required for example by personal healthcare records. Standardised sharing of biosignal data largely remains open. Objectives: The goal of this work is to explore available biosignal file format and data exchange standards and profiles, and to conceptualise end-To-end solutions. Methods: The authors reviewed and discussed available biosignal file format standards with other members of international standards development organisations (SDOs). Results: A raw concept for standards based acquisition, storage, archiving and sharing of biosignals was developed. The GDF format may serve for storing biosignals. Signals can then be shared using FHIR resources and may be stored on FHIR servers or in DICOM archives, with DICOM waveforms as one possible format. Conclusion: Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged in intensive discussions. This discussion extends existing work that already was adopted by large implementer communities. The concept presented here only reports the current status of the discussion in Austria. The discussion will continue internationally, with results to be expected over the coming years."}],"type":"conference","alternative_title":["Studies in Health Technology and Informatics"],"pubrep_id":"906","oa_version":"Published Version","file":[{"file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf","access_level":"open_access","file_size":443635,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4913","date_updated":"2020-07-14T12:47:27Z","date_created":"2018-12-12T10:11:56Z","checksum":"1254dcc5b04a996d97fad9a726b42727"}],"_id":"630","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 236","title":"Biosignals standards and FHIR: The way to go","ddc":["005"],"status":"public","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","citation":{"mla":"Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go. Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.","short":"S. Sauermann, V. David, A. Schlögl, R. Egelkraut, M. Frohner, B. Pohn, P. Urbauer, A. Mense, in:, IOS Press, 2017, pp. 356–362.","chicago":"Sauermann, Stefan, Veronika David, Alois Schlögl, Reinhard Egelkraut, Matthias Frohner, Birgit Pohn, Philipp Urbauer, and Alexander Mense. “Biosignals Standards and FHIR: The Way to Go,” 236:356–62. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-759-7-356.","ama":"Sauermann S, David V, Schlögl A, et al. Biosignals standards and FHIR: The way to go. In: Vol 236. IOS Press; 2017:356-362. doi:10.3233/978-1-61499-759-7-356","ista":"Sauermann S, David V, Schlögl A, Egelkraut R, Frohner M, Pohn B, Urbauer P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health Informatics Meets eHealth, Studies in Health Technology and Informatics, vol. 236, 356–362.","apa":"Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B., … Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press. https://doi.org/10.3233/978-1-61499-759-7-356","ieee":"S. Sauermann et al., “Biosignals standards and FHIR: The way to go,” presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017, vol. 236, pp. 356–362."},"page":"356 - 362"},{"author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"first_name":"Nicolas","last_name":"Rougerie","full_name":"Rougerie, Nicolas"}],"volume":145,"date_created":"2018-12-11T11:47:36Z","date_updated":"2021-01-12T08:07:03Z","year":"2017","department":[{"_id":"RoSe"}],"publisher":"American Mathematical Society","publication_status":"published","publist_id":"7160","ec_funded":1,"doi":"10.1090/proc/13468","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.09045"}],"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","month":"01","oa_version":"Submitted Version","_id":"632","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 145","title":"A note on 2D focusing many boson systems","status":"public","issue":"6","abstract":[{"lang":"eng","text":"We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w < 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 < β < 3/4. "}],"type":"journal_article","date_published":"2017-01-01T00:00:00Z","citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society. American Mathematical Society, 2017. https://doi.org/10.1090/proc/13468.","mla":"Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.","short":"M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society 145 (2017) 2441–2454.","ista":"Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 145(6), 2441–2454.","ieee":"M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” Proceedings of the American Mathematical Society, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017.","apa":"Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/13468","ama":"Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 2017;145(6):2441-2454. doi:10.1090/proc/13468"},"publication":"Proceedings of the American Mathematical Society","page":"2441 - 2454","day":"01","scopus_import":1},{"date_published":"2017-05-28T00:00:00Z","page":"189 - 211","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","citation":{"ama":"Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:189-211. doi:10.1007/978-3-319-52498-6_10","ista":"Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.","ieee":"J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 189–211.","apa":"Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer. https://doi.org/10.1007/978-3-319-52498-6_10","mla":"Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10.","short":"J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 189–211.","chicago":"Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10."},"day":"28","series_title":"Advances in Anatomy Embryology and Cell Biology","scopus_import":1,"oa_version":"None","title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","status":"public","intvolume":" 224","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"634","abstract":[{"lang":"eng","text":"As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans."}],"alternative_title":["ADVSANAT"],"type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-52498-6_10","quality_controlled":"1","project":[{"name":"Transmembrane Transporters in Health and Disease","call_identifier":"FWF","grant_number":"F03523","_id":"25473368-B435-11E9-9278-68D0E5697425"}],"month":"05","publication_identifier":{"eisbn":["978-3-319-52498-6"]},"date_created":"2018-12-11T11:47:37Z","date_updated":"2021-01-12T08:07:08Z","volume":224,"author":[{"full_name":"Schroeder, Jan","first_name":"Jan","last_name":"Schroeder"},{"orcid":"0000-0002-7370-5293","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","last_name":"Deliu","first_name":"Elena","full_name":"Deliu, Elena"},{"orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia"},{"full_name":"Schmeisser, Michael","first_name":"Michael","last_name":"Schmeisser"}],"publication_status":"published","publisher":"Springer","editor":[{"first_name":"Michael","last_name":"Schmeisser","full_name":"Schmeisser, Michael"},{"full_name":"Boekers, Tobias","last_name":"Boekers","first_name":"Tobias"}],"department":[{"_id":"GaNo"}],"year":"2017","publist_id":"7156"},{"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-63501-9_6","conference":{"name":"NSV: Numerical Software Verification","end_date":"2017-07-23","start_date":"2017-07-22","location":"Heidelberg, Germany"},"publication_identifier":{"isbn":["978-331963500-2"]},"month":"01","publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"full_name":"Abate, Alessandro","first_name":"Alessandro","last_name":"Abate"},{"last_name":"Bodo","first_name":"Sylvie","full_name":"Bodo, Sylvie"}],"publication_status":"published","year":"2017","volume":10381,"date_created":"2018-12-11T11:47:37Z","date_updated":"2021-01-12T08:07:06Z","author":[{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bogomolov, Sergiy","first_name":"Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Kumar","first_name":"Aviral","full_name":"Kumar, Aviral"}],"publist_id":"7159","page":"83 - 89","citation":{"chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. https://doi.org/10.1007/978-3-319-63501-9_6.","mla":"Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.","ista":"Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation of hybrid rapidly exploring random trees. NSV: Numerical Software Verification, LNCS, vol. 10381, 83–89.","apa":"Bak, S., Bogomolov, S., Henzinger, T. A., & Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate & S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63501-9_6","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.","ama":"Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6"},"date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01","intvolume":" 10381","title":"Challenges and tool implementation of hybrid rapidly exploring random trees","status":"public","_id":"633","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.","lang":"eng"}]},{"citation":{"mla":"Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2","ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.","apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62."},"page":"33 - 62","date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"635","intvolume":" 10212","title":"Scrypt is maximally memory hard","status":"public","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2016/989","open_access":"1"}],"oa":1,"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"quality_controlled":"1","doi":"10.1007/978-3-319-56617-7_2","conference":{"end_date":"2017-05-04","location":"Paris, France","start_date":"2017-04-30","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331956616-0"]},"month":"01","year":"2017","editor":[{"full_name":"Coron, Jean-Sébastien","first_name":"Jean-Sébastien","last_name":"Coron"},{"last_name":"Buus Nielsen","first_name":"Jesper","full_name":"Buus Nielsen, Jesper"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"full_name":"Chen, Binchi","first_name":"Binchi","last_name":"Chen"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Reyzin","first_name":"Leonid","full_name":"Reyzin, Leonid"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"volume":10212,"date_created":"2018-12-11T11:47:37Z","date_updated":"2021-01-12T08:07:10Z","ec_funded":1,"publist_id":"7154"},{"author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"full_name":"Ulus, Dogan","last_name":"Ulus","first_name":"Dogan"}],"date_updated":"2021-01-12T08:07:14Z","date_created":"2018-12-11T11:47:38Z","volume":10419,"year":"2017","publication_status":"published","editor":[{"last_name":"Abate","first_name":"Alessandro","full_name":"Abate, Alessandro"},{"full_name":"Geeraerts, Gilles","first_name":"Gilles","last_name":"Geeraerts"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","publist_id":"7152","conference":{"location":"Berlin, Germany","start_date":"2017-09-05","end_date":"2017-09-07","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"doi":"10.1007/978-3-319-65765-3_11","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01552132"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"month":"08","publication_identifier":{"isbn":["978-331965764-6"]},"oa_version":"Submitted Version","_id":"636","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"On the quantitative semantics of regular expressions over real-valued signals","status":"public","intvolume":" 10419","abstract":[{"text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2017-08-03T00:00:00Z","citation":{"ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","apa":"Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate & G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11","ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","mla":"Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11."},"page":"189 - 206","day":"03","scopus_import":1},{"title":"Numerical Software Verification","status":"public","publication_status":"published","editor":[{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy"},{"full_name":"Martel, Matthieu","first_name":"Matthieu","last_name":"Martel"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"intvolume":" 10152","department":[{"_id":"ToHe"}],"publisher":"Springer","_id":"638","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","date_updated":"2022-05-24T07:09:52Z","date_created":"2018-12-11T11:47:38Z","oa_version":"None","volume":10152,"type":"conference_editor","abstract":[{"text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability.","lang":"eng"}],"publist_id":"7150","quality_controlled":"1","citation":{"ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","apa":"Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.","ama":"Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8.","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017."},"language":[{"iso":"eng"}],"conference":{"name":"NSV: Numerical Software Verification","end_date":"2016-07-18","location":"Toronto, ON, Canada","start_date":"2016-07-17"},"doi":"10.1007/978-3-319-54292-8","date_published":"2017-01-01T00:00:00Z","series_title":"LNCS","month":"01","day":"01","publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"article_processing_charge":"No"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-56617-7_1","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Paris, France","start_date":"2017-04-30","end_date":"2017-05-04"},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/875","open_access":"1"}],"oa":1,"publication_identifier":{"isbn":["978-331956616-0"]},"month":"04","volume":10212,"date_updated":"2021-01-12T08:07:22Z","date_created":"2018-12-11T11:47:39Z","author":[{"full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","editor":[{"full_name":"Coron, Jean-Sébastien","first_name":"Jean-Sébastien","last_name":"Coron"},{"last_name":"Buus Nielsen","first_name":"Jesper","full_name":"Buus Nielsen, Jesper"}],"publication_status":"published","year":"2017","publist_id":"7148","ec_funded":1,"date_published":"2017-04-01T00:00:00Z","page":"3 - 32","citation":{"short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","mla":"Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32."},"day":"01","scopus_import":1,"oa_version":"Submitted Version","intvolume":" 10212","title":"Depth-robust graphs and their cumulative memory complexity","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"640","abstract":[{"text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"641","year":"2017","intvolume":" 10302","publisher":"Springer","editor":[{"last_name":"Lauze","first_name":"François","full_name":"Lauze, François"},{"last_name":"Dong","first_name":"Yiqiu","full_name":"Dong, Yiqiu"},{"last_name":"Bjorholm Dahl","first_name":"Anders","full_name":"Bjorholm Dahl, Anders"}],"department":[{"_id":"VlKo"}],"status":"public","publication_status":"published","title":"Graphical model parameter learning by inverse linear programming","author":[{"first_name":"Vera","last_name":"Trajkovska","full_name":"Trajkovska, Vera"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Åström, Freddie","last_name":"Åström","first_name":"Freddie"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}],"oa_version":"None","volume":10302,"date_created":"2018-12-11T11:47:39Z","date_updated":"2021-01-12T08:07:23Z","type":"conference","alternative_title":["LNCS"],"publist_id":"7147","abstract":[{"lang":"eng","text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches."}],"citation":{"ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","mla":"Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26."},"page":"323 - 334","quality_controlled":"1","doi":"10.1007/978-3-319-58771-4_26","date_published":"2017-01-01T00:00:00Z","conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","end_date":"2017-06-08","start_date":"2017-06-04","location":"Kolding, Denmark"},"language":[{"iso":"eng"}],"scopus_import":1,"publication_identifier":{"isbn":["978-331958770-7"]},"day":"01","month":"01"},{"language":[{"iso":"eng"}],"date_published":"2017-08-04T00:00:00Z","doi":"10.15479/AT:IST-2018-853-v2-2","page":"28","oa":1,"citation":{"apa":"Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2."},"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"04","month":"08","oa_version":"Published Version","file":[{"file_name":"main(1).pdf","access_level":"open_access","file_size":971347,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"6431","date_created":"2019-05-13T08:14:44Z","date_updated":"2020-07-14T12:47:30Z","checksum":"b48d42725182d7ca10107a118815f4cf"}],"date_created":"2019-05-13T08:15:55Z","date_updated":"2023-02-21T16:59:21Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"133"}]},"author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"department":[{"_id":"ToHe"}],"publisher":"IST Austria","ddc":["000"],"publication_status":"published","status":"public","title":"Synchronizing the asynchronous","_id":"6426","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs."}],"file_date_updated":"2020-07-14T12:47:30Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report"},{"issue":"4","abstract":[{"text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","_id":"643","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 60","status":"public","title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","ddc":["570"],"article_processing_charge":"No","day":"31","scopus_import":1,"date_published":"2017-08-31T00:00:00Z","citation":{"mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469.","ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469","ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469"},"publication":"Chinese Journal of Physiology","page":"207 - 214","article_type":"original","publist_id":"7142","author":[{"last_name":"Sun","first_name":"Wuping","full_name":"Sun, Wuping"},{"full_name":"Zhai, Ming-Zhu","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Zhai","first_name":"Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"full_name":"Qian, Chengrui","last_name":"Qian","first_name":"Chengrui"},{"full_name":"Jiang, Changyu","first_name":"Changyu","last_name":"Jiang"}],"volume":60,"date_updated":"2021-01-12T08:07:28Z","date_created":"2018-12-11T11:47:40Z","pmid":1,"year":"2017","publisher":"Chinese Physiological Society","department":[{"_id":"RySh"}],"publication_status":"published","publication_identifier":{"issn":["03044920"]},"month":"08","doi":"10.4077/CJP.2017.BAF469","language":[{"iso":"eng"}],"external_id":{"pmid":["28847140"]},"quality_controlled":"1"},{"date_published":"2017-01-01T00:00:00Z","publication":"Mathematics of Computation","citation":{"ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","apa":"Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201.","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397."},"page":"2373 - 2397","day":"01","scopus_import":1,"oa_version":"Submitted Version","_id":"642","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Localization errors in solving stochastic partial differential equations in the whole space","intvolume":" 86","abstract":[{"lang":"eng","text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable."}],"issue":"307","type":"journal_article","doi":"10.1090/mcom/3201","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.05535"}],"oa":1,"quality_controlled":"1","month":"01","publication_identifier":{"issn":["00255718"]},"author":[{"last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"last_name":"Gyöngy","first_name":"István","full_name":"Gyöngy, István"}],"date_created":"2018-12-11T11:47:40Z","date_updated":"2021-01-12T08:07:26Z","volume":86,"year":"2017","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"American Mathematical Society","publist_id":"7144"}]