[{"pubrep_id":"872","status":"public","type":"technical_report","_id":"5456","department":[{"_id":"KrCh"}],"title":"Data-centric dynamic partial order reduction","file_date_updated":"2020-07-14T12:46:59Z","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Nishant","full_name":"Sinha, Nishant","last_name":"Sinha"},{"first_name":"Kapil","last_name":"Vaidya","full_name":"Vaidya, Kapil"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","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","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","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi: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.","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."},"date_updated":"2023-02-23T12:26:54Z","month":"10","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa_version":"Published Version","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."}],"date_created":"2018-12-12T11:39:26Z","related_material":{"record":[{"id":"10417","status":"public","relation":"later_version"},{"relation":"earlier_version","id":"5448","status":"public"}]},"doi":"10.15479/AT:IST-2017-872-v1-1","date_published":"2017-10-23T00:00:00Z","page":"36","language":[{"iso":"eng"}],"file":[{"file_id":"5487","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-872-v1+1_main.pdf","date_created":"2018-12-12T11:53:26Z","file_size":910347,"date_updated":"2020-07-14T12:46:59Z","creator":"system"}],"day":"23","publication_status":"published","year":"2017","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"date_updated":"2021-01-12T08:02:34Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","_id":"551","type":"conference","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"924","publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","file":[{"checksum":"2eed5224c0e4e259484a1d71acb8ba6a","file_id":"5322","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_created":"2018-12-12T10:18:04Z","creator":"system","file_size":535077,"date_updated":"2020-07-14T12:47:00Z"}],"language":[{"iso":"eng"}],"volume":83,"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","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. "}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"11","intvolume":" 83","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.","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.","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","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","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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publist_id":"7263","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","article_number":"61","has_accepted_license":"1","year":"2017","day":"01","publication":"Leibniz International Proceedings in Informatics","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.61","date_created":"2018-12-11T11:47:08Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","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.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"title":"Faster algorithms for mean-payoff parity games","article_processing_charge":"No","publist_id":"7262","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"article_number":"39","project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"publication":"Leibniz International Proceedings in Informatics","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:08Z","doi":"10.4230/LIPIcs.MFCS.2017.39","date_published":"2017-11-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["004"],"date_updated":"2023-02-14T10:06:46Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","_id":"552","pubrep_id":"923","status":"public","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","end_date":"2017-08-25","location":"Aalborg, Denmark"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","language":[{"iso":"eng"}],"file":[{"file_size":610339,"date_updated":"2020-07-14T12:47:00Z","creator":"system","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_created":"2018-12-12T10:16:57Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","file_id":"5248"}],"publication_status":"published","publication_identifier":{"isbn":["978-395977046-0"]},"license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"volume":83,"oa_version":"Published Version","abstract":[{"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).","lang":"eng"}],"intvolume":" 83","month":"11","scopus_import":"1","alternative_title":["LIPIcs"]},{"_id":"553","pubrep_id":"922","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"type":"conference","ddc":["004"],"date_updated":"2021-01-12T08:02:35Z","file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","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"}],"intvolume":" 83","month":"11","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.02434"}],"scopus_import":1,"alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:09:29Z","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_updated":"2020-07-14T12:47:00Z","file_size":549967,"creator":"system","checksum":"7101facb56ade363205c695d72dbd173","file_id":"4753","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"isbn":["978-395977046-0"]},"volume":83,"article_number":"55","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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.","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.","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","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.","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.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55."},"title":"Strategy complexity of concurrent safety games","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Hansen, Kristofer","last_name":"Hansen","first_name":"Kristofer"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"}],"publist_id":"7261","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","publication":"Leibniz International Proceedings in Informatics","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:08Z","doi":"10.4230/LIPIcs.MFCS.2017.55","date_published":"2017-11-01T00:00:00Z"},{"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.","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.","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.","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","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.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser","full_name":"Gerencser, Mate"},{"full_name":"Jentzen, Arnulf","last_name":"Jentzen","first_name":"Arnulf"},{"full_name":"Salimova, Diyora","last_name":"Salimova","first_name":"Diyora"}],"publist_id":"7256","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","article_number":"0104","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"year":"2017","day":"01","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","doi":"10.1098/rspa.2017.0104","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:11Z","publisher":"Royal Society of London","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T08:03:04Z","department":[{"_id":"JaMa"}],"_id":"560","type":"journal_article","status":"public","publication_identifier":{"issn":["13645021"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":473,"issue":"2207","ec_funded":1,"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."}],"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.03229"}],"month":"11","intvolume":" 473"},{"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2021-01-12T08:03:12Z","type":"journal_article","status":"public","_id":"568","ec_funded":1,"issue":"2","volume":19,"publication_status":"published","publication_identifier":{"issn":["15320073"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"scopus_import":1,"intvolume":" 19","month":"01","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)."}],"oa_version":"Submitted Version","author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Krcál, Marek","last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7246","title":"Persistence of zero sets","citation":{"short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","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.","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","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","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.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","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."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"page":"313 - 342","date_created":"2018-12-11T11:47:14Z","doi":"10.4310/HHA.2017.v19.n2.a16","date_published":"2017-01-01T00:00:00Z","year":"2017","publication":"Homology, Homotopy and Applications","day":"01","oa":1,"quality_controlled":"1","publisher":"International Press"},{"scopus_import":1,"month":"11","intvolume":" 6","abstract":[{"lang":"eng","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. "}],"oa_version":"Published Version","volume":6,"ec_funded":1,"publication_identifier":{"issn":["2050084X"]},"publication_status":"published","file":[{"checksum":"273ab17f33305e4eaafd911ff88e7c5b","file_id":"5096","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:42Z","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","date_updated":"2020-07-14T12:47:10Z","file_size":8453470,"creator":"system"},{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"b433f90576c7be597cd43367946f8e7f","file_id":"5097","creator":"system","file_size":1953221,"date_updated":"2020-07-14T12:47:10Z","file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","date_created":"2018-12-12T10:14:43Z"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"918","_id":"570","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"date_updated":"2021-01-12T08:03:15Z","ddc":["576"],"publisher":"eLife Sciences Publications","quality_controlled":"1","oa":1,"date_published":"2017-11-13T00:00:00Z","doi":"10.7554/eLife.28921","date_created":"2018-12-11T11:47:14Z","has_accepted_license":"1","year":"2017","day":"13","publication":"eLife","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"article_number":"e28921","author":[{"last_name":"Lagator","full_name":"Lagator, Mato","first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sarikas","full_name":"Sarikas, Srdjan","first_name":"Srdjan","id":"35F0286E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Acar","full_name":"Acar, Hande","orcid":"0000-0003-1986-9753","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87","first_name":"Hande"},{"last_name":"Bollback","orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P"},{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7244","title":"Regulatory network structure determines patterns of intermolecular epistasis","citation":{"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).","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","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","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.","ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","publist_id":"7245","author":[{"first_name":"Felix","full_name":"Spira, Felix","last_name":"Spira"},{"first_name":"Sara","last_name":"Cuylen Haering","full_name":"Cuylen Haering, Sara"},{"first_name":"Shalin","full_name":"Mehta, Shalin","last_name":"Mehta"},{"first_name":"Matthias","last_name":"Samwer","full_name":"Samwer, Matthias"},{"last_name":"Reversat","full_name":"Reversat, Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87","first_name":"Anne"},{"first_name":"Amitabh","full_name":"Verma, Amitabh","last_name":"Verma"},{"full_name":"Oldenbourg, Rudolf","last_name":"Oldenbourg","first_name":"Rudolf"},{"last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gerlich","full_name":"Gerlich, Daniel","first_name":"Daniel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","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.","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","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","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.","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.","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."},"article_number":"e30867","date_created":"2018-12-11T11:47:14Z","doi":"10.7554/eLife.30867","date_published":"2017-11-06T00:00:00Z","publication":"eLife","day":"06","year":"2017","has_accepted_license":"1","oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"MiSi"}],"ddc":["570"],"date_updated":"2023-02-23T12:30:29Z","pubrep_id":"919","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"569","volume":6,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4829","checksum":"ba09c1451153d39e4f4b7cee013e314c","file_size":9666973,"date_updated":"2020-07-14T12:47:10Z","creator":"system","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","date_created":"2018-12-12T10:10:40Z"},{"date_created":"2018-12-12T10:10:41Z","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","date_updated":"2020-07-14T12:47:10Z","file_size":5951246,"creator":"system","file_id":"4830","checksum":"01eb51f1d6ad679947415a51c988e137","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["2050084X"]},"intvolume":" 6","month":"11","scopus_import":1,"oa_version":"Published Version","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."}]},{"article_number":"2587","citation":{"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.","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.","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).","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.","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","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"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"7242","author":[{"last_name":"Olatunji","full_name":"Olatunji, Damilola","first_name":"Damilola"},{"last_name":"Geelen","full_name":"Geelen, Danny","first_name":"Danny"},{"first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","last_name":"Verstraeten"}],"title":"Control of endogenous auxin levels in plant root development","oa":1,"publisher":"MDPI","quality_controlled":"1","year":"2017","has_accepted_license":"1","publication":"International Journal of Molecular Sciences","day":"01","date_created":"2018-12-11T11:47:15Z","doi":"10.3390/ijms18122587","date_published":"2017-12-01T00:00:00Z","_id":"572","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"917","status":"public","date_updated":"2021-01-12T08:03:16Z","ddc":["580"],"department":[{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:47:10Z","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"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 18","month":"12","publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"82d51f11e493f7eec02976d9a9a9805e","file_id":"4718","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","date_created":"2018-12-12T10:08:55Z","file_size":920962,"date_updated":"2020-07-14T12:47:10Z","creator":"system"}],"issue":"12","volume":18},{"external_id":{"arxiv":["1611.03701"]},"publist_id":"7552","author":[{"last_name":"Camus","full_name":"Camus, Nicolas","first_name":"Nicolas"},{"last_name":"Yakaboylu","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp"},{"last_name":"Fechner","full_name":"Fechner, Lutz","first_name":"Lutz"},{"full_name":"Klaiber, Michael","last_name":"Klaiber","first_name":"Michael"},{"full_name":"Laux, Martin","last_name":"Laux","first_name":"Martin"},{"last_name":"Mi","full_name":"Mi, Yonghao","first_name":"Yonghao"},{"first_name":"Karen","full_name":"Hatsagortsyan, Karen","last_name":"Hatsagortsyan"},{"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"}],"title":"Experimental evidence for Wigner's tunneling time","citation":{"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","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","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.","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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"012004","date_created":"2018-12-11T11:45:46Z","date_published":"2017-07-14T00:00:00Z","doi":"10.1088/1742-6596/999/1/012004","year":"2017","has_accepted_license":"1","day":"14","oa":1,"quality_controlled":"1","publisher":"American Physical Society","file_date_updated":"2020-07-14T12:46:00Z","department":[{"_id":"MiLe"}],"date_updated":"2023-02-23T12:36:07Z","ddc":["530"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2017-08-21","location":"Kazan, Russian Federation","start_date":"2017-08-17","name":"Annual International Laser Physics Workshop LPHYS"},"type":"conference","status":"public","_id":"313","volume":999,"issue":"1","related_material":{"record":[{"relation":"later_version","id":"6013","status":"public"}]},"publication_status":"published","publication_identifier":{"issn":["17426588"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2017_Physics_Camus.pdf","date_created":"2019-01-22T08:34:10Z","creator":"dernst","file_size":949321,"date_updated":"2020-07-14T12:46:00Z","file_id":"5871","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"alternative_title":["Journal of Physics: Conference Series"],"scopus_import":1,"intvolume":" 999","month":"07","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version"}]