[{"type":"conference","intvolume":"       259","publication_identifier":{"issn":["2075-2180"]},"ddc":["004"],"file_date_updated":"2020-07-14T12:47:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1710.03391v1","open_access":"1"}],"author":[{"last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd","first_name":"Bernd"},{"first_name":"Andrey","full_name":"Kupriyanov, Andrey","last_name":"Kupriyanov","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-10-17T12:02:46Z","abstract":[{"text":"Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a new class of model checking algorithms that capture the causal relationships in a special data structure called concurrent traces. Concurrent traces identify key events in an execution history and link them through their cause-effect relationships. The model checker builds a tableau of concurrent traces, where the case splits represent different causal explanations of a hypothetical error. Causality-based model checking has been implemented in the ARCTOR tool, and applied to previously intractable multi-threaded benchmarks.","lang":"eng"}],"page":"31 - 38","conference":{"end_date":"2017-04-29","start_date":"2017-04-29","location":"Uppsala, Sweden","name":"CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies"},"_id":"549","date_published":"2017-10-10T00:00:00Z","title":"Causality-based model checking","date_created":"2018-12-11T11:47:07Z","publication_status":"published","citation":{"ista":"Finkbeiner B, Kupriyanov A. 2017. Causality-based model checking. Electronic Proceedings in Theoretical Computer Science. CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies, EPTCS, vol. 259, 31–38.","short":"B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017, pp. 31–38.","mla":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 259, Open Publishing Association, 2017, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>.","chicago":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 259:31–38. Open Publishing Association, 2017. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>.","apa":"Finkbeiner, B., &#38; Kupriyanov, A. (2017). Causality-based model checking. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 259, pp. 31–38). Uppsala, Sweden: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>","ieee":"B. Finkbeiner and A. Kupriyanov, “Causality-based model checking,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Uppsala, Sweden, 2017, vol. 259, pp. 31–38.","ama":"Finkbeiner B, Kupriyanov A. Causality-based model checking. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 259. Open Publishing Association; 2017:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>"},"department":[{"_id":"ToHe"}],"publisher":"Open Publishing Association","file":[{"file_size":209294,"file_id":"4939","creator":"system","access_level":"open_access","relation":"main_file","checksum":"6274f6c0da3376a7b079180d81568518","date_updated":"2020-07-14T12:47:00Z","content_type":"application/pdf","date_created":"2018-12-12T10:12:21Z","file_name":"IST-2018-925-v1+1_1710.03391v1.pdf"}],"language":[{"iso":"eng"}],"year":"2017","status":"public","article_processing_charge":"No","month":"10","alternative_title":["EPTCS"],"pubrep_id":"925","publist_id":"7264","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","scopus_import":"1","oa_version":"Submitted Version","has_accepted_license":"1","quality_controlled":"1","volume":259,"oa":1,"project":[{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"doi":"10.4204/EPTCS.259.3","publication":"Electronic Proceedings in Theoretical Computer Science"},{"publication":"Electronic Communications in Probability","doi":"10.1214/17-ECP97","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"}],"oa":1,"volume":22,"quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"}]},"scopus_import":1,"day":"21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"926","publist_id":"7265","month":"11","year":"2017","language":[{"iso":"eng"}],"status":"public","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2018-12-12T10:08:04Z","file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"0ec05303a0de190de145654237984c79","date_updated":"2020-07-14T12:47:00Z","creator":"system","file_size":470876,"file_id":"4663"}],"publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","citation":{"ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","short":"J. Alt, Electronic Communications in Probability 22 (2017).","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>.","chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>.","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>","ama":"Alt J. Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” <i>Electronic Communications in Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017."},"date_created":"2018-12-11T11:47:07Z","ec_funded":1,"title":"Singularities of the density of states of random Gram matrices","date_published":"2017-11-21T00:00:00Z","_id":"550","article_number":"63","abstract":[{"text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities.","lang":"eng"}],"date_updated":"2023-09-07T12:38:08Z","author":[{"last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes","first_name":"Johannes"}],"file_date_updated":"2020-07-14T12:47:00Z","ddc":["539"],"publication_identifier":{"issn":["1083589X"]},"intvolume":"        22","type":"journal_article"},{"doi":"10.4230/LIPIcs.MFCS.2017.61","publication":"Leibniz International Proceedings in Informatics","oa":1,"volume":83,"scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","language":[{"iso":"eng"}],"year":"2017","status":"public","month":"11","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pubrep_id":"924","alternative_title":["LIPIcs"],"publist_id":"7263","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"file":[{"content_type":"application/pdf","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_created":"2018-12-12T10:18:04Z","file_id":"5322","file_size":535077,"creator":"system","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","date_updated":"2020-07-14T12:47:00Z","access_level":"open_access","relation":"main_file"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2017-11-01T00:00:00Z","_id":"551","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","citation":{"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.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"publication_status":"published","date_created":"2018-12-11T11:47:08Z","file_date_updated":"2020-07-14T12:47:00Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"date_updated":"2021-01-12T08:02:34Z","conference":{"end_date":"2017-08-25","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Aalborg, Denmark"},"article_number":"61","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"}],"intvolume":"        83","type":"conference","publication_identifier":{"isbn":["978-395977046-0"]},"ddc":["004"]},{"volume":83,"oa":1,"publication":"Leibniz International Proceedings in Informatics","project":[{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}],"doi":"10.4230/LIPIcs.MFCS.2017.39","pubrep_id":"923","alternative_title":["LIPIcs"],"publist_id":"7262","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","year":"2017","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"11","has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","date_created":"2018-12-11T11:47:08Z","citation":{"apa":"Chatterjee, K., Henzinger, M. H., &#38; Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>.","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."},"publication_status":"published","date_published":"2017-11-01T00:00:00Z","_id":"552","ec_funded":1,"title":"Faster algorithms for mean-payoff parity games","file":[{"content_type":"application/pdf","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_created":"2018-12-12T10:16:57Z","file_id":"5248","file_size":610339,"creator":"system","date_updated":"2020-07-14T12:47:00Z","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","access_level":"open_access","relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["978-395977046-0"]},"ddc":["004"],"type":"conference","intvolume":"        83","date_updated":"2023-02-14T10:06:46Z","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)."}],"article_number":"39","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Aalborg, Denmark","end_date":"2017-08-25","start_date":"2017-08-21"},"file_date_updated":"2020-07-14T12:47:00Z","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}]},{"scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","year":"2017","language":[{"iso":"eng"}],"status":"public","month":"11","alternative_title":["LIPIcs"],"publist_id":"7261","pubrep_id":"922","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","doi":"10.4230/LIPIcs.MFCS.2017.55","publication":"Leibniz International Proceedings in Informatics","volume":83,"oa":1,"file_date_updated":"2020-07-14T12:47:00Z","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Hansen","full_name":"Hansen, Kristofer","first_name":"Kristofer"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"}],"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"date_updated":"2021-01-12T08:02:35Z","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"}],"article_number":"55","conference":{"location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2017-08-25","start_date":"2017-08-21"},"intvolume":"        83","type":"conference","publication_identifier":{"isbn":["978-395977046-0"]},"ddc":["004"],"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"date_updated":"2020-07-14T12:47:00Z","checksum":"7101facb56ade363205c695d72dbd173","relation":"main_file","access_level":"open_access","creator":"system","file_size":549967,"file_id":"4753","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_created":"2018-12-12T10:09:29Z","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"553","date_published":"2017-11-01T00:00:00Z","title":"Strategy complexity of concurrent safety games","date_created":"2018-12-11T11:47:08Z","citation":{"short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>.","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>.","apa":"Chatterjee, K., Hansen, K., &#38; Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","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."},"publication_status":"published"},{"day":"02","ddc":["519"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","year":"2017","status":"public","type":"research_data","article_processing_charge":"No","abstract":[{"text":"Strong amplifiers of natural selection","lang":"eng"}],"has_accepted_license":"1","date_updated":"2024-02-21T13:48:42Z","author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"},{"full_name":"Tkadlec, Josef","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Nowak ","full_name":"Nowak , Martin","first_name":"Martin"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:02Z","related_material":{"record":[{"id":"5452","status":"public","relation":"research_paper"},{"id":"5751","status":"public","relation":"research_paper"}]},"date_created":"2018-12-12T12:31:32Z","citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. Strong amplifiers of natural selection. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>.","mla":"Pavlogiannis, Andreas, et al. <i>Strong Amplifiers of Natural Selection</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. 2017. Strong amplifiers of natural selection, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>."},"datarep_id":"51","ec_funded":1,"title":"Strong amplifiers of natural selection","oa":1,"date_published":"2017-01-02T00:00:00Z","_id":"5559","file":[{"file_name":"IST-2017-51-v1+2_illustration.mp4","date_created":"2018-12-12T13:05:18Z","content_type":"video/mp4","checksum":"b427dd46a30096a1911b245640c47af8","date_updated":"2020-07-14T12:47:02Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":32987015,"file_id":"5644"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}],"department":[{"_id":"KrCh"}],"keyword":["natural selection"],"doi":"10.15479/AT:ISTA:51","publisher":"Institute of Science and Technology Austria"},{"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"file":[{"content_type":"application/zip","date_created":"2018-12-12T13:02:38Z","file_name":"IST-2017-53-v1+1_Data_MDE.zip","file_id":"5603","file_size":6773204,"creator":"system","access_level":"open_access","relation":"main_file","checksum":"d77859af757ac8025c50c7b12b52eaf3","date_updated":"2020-07-14T12:47:03Z"}],"keyword":["single cell microscopy","mother machine microfluidic device","AcrAB-TolC pump","multi-drug efflux","Escherichia coli"],"department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"Bio"}],"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:53","date_created":"2018-12-12T12:31:32Z","citation":{"short":"T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild, G. Tkačik, C.C. Guet, (2017).","mla":"Bergmiller, Tobias, et al. <i>Biased Partitioning of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>.","chicago":"Bergmiller, Tobias, Anna M Andersson, Kathrin Tomasek, Enrique Balleza, Daniel Kiviet, Robert Hauschild, Gašper Tkačik, and Calin C Guet. “Biased Partitioning of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>.","apa":"Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild, R., … Guet, C. C. (2017). Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>","ieee":"T. Bergmiller <i>et al.</i>, “Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity.” Institute of Science and Technology Austria, 2017.","ama":"Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>","ista":"Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik G, Guet CC. 2017. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>."},"datarep_id":"53","title":"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity","oa":1,"date_published":"2017-03-10T00:00:00Z","_id":"5560","abstract":[{"lang":"eng","text":"This repository contains the data collected for the manuscript \"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity\".\r\nThe data is compressed into a single archive. Within the archive, different folders correspond to figures of the main text and the SI of the related publication.\r\nData is saved as plain text, with each folder containing a separate readme file describing the format. Typically, the data is from fluorescence microscopy measurements of single cells growing in a microfluidic \"mother machine\" device, and consists of relevant values (primarily arbitrary unit or normalized fluorescence measurements, and division times / growth rates) after raw microscopy images have been processed, segmented, and their features extracted, as described in the methods section of the related publication."}],"has_accepted_license":"1","date_updated":"2024-02-21T13:49:00Z","oa_version":"Published Version","author":[{"last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5396-4346","first_name":"Tobias","full_name":"Bergmiller, Tobias"},{"id":"2B8A40DA-F248-11E8-B48F-1D18A9856A87","last_name":"Andersson","full_name":"Andersson, Anna M","first_name":"Anna M","orcid":"0000-0003-2912-6769"},{"orcid":"0000-0003-3768-877X","first_name":"Kathrin","full_name":"Tomasek, Kathrin","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","last_name":"Tomasek"},{"first_name":"Enrique","full_name":"Balleza, Enrique","last_name":"Balleza"},{"last_name":"Kiviet","full_name":"Kiviet, Daniel","first_name":"Daniel"},{"orcid":"0000-0001-9843-3522","first_name":"Robert","full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455"},{"first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","id":"665","relation":"research_paper"}]},"file_date_updated":"2020-07-14T12:47:03Z","ddc":["571"],"day":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","type":"research_data","year":"2017","status":"public","article_processing_charge":"No"},{"date_published":"2017-02-13T00:00:00Z","_id":"5561","oa":1,"title":"Graph matching problems for annotating C. Elegans","datarep_id":"57","citation":{"short":"D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).","chicago":"Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>.","mla":"Kainmueller, Dagmar, et al. <i>Graph Matching Problems for Annotating C. Elegans</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>.","apa":"Kainmueller, D., Jug, F., Rother, C., &#38; Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>","ama":"Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>","ieee":"D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.","ista":"Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>."},"date_created":"2018-12-12T12:31:32Z","publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:57","keyword":["graph matching","feature matching","QAP","MAP-inference"],"department":[{"_id":"VlKo"}],"file":[{"file_id":"5614","file_size":327042819,"creator":"system","checksum":"3dc3e1306a66028a34181ebef2923139","date_updated":"2020-07-14T12:47:03Z","access_level":"open_access","relation":"main_file","content_type":"application/zip","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","date_created":"2018-12-12T13:02:54Z"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"article_processing_charge":"No","type":"research_data","status":"public","year":"2017","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"day":"13","file_date_updated":"2020-07-14T12:47:03Z","acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.","author":[{"first_name":"Dagmar","full_name":"Kainmueller, Dagmar","last_name":"Kainmueller"},{"last_name":"Jug","first_name":"Florian","full_name":"Jug, Florian"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"},{"last_name":"Meyers","first_name":"Gene","full_name":"Meyers, Gene"}],"oa_version":"Published Version","date_updated":"2024-02-21T13:46:31Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Graph matching problems as described in \"Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans.\" by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in \"Feature Correspondence via Graph Matching: Models and Global Optimization.\" by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. "}]},{"related_material":{"record":[{"id":"2257","status":"public","relation":"research_paper"}]},"file_date_updated":"2020-07-14T12:47:03Z","oa_version":"Published Version","author":[{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455"},{"full_name":"Amodei, Dario","first_name":"Dario","last_name":"Amodei"},{"last_name":"Schneidman","first_name":"Elad","full_name":"Schneidman, Elad"},{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"},{"last_name":"Berry","full_name":"Berry, Michael","first_name":"Michael"}],"has_accepted_license":"1","date_updated":"2024-02-21T13:46:14Z","abstract":[{"text":"This data was collected as part of the study [1]. It consists of preprocessed multi-electrode array recording from 160 salamander retinal ganglion cells responding to 297 repeats of a 19 s natural movie. The data is available in two formats: (1) a .mat file containing an array with dimensions “number of repeats” x “number of neurons” x “time in a repeat”; (2) a zipped .txt file containing the same data represented as an array with dimensions “number of neurons” x “number of samples”, where the number of samples is equal to the product of the number of repeats and timebins within a repeat. The time dimension is divided into 20 ms time windows, and the array is binary indicating whether a given cell elicited at least one spike in a given time window during a particular repeat. See the reference below for details regarding collection and preprocessing:\r\n\r\n[1] Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry MJ II. Searching for Collective Behavior in a Large Network of Sensory Neurons. PLoS Comput Biol. 2014;10(1):e1003408.","lang":"eng"}],"article_processing_charge":"No","type":"research_data","status":"public","year":"2017","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"day":"27","doi":"10.15479/AT:ISTA:61","publisher":"Institute of Science and Technology Austria","keyword":["multi-electrode recording","retinal ganglion cells"],"department":[{"_id":"GaTk"}],"file":[{"date_created":"2018-12-12T13:03:04Z","file_name":"IST-2017-61-v1+1_bint_fishmovie32_100.mat","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:03Z","checksum":"e620eff260646f57b479a69492c8b765","creator":"system","file_size":1336936,"file_id":"5622"},{"date_created":"2018-12-12T13:03:05Z","file_name":"IST-2017-61-v1+2_bint_fishmovie32_100.zip","content_type":"application/zip","relation":"main_file","access_level":"open_access","checksum":"de83f9b81ea0aae3cddfc3ed982e0759","date_updated":"2020-07-14T12:47:03Z","creator":"system","file_id":"5623","file_size":1897543}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"_id":"5562","date_published":"2017-02-27T00:00:00Z","oa":1,"title":"Multi-electrode array recording from salamander retinal ganglion cells","citation":{"ista":"Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. 2017. Multi-electrode array recording from salamander retinal ganglion cells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>.","apa":"Marre, O., Tkačik, G., Amodei, D., Schneidman, E., Bialek, W., &#38; Berry, M. (2017). Multi-electrode array recording from salamander retinal ganglion cells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:61\">https://doi.org/10.15479/AT:ISTA:61</a>","ieee":"O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Multi-electrode array recording from salamander retinal ganglion cells.” Institute of Science and Technology Austria, 2017.","ama":"Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. Multi-electrode array recording from salamander retinal ganglion cells. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>","short":"O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, M. Berry, (2017).","mla":"Marre, Olivier, et al. <i>Multi-Electrode Array Recording from Salamander Retinal Ganglion Cells</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>.","chicago":"Marre, Olivier, Gašper Tkačik, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Multi-Electrode Array Recording from Salamander Retinal Ganglion Cells.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:61\">https://doi.org/10.15479/AT:ISTA:61</a>."},"datarep_id":"61","date_created":"2018-12-12T12:31:33Z"},{"status":"public","year":"2017","type":"research_data","article_processing_charge":"No","month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["571"],"day":"20","file_date_updated":"2020-07-14T12:47:03Z","author":[{"first_name":"Martin","full_name":"Lukacisin, Martin","orcid":"0000-0001-6549-4177","last_name":"Lukacisin","id":"298FFE8C-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","has_accepted_license":"1","date_updated":"2024-02-21T13:46:47Z","abstract":[{"lang":"eng","text":"MATLAB code and processed datasets available for reproducing the results in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.\r\n*equal contributions"}],"date_published":"2017-03-20T00:00:00Z","_id":"5563","title":"MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'","oa":1,"date_created":"2018-12-12T12:31:33Z","datarep_id":"64","citation":{"ista":"Lukacisin M. 2017. MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>.","short":"M. Lukacisin, (2017).","mla":"Lukacisin, Martin. <i>MATLAB Analysis Code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>.","chicago":"Lukacisin, Martin. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:64\">https://doi.org/10.15479/AT:ISTA:64</a>.","apa":"Lukacisin, M. (2017). MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:64\">https://doi.org/10.15479/AT:ISTA:64</a>","ama":"Lukacisin M. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>","ieee":"M. Lukacisin, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2017."},"department":[{"_id":"ToBo"}],"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:64","license":"https://creativecommons.org/licenses/by-sa/4.0/","file":[{"checksum":"ee697f2b1ade4dc14d6ac0334dd832ab","date_updated":"2020-07-14T12:47:03Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":296722548,"file_id":"5602","file_name":"IST-2016-45-v1+1_PaperCode.zip","date_created":"2018-12-12T13:02:37Z","content_type":"application/zip"}],"tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)"}},{"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"file":[{"file_id":"5627","file_size":1225959109,"creator":"system","date_updated":"2020-07-14T12:47:03Z","checksum":"31a0c01d022721073241a23d192cc37e","access_level":"open_access","relation":"main_file","content_type":"application/zip","file_name":"IST-2017-65-v1+1_D_anc_1.fastq.zip","date_created":"2018-12-12T13:03:18Z"},{"file_name":"IST-2017-65-v1+1_D_anc_2.fastq.zip","date_created":"2018-12-12T13:03:30Z","content_type":"application/zip","date_updated":"2020-07-14T12:47:03Z","checksum":"d8f26f83ce7e7e45436121f9c6cd9b83","relation":"main_file","access_level":"open_access","creator":"system","file_size":1422656107,"file_id":"5628"},{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:03Z","checksum":"e07b99bcfe55b5f132ca03b8b48c8cbc","creator":"system","file_id":"5629","file_size":565014975,"date_created":"2018-12-12T13:03:33Z","file_name":"IST-2017-65-v1+2_D_A11_1.fastq.zip","content_type":"application/zip"},{"creator":"system","file_size":564490030,"file_id":"5630","checksum":"eda86143d5f32d844b54f8530041e32b","date_updated":"2020-07-14T12:47:03Z","relation":"main_file","access_level":"open_access","content_type":"application/zip","file_name":"IST-2017-65-v1+3_D_A11_2.fastq.zip","date_created":"2018-12-12T13:03:42Z"},{"creator":"system","file_size":875430169,"file_id":"5631","date_updated":"2020-07-14T12:47:03Z","checksum":"906d44f950c1626d9b99f34fbf89cb12","relation":"main_file","access_level":"open_access","content_type":"application/zip","file_name":"IST-2017-65-v1+4_D_C10_1.fastq.zip","date_created":"2018-12-12T13:03:46Z"},{"date_created":"2018-12-12T13:03:54Z","file_name":"IST-2017-65-v1+6_D_C08_2.fastq.zip","content_type":"application/zip","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:03Z","checksum":"6ca14a032a79e0c787106bdf635725c9","file_size":638298201,"file_id":"5632","creator":"system"},{"content_type":"application/zip","file_name":"IST-2017-65-v1+5_D_C10_2.fastq.zip","date_created":"2018-12-12T13:04:01Z","file_size":894702866,"file_id":"5633","creator":"system","checksum":"66ab16ddb5ba64b2e263ef746ebf2893","date_updated":"2020-07-14T12:47:03Z","access_level":"open_access","relation":"main_file"},{"file_name":"IST-2017-65-v1+7_D_C08_1.fastq.zip","date_created":"2018-12-12T13:04:07Z","content_type":"application/zip","date_updated":"2020-07-14T12:47:03Z","checksum":"82607970174f8d37773b7d3acc712195","access_level":"open_access","relation":"main_file","file_id":"5634","file_size":623648989,"creator":"system"},{"date_created":"2018-12-12T13:04:11Z","file_name":"IST-2017-65-v1+8_D_D08_1.fastq.zip","content_type":"application/zip","access_level":"open_access","relation":"main_file","checksum":"225c30b243268c7dda9d6f8327933252","date_updated":"2020-07-14T12:47:03Z","file_size":259359583,"file_id":"5635","creator":"system"}],"doi":"10.15479/AT:ISTA:65","publisher":"Institute of Science and Technology Austria","department":[{"_id":"CaGu"}],"citation":{"ista":"Steinrück M, Guet CC. 2017. Fastq files for ‘Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>.","ieee":"M. Steinrück and C. C. Guet, “Fastq files for ‘Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.’” Institute of Science and Technology Austria, 2017.","ama":"Steinrück M, Guet CC. Fastq files for “Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>","apa":"Steinrück, M., &#38; Guet, C. C. (2017). Fastq files for “Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:65\">https://doi.org/10.15479/AT:ISTA:65</a>","mla":"Steinrück, Magdalena, and Calin C. Guet. <i>Fastq Files for “Complex Chromosomal Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>.","chicago":"Steinrück, Magdalena, and Calin C Guet. “Fastq Files for ‘Complex Chromosomal Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:65\">https://doi.org/10.15479/AT:ISTA:65</a>.","short":"M. Steinrück, C.C. Guet, (2017)."},"datarep_id":"65","date_created":"2018-12-12T12:31:33Z","oa":1,"title":"Fastq files for \"Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection\"","date_published":"2017-04-11T00:00:00Z","_id":"5564","abstract":[{"lang":"eng","text":"Compressed Fastq files with whole-genome sequencing data of IS-wt strain D and clones from four evolved populations (A11, C08, C10, D08). Information on this data collection is available in the Methods Section of the primary publication."}],"date_updated":"2024-02-21T13:47:28Z","has_accepted_license":"1","author":[{"last_name":"Steinrück","id":"2C023F40-F248-11E8-B48F-1D18A9856A87","full_name":"Steinrück, Magdalena","first_name":"Magdalena","orcid":"0000-0003-1229-9719"},{"first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:03Z","related_material":{"record":[{"id":"704","status":"public","relation":"research_paper"}]},"ddc":["576"],"day":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","article_processing_charge":"No","year":"2017","type":"research_data","status":"public"},{"ddc":["580"],"day":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6302","month":"04","article_processing_charge":"No","year":"2017","status":"public","type":"research_data","abstract":[{"lang":"eng","text":"One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions. \r\nThe Video is licensed under a CC BY NC ND license. "}],"has_accepted_license":"1","date_updated":"2025-05-07T11:12:33Z","author":[{"last_name":"Von Wangenheim","id":"49E91952-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","full_name":"Von Wangenheim, Daniel","orcid":"0000-0002-6862-1247"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","orcid":"0000-0001-9843-3522","first_name":"Robert","full_name":"Hauschild, Robert"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"fund: FP7-ERC 0101109","oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:03Z","related_material":{"record":[{"status":"public","id":"1078","relation":"research_paper"}]},"citation":{"ista":"von Wangenheim D, Hauschild R, Friml J. 2017. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>.","short":"D. von Wangenheim, R. Hauschild, J. Friml, (2017).","chicago":"Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>.","mla":"von Wangenheim, Daniel, et al. <i>Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>.","apa":"von Wangenheim, D., Hauschild, R., &#38; Friml, J. (2017). Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>","ieee":"D. von Wangenheim, R. Hauschild, and J. Friml, “Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel.” Institute of Science and Technology Austria, 2017.","ama":"von Wangenheim D, Hauschild R, Friml J. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>"},"datarep_id":"66","date_created":"2018-12-12T12:31:34Z","oa":1,"title":"Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel","ec_funded":1,"_id":"5565","date_published":"2017-04-10T00:00:00Z","file":[{"content_type":"video/mp4","date_created":"2018-12-12T13:02:33Z","file_name":"IST-2017-66-v1+1_WangenheimHighResolution55044-NEW_1.mp4","creator":"system","file_size":101497758,"file_id":"5599","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:03Z","checksum":"b7552fc23540a85dc5a22fd4484eae71"}],"doi":"10.15479/AT:ISTA:66","publisher":"Institute of Science and Technology Austria","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"JiFr"},{"_id":"Bio"}]},{"abstract":[{"text":"Immunological synapse DC-Tcells","lang":"eng"}],"date_updated":"2024-02-21T13:47:00Z","has_accepted_license":"1","author":[{"last_name":"Leithner","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F","first_name":"Alexander F","orcid":"0000-0002-1073-744X"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:04Z","day":"09","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","status":"public","year":"2017","type":"research_data","article_processing_charge":"No","tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:47:04Z","checksum":"3d6942d47d0737d064706b5728c4d8c8","relation":"main_file","access_level":"open_access","creator":"system","file_size":236204020,"file_id":"5612","file_name":"IST-2017-71-v1+1_Synapse_1.avi","date_created":"2018-12-12T13:02:47Z","content_type":"video/x-msvideo"},{"file_id":"5613","file_size":226232496,"creator":"system","date_updated":"2020-07-14T12:47:04Z","checksum":"4850006c047b0147a9e85b3c2f6f0af4","access_level":"open_access","relation":"main_file","content_type":"video/x-msvideo","file_name":"IST-2017-71-v1+2_Synapse_2.avi","date_created":"2018-12-12T13:02:51Z"}],"keyword":["Immunological synapse"],"department":[{"_id":"MiSi"}],"doi":"10.15479/AT:ISTA:71","publisher":"Institute of Science and Technology Austria","date_created":"2018-12-12T12:31:34Z","citation":{"mla":"Leithner, Alexander F. <i>Immunological Synapse DC-Tcells</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>.","chicago":"Leithner, Alexander F. “Immunological Synapse DC-Tcells.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:71\">https://doi.org/10.15479/AT:ISTA:71</a>.","short":"A.F. Leithner, (2017).","ama":"Leithner AF. Immunological synapse DC-Tcells. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>","ieee":"A. F. Leithner, “Immunological synapse DC-Tcells.” Institute of Science and Technology Austria, 2017.","apa":"Leithner, A. F. (2017). Immunological synapse DC-Tcells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:71\">https://doi.org/10.15479/AT:ISTA:71</a>","ista":"Leithner AF. 2017. Immunological synapse DC-Tcells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>."},"datarep_id":"71","title":"Immunological synapse DC-Tcells","oa":1,"date_published":"2017-08-09T00:00:00Z","_id":"5567"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","ddc":["004"],"article_processing_charge":"No","status":"public","type":"research_data","year":"2017","month":"08","has_accepted_license":"1","date_updated":"2024-02-21T13:48:02Z","abstract":[{"lang":"eng","text":"Includes source codes, test cases, and example data used in the thesis Brittle Fracture Simulation with Boundary Elements for Computer Graphics. Also includes pre-built binaries of the HyENA library, but not sources - please contact the HyENA authors to obtain these sources if required (https://mech.tugraz.at/hyena)"}],"file_date_updated":"2020-07-14T12:47:04Z","related_material":{"record":[{"relation":"research_paper","id":"839","status":"public"}]},"author":[{"full_name":"Hahn, David","first_name":"David","last_name":"Hahn","id":"357A6A66-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","citation":{"ista":"Hahn D. 2017. Source codes: Brittle fracture simulation with boundary elements for computer graphics, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>.","apa":"Hahn, D. (2017). Source codes: Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:73\">https://doi.org/10.15479/AT:ISTA:73</a>","ama":"Hahn D. Source codes: Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>","ieee":"D. Hahn, “Source codes: Brittle fracture simulation with boundary elements for computer graphics.” Institute of Science and Technology Austria, 2017.","short":"D. Hahn, (2017).","chicago":"Hahn, David. “Source Codes: Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:73\">https://doi.org/10.15479/AT:ISTA:73</a>.","mla":"Hahn, David. <i>Source Codes: Brittle Fracture Simulation with Boundary Elements for Computer Graphics</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>."},"datarep_id":"73","date_created":"2018-12-12T12:31:35Z","_id":"5568","date_published":"2017-08-16T00:00:00Z","oa":1,"title":"Source codes: Brittle fracture simulation with boundary elements for computer graphics","ec_funded":1,"file":[{"content_type":"application/zip","file_name":"IST-2017-73-v1+1_FractureRB_v1.1_2017_07_20_final_public.zip","date_created":"2018-12-12T13:02:57Z","creator":"system","file_id":"5615","file_size":199353471,"checksum":"2323a755842a3399cbc47d76545fc9a0","date_updated":"2020-07-14T12:47:04Z","relation":"main_file","access_level":"open_access"}],"tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)"},"doi":"10.15479/AT:ISTA:73","publisher":"Institute of Science and Technology Austria","keyword":["Boundary elements","brittle fracture","computer graphics","fracture simulation"],"department":[{"_id":"ChWo"}],"project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020"}]},{"day":"14","pubrep_id":"920","publist_id":"7254","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","year":"2017","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","volume":58,"oa":1,"publication":"Investigative Ophthalmology and Visual Science","doi":"10.1167/iovs.17-22634","ddc":["576"],"publication_identifier":{"issn":["01460404"]},"type":"journal_article","intvolume":"        58","abstract":[{"lang":"eng","text":"PURPOSE. Gene therapy of retinal ganglion cells (RGCs) has promise as a powerful therapeutic for the rescue and regeneration of these cells after optic nerve damage. However, early after damage, RGCs undergo atrophic changes, including gene silencing. It is not known if these changes will deleteriously affect transduction and transgene expression, or if the therapeutic protein can influence reactivation of the endogenous genome. METHODS. Double-transgenic mice carrying a Rosa26-(LoxP)-tdTomato reporter, and a mutant allele for the proapoptotic Bax gene were reared. The Bax mutant blocks apoptosis, but RGCs still exhibit nuclear atrophy and gene silencing. At times ranging from 1 hour to 4 weeks after optic nerve crush (ONC), eyes received an intravitreal injection of AAV2 virus carrying the Cre recombinase. Successful transduction was monitored by expression of the tdTomato reporter. Immunostaining was used to localize tdTomato expression in select cell types. RESULTS. Successful transduction of RGCs was achieved at all time points after ONC using AAV2 expressing Cre from the phosphoglycerate kinase (Pgk) promoter, but not the CMV promoter. ONC promoted an increase in the transduction of cell types in the inner nuclear layer, including Müller cells and rod bipolar neurons. There was minimal evidence of transduction of amacrine cells and astrocytes in the inner retina or optic nerve. CONCLUSIONS. Damaged RGCs can be transduced and at least some endogenous genes can be subsequently activated. Optic nerve damage may change retinal architecture to allow greater penetration of an AAV2 virus to transduce several additional cell types in the inner nuclear layer."}],"page":"6091 - 6104","date_updated":"2023-10-10T14:06:18Z","author":[{"last_name":"Nickells","full_name":"Nickells, Robert","first_name":"Robert"},{"full_name":"Schmitt, Heather","first_name":"Heather","last_name":"Schmitt"},{"orcid":"0000-0001-9642-1085","full_name":"Maes, Margaret E","first_name":"Margaret E","last_name":"Maes","id":"3838F452-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schlamp","full_name":"Schlamp, Cassandra","first_name":"Cassandra"}],"file_date_updated":"2020-07-14T12:47:04Z","issue":"14","date_created":"2018-12-11T11:47:10Z","publication_status":"published","citation":{"apa":"Nickells, R., Schmitt, H., Maes, M. E., &#38; Schlamp, C. (2017). AAV2 mediated transduction of the mouse retina after optic nerve injury. <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology. <a href=\"https://doi.org/10.1167/iovs.17-22634\">https://doi.org/10.1167/iovs.17-22634</a>","ieee":"R. Nickells, H. Schmitt, M. E. Maes, and C. Schlamp, “AAV2 mediated transduction of the mouse retina after optic nerve injury,” <i>Investigative Ophthalmology and Visual Science</i>, vol. 58, no. 14. Association for Research in Vision and Ophthalmology, pp. 6091–6104, 2017.","ama":"Nickells R, Schmitt H, Maes ME, Schlamp C. AAV2 mediated transduction of the mouse retina after optic nerve injury. <i>Investigative Ophthalmology and Visual Science</i>. 2017;58(14):6091-6104. doi:<a href=\"https://doi.org/10.1167/iovs.17-22634\">10.1167/iovs.17-22634</a>","short":"R. Nickells, H. Schmitt, M.E. Maes, C. Schlamp, Investigative Ophthalmology and Visual Science 58 (2017) 6091–6104.","mla":"Nickells, Robert, et al. “AAV2 Mediated Transduction of the Mouse Retina after Optic Nerve Injury.” <i>Investigative Ophthalmology and Visual Science</i>, vol. 58, no. 14, Association for Research in Vision and Ophthalmology, 2017, pp. 6091–104, doi:<a href=\"https://doi.org/10.1167/iovs.17-22634\">10.1167/iovs.17-22634</a>.","chicago":"Nickells, Robert, Heather Schmitt, Margaret E Maes, and Cassandra Schlamp. “AAV2 Mediated Transduction of the Mouse Retina after Optic Nerve Injury.” <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology, 2017. <a href=\"https://doi.org/10.1167/iovs.17-22634\">https://doi.org/10.1167/iovs.17-22634</a>.","ista":"Nickells R, Schmitt H, Maes ME, Schlamp C. 2017. AAV2 mediated transduction of the mouse retina after optic nerve injury. Investigative Ophthalmology and Visual Science. 58(14), 6091–6104."},"title":"AAV2 mediated transduction of the mouse retina after optic nerve injury","date_published":"2017-12-14T00:00:00Z","_id":"557","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"file":[{"file_name":"IST-2018-920-v1+1_i1552-5783-58-14-6091.pdf","date_created":"2018-12-12T10:17:53Z","content_type":"application/pdf","date_updated":"2020-07-14T12:47:04Z","checksum":"d7a7b6f1fa9211a04e5e65634a0265d9","access_level":"open_access","relation":"main_file","file_size":2955559,"file_id":"5311","creator":"system"}],"department":[{"_id":"SaSi"}],"publisher":"Association for Research in Vision and Ophthalmology"},{"datarep_id":"78","citation":{"ama":"Vicoso B. Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>","ieee":"B. Vicoso, “Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","apa":"Vicoso, B. (2017). Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:78\">https://doi.org/10.15479/AT:ISTA:78</a>","mla":"Vicoso, Beatriz. <i>Data for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>.","chicago":"Vicoso, Beatriz. “Data for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:78\">https://doi.org/10.15479/AT:ISTA:78</a>.","short":"B. Vicoso, (2017).","ista":"Vicoso B. 2017. Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>."},"date_created":"2018-12-12T12:31:36Z","date_published":"2017-11-06T00:00:00Z","_id":"5571","oa":1,"title":"Data for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\"","file":[{"checksum":"4520eb2b8379417ee916995719158f16","date_updated":"2020-07-14T12:47:04Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5618","file_size":143697895,"file_name":"IST-2017-78-v1+1_Data.zip","date_created":"2018-12-12T13:03:00Z","content_type":"application/zip"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"doi":"10.15479/AT:ISTA:78","publisher":"Institute of Science and Technology Austria","contributor":[{"first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","contributor_type":"contact_person"}],"department":[{"_id":"BeVi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576"],"day":"06","article_processing_charge":"No","type":"research_data","status":"public","year":"2017","month":"11","has_accepted_license":"1","date_updated":"2024-02-21T13:48:16Z","abstract":[{"lang":"eng","text":"This folder contains all the data used in each of the main figures of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.), as well as in the supplementary figures. \r\n"}],"related_material":{"record":[{"relation":"research_paper","status":"public","id":"542"}]},"file_date_updated":"2020-07-14T12:47:04Z","author":[{"full_name":"Vicoso, Beatriz","first_name":"Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version"},{"department":[{"_id":"BeVi"}],"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:79 ","file":[{"date_created":"2018-12-12T13:05:15Z","file_name":"IST-2017-79-v1+1_Code.zip","content_type":"application/zip","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:05Z","checksum":"3e70a7bcd6ff0c38b79e4c8a7d137034","creator":"system","file_size":49823,"file_id":"5643"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"date_published":"2017-11-06T00:00:00Z","_id":"5572","title":"Code for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\"","oa":1,"date_created":"2018-12-12T12:31:36Z","citation":{"mla":"Vicoso, Beatriz. <i>Code for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>.","chicago":"Vicoso, Beatriz. “Code for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">https://doi.org/10.15479/AT:ISTA:79 </a>.","short":"B. Vicoso, (2017).","ieee":"B. Vicoso, “Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","ama":"Vicoso B. Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>","apa":"Vicoso, B. (2017). Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">https://doi.org/10.15479/AT:ISTA:79 </a>","ista":"Vicoso B. 2017. Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>."},"datarep_id":"79","related_material":{"record":[{"relation":"research_paper","id":"542","status":"public"}]},"file_date_updated":"2020-07-14T12:47:05Z","oa_version":"Submitted Version","author":[{"orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso"}],"date_updated":"2024-02-21T13:48:28Z","has_accepted_license":"1","abstract":[{"text":"Code described in the Supplementary Methods of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.)","lang":"eng"}],"year":"2017","type":"research_data","status":"public","article_processing_charge":"No","month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","ddc":["576"]},{"department":[{"_id":"SyCr"}],"publisher":"The Royal Society","title":"Specificity of oral immune priming in the red flour beetle Tribolium castaneum","_id":"558","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:47:10Z","publication_status":"published","citation":{"ista":"Futo M, Sell M, Kutzer M, Kurtz J. 2017. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. Biology Letters. 13(12), 0632.","short":"M. Futo, M. Sell, M. Kutzer, J. Kurtz, Biology Letters 13 (2017).","chicago":"Futo, Momir, Marie Sell, Megan Kutzer, and Joachim Kurtz. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” <i>Biology Letters</i>. The Royal Society, 2017. <a href=\"https://doi.org/10.1098/rsbl.2017.0632\">https://doi.org/10.1098/rsbl.2017.0632</a>.","mla":"Futo, Momir, et al. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” <i>Biology Letters</i>, vol. 13, no. 12, 0632, The Royal Society, 2017, doi:<a href=\"https://doi.org/10.1098/rsbl.2017.0632\">10.1098/rsbl.2017.0632</a>.","apa":"Futo, M., Sell, M., Kutzer, M., &#38; Kurtz, J. (2017). Specificity of oral immune priming in the red flour beetle Tribolium castaneum. <i>Biology Letters</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsbl.2017.0632\">https://doi.org/10.1098/rsbl.2017.0632</a>","ieee":"M. Futo, M. Sell, M. Kutzer, and J. Kurtz, “Specificity of oral immune priming in the red flour beetle Tribolium castaneum,” <i>Biology Letters</i>, vol. 13, no. 12. The Royal Society, 2017.","ama":"Futo M, Sell M, Kutzer M, Kurtz J. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. <i>Biology Letters</i>. 2017;13(12). doi:<a href=\"https://doi.org/10.1098/rsbl.2017.0632\">10.1098/rsbl.2017.0632</a>"},"author":[{"last_name":"Futo","full_name":"Futo, Momir","first_name":"Momir"},{"last_name":"Sell","first_name":"Marie","full_name":"Sell, Marie"},{"orcid":"0000-0002-8696-6978","first_name":"Megan","full_name":"Kutzer, Megan","last_name":"Kutzer","id":"29D0B332-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joachim","full_name":"Kurtz, Joachim","last_name":"Kurtz"}],"issue":"12","abstract":[{"lang":"eng","text":"Immune specificity is the degree to which a host’s immune system discriminates among various pathogens or antigenic variants. Vertebrate immune memory is highly specific due to antibody responses. On the other hand, some invertebrates show immune priming, i.e. improved survival after secondary exposure to a previously encountered pathogen. Until now, specificity of priming has only been demonstrated via the septic infection route or when live pathogens were used for priming. Therefore, we tested for specificity in the oral priming route in the red flour beetle, Tribolium castaneum. For priming, we used pathogen-free supernatants derived from three different strains of the entomopathogen, Bacillus thuringiensis, which express different Cry toxin variants known for their toxicity against this beetle. Subsequent exposure to the infective spores showed that oral priming was specific for two naturally occurring strains, while a third engineered strain did not induce any priming effect. Our data demonstrate that oral immune priming with a non-infectious bacterial agent can be specific, but the priming effect is not universal across all bacterial strains."}],"article_number":"0632","article_type":"original","date_updated":"2023-10-18T06:42:25Z","type":"journal_article","intvolume":"        13","publication_identifier":{"issn":["1744-9561"]},"doi":"10.1098/rsbl.2017.0632","publication":"Biology Letters","volume":13,"oa_version":"None","scopus_import":"1","quality_controlled":"1","external_id":{"pmid":["29237813"]},"month":"12","language":[{"iso":"eng"}],"year":"2017","status":"public","article_processing_charge":"No","pmid":1,"day":"01","publist_id":"7255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"related_material":{"record":[{"status":"public","id":"83","relation":"dissertation_contains"}]},"oa_version":"Submitted Version","quality_controlled":"1","year":"2017","status":"public","language":[{"iso":"eng"}],"month":"11","alternative_title":["LNCS"],"publist_id":"7257","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"}],"doi":"10.1007/978-3-319-70697-9_13","volume":10625,"oa":1,"author":[{"first_name":"Hamza M","full_name":"Abusalah, Hamza M","last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alwen, Joel F","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen"},{"last_name":"Cohen","full_name":"Cohen, Bram","first_name":"Bram"},{"last_name":"Khilko","first_name":"Danylo","full_name":"Khilko, Danylo"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Reyzin, Leonid","first_name":"Leonid","last_name":"Reyzin"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"date_updated":"2023-09-07T12:30:22Z","abstract":[{"text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).","lang":"eng"}],"page":"357 - 379","conference":{"start_date":"2017-12-03","end_date":"2017-12-07","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security","location":"Hong Kong, China"},"type":"conference","intvolume":"     10625","publication_identifier":{"isbn":["978-331970696-2"]},"department":[{"_id":"KrPi"}],"publisher":"Springer","date_published":"2017-11-18T00:00:00Z","_id":"559","title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","ec_funded":1,"date_created":"2018-12-11T11:47:10Z","publication_status":"published","citation":{"short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","mla":"Abusalah, Hamza M., et al. <i>Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space</i>. Vol. 10625, Springer, 2017, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &#38; Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>","ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379."}},{"publist_id":"7256","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","language":[{"iso":"eng"}],"year":"2017","status":"public","month":"11","quality_controlled":"1","scopus_import":1,"oa_version":"Submitted Version","volume":473,"oa":1,"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1098/rspa.2017.0104","publication_identifier":{"issn":["13645021"]},"intvolume":"       473","type":"journal_article","date_updated":"2021-01-12T08:03:04Z","article_number":"0104","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","author":[{"first_name":"Mate","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser"},{"first_name":"Arnulf","full_name":"Jentzen, Arnulf","last_name":"Jentzen"},{"last_name":"Salimova","full_name":"Salimova, Diyora","first_name":"Diyora"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.03229","open_access":"1"}],"date_created":"2018-12-11T11:47:11Z","citation":{"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.","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.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:<a href=\"https://doi.org/10.1098/rspa.2017.0104\">10.1098/rspa.2017.0104</a>.","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London, 2017. <a href=\"https://doi.org/10.1098/rspa.2017.0104\">https://doi.org/10.1098/rspa.2017.0104</a>.","apa":"Gerencser, M., Jentzen, A., &#38; Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rspa.2017.0104\">https://doi.org/10.1098/rspa.2017.0104</a>","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. 2017;473(2207). doi:<a href=\"https://doi.org/10.1098/rspa.2017.0104\">10.1098/rspa.2017.0104</a>","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 473, no. 2207. Royal Society of London, 2017."},"publication_status":"published","_id":"560","date_published":"2017-11-01T00:00:00Z","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","ec_funded":1,"department":[{"_id":"JaMa"}],"publisher":"Royal Society of London"}]