[{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2017-09-01T00:00:00Z","citation":{"ista":"Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.","apa":"Henzinger, M. H., Leniowski, D., & Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.48","ieee":"M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","ama":"Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48","chicago":"Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.48.","mla":"Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” 25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.","short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"publication":"25th Annual European Symposium on Algorithms","abstract":[{"text":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\r\n\r\nWe present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","intvolume":" 87","title":"Dynamic clustering to minimize the sum of radii","status":"public","_id":"11832","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"month":"09","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ESA.2017.48","conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2017-09-06","start_date":"2017-09-04","location":"Vienna, Austria"},"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1707.02577"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.ESA.2017.48"}],"extern":"1","article_number":"48","volume":87,"date_created":"2022-08-12T09:58:46Z","date_updated":"2023-02-16T11:54:12Z","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Leniowski","first_name":"Dariusz","full_name":"Leniowski, Dariusz"},{"last_name":"Mathieu","first_name":"Claire","full_name":"Mathieu, Claire"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2017"},{"month":"01","publication_identifier":{"eisbn":["978-161197478-2"]},"oa":1,"external_id":{"arxiv":["1704.02844"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02844"}],"quality_controlled":"1","conference":{"end_date":"2017-01-19","start_date":"2017-01-16","location":"Barcelona, Spain","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611974782.30","language":[{"iso":"eng"}],"extern":"1","year":"2017","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"date_updated":"2023-02-17T11:54:22Z","date_created":"2022-08-16T12:28:27Z","volume":"0","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 0:470–89. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.30.","mla":"Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:10.1137/1.9781611974782.30.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, vol. 0, pp. 470–489.","apa":"Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.30","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:10.1137/1.9781611974782.30"},"page":"470 - 489","date_published":"2017-01-01T00:00:00Z","type":"conference","abstract":[{"text":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data structure with approximation ratio (3/2 + ∊) and worst case update time O(m1/4/ ∊2), where m is the number of edges in the graph. In recent past, Gupta and Peng [FOCS 2013] gave a deterministic data structure with approximation ratio (1+ ∊) and worst case update time No known randomised data structure beats the worst case update times of these two results. In contrast, the paper by Onak and Rubinfeld [STOC 2010] gave a randomised data structure with approximation ratio O(1) and amortised update time O(log2 n), where n is the number of nodes in the graph. This was later improved by Baswana, Gupta and Sen [FOCS 2011] and Solomon [FOCS 2016], leading to a randomised date structure with approximation ratio 2 and amortised update time O(1).\r\n\r\nWe bridge the polynomial gap between the worst case and amortised update times for this problem, without using any randomisation. We present a deterministic data structure with approximation ratio (2 + ∊) and worst case update time O(log3 n), for all sufficiently small constants ∊.","lang":"eng"}],"_id":"11874","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time","oa_version":"Preprint"},{"extern":"1","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","year":"2017","date_updated":"2023-02-21T16:32:01Z","date_created":"2022-08-16T12:20:59Z","related_material":{"record":[{"id":"11889","relation":"earlier_version","status":"public"}]},"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Rao, Satish","last_name":"Rao","first_name":"Satish"},{"last_name":"Wang","first_name":"Di","full_name":"Wang, Di"}],"publication_identifier":{"eisbn":["978-161197478-2"]},"month":"01","quality_controlled":"1","external_id":{"arxiv":["1704.01254"]},"main_file_link":[{"url":"https://arxiv.org/abs/1704.01254","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611974782.125","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Barcelona, Spain","start_date":"2017-01-16","end_date":"2017-01-19"},"type":"conference","abstract":[{"text":"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(mlog3n) (Karger [11]) for this problem, though Karger's algorithm can be further applied to weighted graphs.\r\n\r\nOur approach is using the Kawarabayashi and Tho- rup graph compression technique, which repeatedly finds low-conductance cuts. To find these cuts they use a diffusion-based local algorithm. We use instead a flow- based local algorithm and suitably adjust their framework to work with our flow-based subroutine. Both flow and diffusion based methods have a long history of being applied to finding low conductance cuts. Diffusion algorithms have several variants that are naturally local while it is more complicated to make flow methods local. Some prior work has proven nice properties for local flow based algorithms with respect to improving or cleaning up low conductance cuts. Our flow subroutine, however, is the first that is both local and produces low conductance cuts. Thus, it may be of independent interest.","lang":"eng"}],"title":"Local flow partitioning for faster edge connectivity","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11873","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"01","page":"1919-1938","citation":{"mla":"Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:10.1137/1.9781611974782.125.","short":"M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.","chicago":"Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 1919–38. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.125.","ama":"Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:10.1137/1.9781611974782.125","ista":"Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.","apa":"Henzinger, M. H., Rao, S., & Wang, D. (2017). Local flow partitioning for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.125","ieee":"M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 1919–1938."},"publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","date_published":"2017-01-01T00:00:00Z"},{"intvolume":" 87","status":"public","title":"Improved guarantees for vertex sparsification in planar graphs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11831","oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G=(V,E), and a terminal set K with |K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in V_H that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by an exponential factor, and matches an Omega(k^2) lower-bound for this class of graphs.\r\n\r\nWe also study vertex reachability sparsifiers for directed graphs. Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Omega(k^2) vertices."}],"citation":{"ama":"Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44","ista":"Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","apa":"Goranci, G., Henzinger, M. H., & Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.44","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.44."},"publication":"25th Annual European Symposium on Algorithms","date_published":"2017-09-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2017","volume":87,"date_created":"2022-08-12T09:27:11Z","date_updated":"2023-02-21T16:32:16Z","related_material":{"record":[{"id":"11894","relation":"later_version","status":"public"}]},"author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"}],"article_number":"44","extern":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2017.44"}],"oa":1,"external_id":{"arxiv":["1702.01136"]},"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ESA.2017.44","conference":{"end_date":"2017-09-06","location":"Vienna, Austria","start_date":"2017-09-04","name":"ESA: Annual European Symposium on Algorithms"},"publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"month":"09"},{"year":"2017","publisher":"Springer Nature","publication_status":"published","related_material":{"record":[{"id":"11837","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"full_name":"Dvořák, Wolfgang","first_name":"Wolfgang","last_name":"Dvořák"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"volume":61,"date_updated":"2023-02-21T16:29:58Z","date_created":"2022-08-17T11:14:12Z","extern":"1","main_file_link":[{"url":"https://doi.org/10.1007/s00224-017-9759-8","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1007/s00224-017-9759-8","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1432-4350"],"eissn":["1433-0490"]},"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11903","intvolume":" 61","title":"Welfare maximization with friends-of-friends network externalities","status":"public","oa_version":"Published Version","type":"journal_article","issue":"4","abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1−1/e). (2) On the positive side we present (i) an 𝑂(𝑛√)-approximation algorithm for general concave externality functions, (ii) an O(log m)-approximation algorithm for linear externality functions, and (iii) a 518(1−1/𝑒)-approximation algorithm for 2-hop step function externalities. We also improve the result from [7] for 1-hop step function externalities by giving a 12(1−1/𝑒)-approximation algorithm.","lang":"eng"}],"citation":{"ama":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 2017;61(4):948-986. doi:10.1007/s00224-017-9759-8","ieee":"S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.","apa":"Bhattacharya, S., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. Springer Nature. https://doi.org/10.1007/s00224-017-9759-8","ista":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986.","short":"S. Bhattacharya, W. Dvořák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.","mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems, vol. 61, no. 4, Springer Nature, 2017, pp. 948–86, doi:10.1007/s00224-017-9759-8.","chicago":"Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems. Springer Nature, 2017. https://doi.org/10.1007/s00224-017-9759-8."},"publication":"Theory of Computing Systems","page":"948-986","article_type":"original","date_published":"2017-11-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"date_published":"2017-03-01T00:00:00Z","page":"525-559","publication":"Bulletin of Mathematical Biology","citation":{"chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3"},"day":"01","scopus_import":1,"oa_version":"Preprint","status":"public","title":"Existence of traveling waves for the generalized F–KPP equation","intvolume":" 79","_id":"1191","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed."}],"issue":"3","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s11538-016-0244-3","quality_controlled":"1","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7"},{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1607.00944","open_access":"1"}],"month":"03","date_updated":"2021-01-12T06:48:58Z","date_created":"2018-12-11T11:50:38Z","volume":79,"author":[{"last_name":"Kollár","first_name":"Richard","full_name":"Kollár, Richard"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","first_name":"Sebastian","full_name":"Novak, Sebastian"}],"publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Springer","acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","year":"2017","publist_id":"6160","ec_funded":1},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Journal of Flow Chemistry","citation":{"ama":"Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 2017;7(3-4):129-136. doi:10.1556/1846.2017.00016","ista":"Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.","ieee":"B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” Journal of Flow Chemistry, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.","apa":"Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. AKJournals. https://doi.org/10.1556/1846.2017.00016","mla":"Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry, vol. 7, no. 3–4, AKJournals, 2017, pp. 129–36, doi:10.1556/1846.2017.00016.","short":"B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.","chicago":"Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry. AKJournals, 2017. https://doi.org/10.1556/1846.2017.00016."},"article_type":"original","page":"129-136","date_published":"2017-09-01T00:00:00Z","type":"journal_article","abstract":[{"text":"The way organic multistep synthesis is performed is changing due to the adoption of flow chemical techniques, which has enabled the development of improved methods to make complex molecules. The modular nature of the technique provides not only access to target molecules via linear flow approaches but also for the targeting of structural cores with single systems. This perspective article summarizes the state of the art of continuous multistep synthesis and discusses the main challenges and opportunities in this area.","lang":"eng"}],"issue":"3-4","_id":"11976","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Integrated flow processing - challenges in continuous multistep synthesis","intvolume":" 7","oa_version":"Published Version","month":"09","publication_identifier":{"issn":["2062-249X"],"eissn":["2063-0212"]},"main_file_link":[{"url":"https://doi.org/10.1556/1846.2017.00016","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1556/1846.2017.00016","language":[{"iso":"eng"}],"extern":"1","year":"2017","publication_status":"published","publisher":"AKJournals","author":[{"last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Gilmore, Kerry","first_name":"Kerry","last_name":"Gilmore"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."}],"date_updated":"2023-02-21T10:10:02Z","date_created":"2022-08-25T10:47:51Z","volume":7},{"month":"05","oa":1,"quality_controlled":"1","doi":"10.1007/s10955-016-1672-z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:39Z","publist_id":"6136","year":"2017","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Springer","author":[{"full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"date_updated":"2021-01-12T06:49:07Z","date_created":"2018-12-11T11:50:44Z","volume":167,"scopus_import":1,"day":"01","has_accepted_license":"1","publication":"Journal of Statistical Physics","citation":{"apa":"Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:10.1007/s10955-016-1672-z."},"page":"636-655","date_published":"2017-05-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here.","lang":"eng"}],"issue":"3-4","_id":"1211","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["530"],"title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","intvolume":" 167","pubrep_id":"782","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","creator":"system","file_size":2820207,"content_type":"application/pdf","file_id":"5319","relation":"main_file","checksum":"3e971d09eb167761aa0888ed415b0056","date_updated":"2020-07-14T12:44:39Z","date_created":"2018-12-12T10:18:01Z"}]},{"type":"journal_article","issue":"11","abstract":[{"text":"The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"123","intvolume":" 13","title":"Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing","status":"public","oa_version":"Preprint","day":"24","citation":{"chicago":"Waitukaitis, Scott R, Antal Zuiderwijk, Anton Souslov, Corentin Coulais, and Martin Van Hecke. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics. Nature Publishing Group, 2017. https://doi.org/10.1038/nphys4194.","mla":"Waitukaitis, Scott R., et al. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics, vol. 13, no. 11, Nature Publishing Group, 2017, pp. 1095–99, doi:10.1038/nphys4194.","short":"S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature Physics 13 (2017) 1095–1099.","ista":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 13(11), 1095–1099.","ieee":"S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke, “Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,” Nature Physics, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099, 2017.","apa":"Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., & Van Hecke, M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys4194","ama":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 2017;13(11):1095-1099. doi:10.1038/nphys4194"},"publication":"Nature Physics","page":"1095 - 1099","date_published":"2017-07-24T00:00:00Z","publist_id":"7931","extern":"1","acknowledgement":"A.S. acknowledges funding from the Delta Institute for Theoretical Physics and the hospitality of the IBS Center for Theoretical Physics of Complex Systems, Daejeon, South Korea. We acknowledge funding from the Netherlands Organisation for Scientific Research through grants VICI No. NWO-680-47-609 (M.v.H. and S.R.W.), VENI No. NWO-680-47-445 (C.C.) and VENI No. NWO-680-47-453 (S.R.W.).","year":"2017","publisher":"Nature Publishing Group","publication_status":"published","author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R"},{"last_name":"Zuiderwijk","first_name":"Antal","full_name":"Zuiderwijk, Antal"},{"last_name":"Souslov","first_name":"Anton","full_name":"Souslov, Anton"},{"first_name":"Corentin","last_name":"Coulais","full_name":"Coulais, Corentin"},{"full_name":"Van Hecke, Martin","last_name":"Van Hecke","first_name":"Martin"}],"volume":13,"date_updated":"2021-01-12T06:49:14Z","date_created":"2018-12-11T11:44:45Z","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1705.03530","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1705.03530"]},"quality_controlled":"1","doi":"10.1038/nphys4194","language":[{"iso":"eng"}]},{"date_updated":"2023-02-20T07:57:24Z","date_created":"2023-02-20T07:52:31Z","volume":10328,"author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Chakrabarty, Deeparnab","first_name":"Deeparnab","last_name":"Chakrabarty"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"}],"publication_status":"published","publisher":"Springer Nature","year":"2017","extern":"1","language":[{"iso":"eng"}],"conference":{"start_date":"2017-06-26","location":"Waterloo, ON, Canada","end_date":"2017-06-28","name":"IPCO: Integer Programming and Combinatorial Optimization"},"doi":"10.1007/978-3-319-59250-3_8","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1611.00198","open_access":"1"}],"external_id":{"arxiv":["1611.00198"]},"month":"05","publication_identifier":{"isbn":["9783319592497"],"issn":["0302-9743","1611-3349"],"eisbn":["9783319592503"]},"oa_version":"Preprint","status":"public","title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","intvolume":" 10328","_id":"12571","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2017-05-24T00:00:00Z","page":"86-98","publication":"19th International Conference on Integer Programming and Combinatorial Optimization","citation":{"mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In 19th International Conference on Integer Programming and Combinatorial Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8.","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: 19th International Conference on Integer Programming and Combinatorial Optimization. Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8","ista":"Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.","ieee":"S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.","apa":"Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In 19th International Conference on Integer Programming and Combinatorial Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-319-59250-3_8"},"day":"24","article_processing_charge":"No","scopus_import":"1"},{"publication_status":"published","publisher":"Brown University","department":[{"_id":"UlWa"}],"year":"2017","date_updated":"2023-02-23T10:05:57Z","date_created":"2018-12-11T11:50:13Z","volume":21,"author":[{"full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek"},{"first_name":"Michael","last_name":"Pelsmajer","full_name":"Pelsmajer, Michael"},{"last_name":"Schaefer","first_name":"Marcus","full_name":"Schaefer, Marcus"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1164"},{"relation":"earlier_version","status":"public","id":"1595"}]},"file_date_updated":"2019-10-24T10:54:37Z","ec_funded":1,"publist_id":"6254","quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"external_id":{"arxiv":["1608.08662"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7155/jgaa.00408","month":"01","title":"Hanani-Tutte for radial planarity","status":"public","ddc":["510"],"intvolume":" 21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1113","file":[{"content_type":"application/pdf","file_size":573623,"creator":"dernst","file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","access_level":"open_access","date_updated":"2019-10-24T10:54:37Z","date_created":"2019-10-24T10:54:37Z","success":1,"relation":"main_file","file_id":"6967"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth."}],"issue":"1","article_type":"original","page":"135 - 154","publication":"Journal of Graph Algorithms and Applications","citation":{"ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408."},"date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No"},{"citation":{"short":"T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017).","mla":"Browning, Timothy D., et al. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx116.","chicago":"Browning, Timothy D, Vinay Kumaraswamy, and Rapael Steiner. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx116.","ama":"Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx116","apa":"Browning, T. D., Kumaraswamy, V., & Steiner, R. (2017). Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx116","ieee":"T. D. Browning, V. Kumaraswamy, and R. Steiner, “Twisted Linnik implies optimal covering exponent for S3,” International Mathematics Research Notices. Oxford University Press, 2017.","ista":"Browning TD, Kumaraswamy V, Steiner R. 2017. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.06097"}],"external_id":{"arxiv":["1609.06097"]},"publication":"International Mathematics Research Notices","quality_controlled":"1","doi":"10.1093/imrn/rnx116","date_published":"2017-06-19T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"06","day":"19","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"169","year":"2017","publisher":"Oxford University Press","status":"public","publication_status":"published","title":"Twisted Linnik implies optimal covering exponent for S3","author":[{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kumaraswamy, Vinay","last_name":"Kumaraswamy","first_name":"Vinay"},{"last_name":"Steiner","first_name":"Rapael","full_name":"Steiner, Rapael"}],"oa_version":"None","date_updated":"2021-01-12T06:52:32Z","date_created":"2018-12-11T11:44:59Z","type":"journal_article","publist_id":"7752","abstract":[{"text":"We show that a twisted variant of Linnik’s conjecture on sums of Kloosterman sums leads to an optimal covering exponent for S3.","lang":"eng"}],"extern":"1"},{"type":"journal_article","abstract":[{"lang":"eng","text":"We study strong approximation for some algebraic varieties over ℚ which are defined using norm forms. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg."}],"publist_id":"7749","extern":"1","year":"2017","_id":"172","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Strong approximation and a conjecture of Harpaz and Wittenberg","publisher":"Oxford University Press","author":[{"full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Schindler, Damaris","first_name":"Damaris","last_name":"Schindler"}],"date_created":"2018-12-11T11:45:00Z","date_updated":"2021-01-12T06:52:45Z","oa_version":"None","day":"30","month":"10","article_processing_charge":"No","publication":"International Mathematics Research Notices","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1509.07744","open_access":"1"}],"citation":{"chicago":"Browning, Timothy D, and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx252.","short":"T.D. Browning, D. Schindler, International Mathematics Research Notices (2017).","mla":"Browning, Timothy D., and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx252.","ieee":"T. D. Browning and D. Schindler, “Strong approximation and a conjecture of Harpaz and Wittenberg,” International Mathematics Research Notices. Oxford University Press, 2017.","apa":"Browning, T. D., & Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx252","ista":"Browning TD, Schindler D. 2017. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices.","ama":"Browning TD, Schindler D. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx252"},"external_id":{"arxiv":["1509.07744"]},"quality_controlled":"1","date_published":"2017-10-30T00:00:00Z","doi":"10.1093/imrn/rnx252","language":[{"iso":"eng"}]},{"status":"public","title":"Origin of the exciton mass in the frustrated Mott insulator Na2IrO3","publication_status":"published","intvolume":" 96","publisher":"American Physical Society","_id":"393","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Z.A. gratefully acknowledges discussions with P. A. Lee and A. Kemper. A conversation with J. Zaanen was instrumental in clarifying the physical picture described in this paper. We would also like to thank A. Kogar for thoroughly reading the manuscript and making valuable comments. This work was supported by Army Research Office Grant No. W911NF-15-1-0128 and Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4540 (time resolved optical spectroscopy), Skoltech, as part of the Skoltech NGP program (theory) and National Science Foundation Grant No. DMR-1265162 (material growth).\r\n\r\n","year":"2017","date_updated":"2021-01-12T07:53:16Z","date_created":"2018-12-11T11:46:13Z","volume":96,"oa_version":"None","author":[{"first_name":"Zhanybek","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek"},{"last_name":"Sie","first_name":"Edbert","full_name":"Sie, Edbert"},{"last_name":"Mahmood","first_name":"Fahad","full_name":"Mahmood, Fahad"},{"last_name":"Cao","first_name":"Gang","full_name":"Cao, Gang"},{"full_name":"Gedik, Nuh","last_name":"Gedik","first_name":"Nuh"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"We use a three-pulse ultrafast optical spectroscopy to study the relaxation processes in a frustrated Mott insulator Na2IrO3. By being able to independently produce the out-of-equilibrium bound states (excitons) of doublons and holons with the first pulse and suppress the underlying antiferromagnetic order with the second one, we were able to elucidate the relaxation mechanism of quasiparticles in this system. By observing the difference in the exciton dynamics in the magnetically ordered and disordered phases we found that the mass of this quasiparticle is mostly determined by its interaction with the surrounding spins. "}],"publist_id":"7436","issue":"23","publication":"Physical Review B","main_file_link":[{"open_access":"1","url":"http://dspace.mit.edu/handle/1721.1/114259"}],"citation":{"ieee":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, and N. Gedik, “Origin of the exciton mass in the frustrated Mott insulator Na2IrO3,” Physical Review B, vol. 96, no. 23. American Physical Society, 2017.","apa":"Alpichshev, Z., Sie, E., Mahmood, F., Cao, G., & Gedik, N. (2017). Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.235141","ista":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. 2017. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 96(23).","ama":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 2017;96(23). doi:10.1103/PhysRevB.96.235141","chicago":"Alpichshev, Zhanybek, Edbert Sie, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.235141.","short":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, N. Gedik, Physical Review B 96 (2017).","mla":"Alpichshev, Zhanybek, et al. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B, vol. 96, no. 23, American Physical Society, 2017, doi:10.1103/PhysRevB.96.235141."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2017-12-26T00:00:00Z","doi":"10.1103/PhysRevB.96.235141","month":"12","day":"26"},{"doi":"10.1103/PhysRevB.95.115125","date_published":"2017-03-13T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 2017;95(11). doi:10.1103/PhysRevB.95.115125","ieee":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, and R. Greene, “Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ,” Physical Review B, vol. 95, no. 11. American Physical Society, 2017.","apa":"Vishik, I., Mahmood, F., Alpichshev, Z., Gedik, N., Higgins, J., & Greene, R. (2017). Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.95.115125","ista":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. 2017. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 95(11).","short":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, R. Greene, Physical Review B 95 (2017).","mla":"Vishik, Inna, et al. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B, vol. 95, no. 11, American Physical Society, 2017, doi:10.1103/PhysRevB.95.115125.","chicago":"Vishik, Inna, Fahad Mahmood, Zhanybek Alpichshev, Nuh Gedik, Joshu Higgins, and Richard Greene. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.115125."},"main_file_link":[{"url":"http://dspace.mit.edu/handle/1721.1/109835","open_access":"1"}],"publication":"Physical Review B","month":"03","day":"13","author":[{"first_name":"Inna","last_name":"Vishik","full_name":"Vishik, Inna"},{"last_name":"Mahmood","first_name":"Fahad","full_name":"Mahmood, Fahad"},{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"},{"first_name":"Nuh","last_name":"Gedik","full_name":"Gedik, Nuh"},{"full_name":"Higgins, Joshu","first_name":"Joshu","last_name":"Higgins"},{"full_name":"Greene, Richard","last_name":"Greene","first_name":"Richard"}],"volume":95,"oa_version":"None","date_updated":"2021-01-12T07:53:12Z","date_created":"2018-12-11T11:46:13Z","_id":"392","acknowledgement":"Optical pump-probe work was supported by the Gordon and Betty Moore Foundation's EPiQS initiative through Grant No. GBMF4540. Materials growth and characterization was supported by AFOSR FA95501410332 and NSF DMR1410665.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","intvolume":" 95","publisher":"American Physical Society","title":"Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ","status":"public","publication_status":"published","publist_id":"7437","issue":"11","abstract":[{"lang":"eng","text":"We used femtosecond optical pump-probe spectroscopy to study the photoinduced change in reflectivity of thin films of the electron-doped cuprate La2-xCexCuO4 (LCCO) with dopings of x=0.08 (underdoped) and x=0.11 (optimally doped). Above Tc, we observe fluence-dependent relaxation rates that begin at a temperature similar to the one where transport measurements first show signatures of antiferromagnetic correlations. Upon suppressing superconductivity with a magnetic field, it is found that the fluence and temperature dependence of relaxation rates are consistent with bimolecular recombination of electrons and holes across a gap (2ΔAF) originating from antiferromagnetic correlations which comprise the pseudogap in electron-doped cuprates. This can be used to learn about coupling between electrons and high-energy (ω>2ΔAF) excitations in these compounds and set limits on the time scales on which antiferromagnetic correlations are static."}],"extern":"1","type":"journal_article"},{"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1186/s40170-017-0164-1","month":"01","publisher":"BioMed Central","publication_status":"published","year":"2017","volume":5,"date_created":"2018-12-11T11:46:30Z","date_updated":"2021-01-12T07:56:55Z","author":[{"last_name":"Hardie","first_name":"Rae","full_name":"Hardie, Rae"},{"full_name":"Van Dam, Ellen","first_name":"Ellen","last_name":"Van Dam"},{"last_name":"Cowley","first_name":"Mark","full_name":"Cowley, Mark"},{"full_name":"Han, Ting","first_name":"Ting","last_name":"Han"},{"full_name":"Balaban, Seher","first_name":"Seher","last_name":"Balaban"},{"first_name":"Marina","last_name":"Pajic","full_name":"Pajic, Marina"},{"first_name":"Mark","last_name":"Pinese","full_name":"Pinese, Mark"},{"full_name":"Iconomou, Mary","first_name":"Mary","last_name":"Iconomou"},{"full_name":"Shearer, Robert","first_name":"Robert","last_name":"Shearer"},{"first_name":"Jessie","last_name":"Mckenna","full_name":"Mckenna, Jessie"},{"last_name":"Miller","first_name":"David","full_name":"Miller, David"},{"full_name":"Waddell, Nicola","first_name":"Nicola","last_name":"Waddell"},{"full_name":"Pearson, John","first_name":"John","last_name":"Pearson"},{"full_name":"Grimmond, Sean","first_name":"Sean","last_name":"Grimmond"},{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A"},{"full_name":"Biankin, Andrew","first_name":"Andrew","last_name":"Biankin"},{"first_name":"Silas","last_name":"Villas Boas","full_name":"Villas Boas, Silas"},{"first_name":"Andrew","last_name":"Hoy","full_name":"Hoy, Andrew"},{"last_name":"Turner","first_name":"Nigel","full_name":"Turner, Nigel"},{"first_name":"Darren","last_name":"Saunders","full_name":"Saunders, Darren"}],"extern":"1","publist_id":"7380","file_date_updated":"2020-07-14T12:46:29Z","citation":{"ama":"Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1","apa":"Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders, D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1","ieee":"R. Hardie et al., “Mitochondrial mutations and metabolic adaptation in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central, 2017.","ista":"Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA, Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 5(2).","short":"R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese, M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond, L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer & Metabolism 5 (2017).","mla":"Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017, doi:10.1186/s40170-017-0164-1.","chicago":"Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1."},"publication":"Cancer & Metabolism","date_published":"2017-01-30T00:00:00Z","has_accepted_license":"1","day":"30","intvolume":" 5","title":"Mitochondrial mutations and metabolic adaptation in pancreatic cancer","ddc":["570"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"443","oa_version":"Published Version","file":[{"file_name":"2017_Cancer_Hardie.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1609174,"creator":"dernst","relation":"main_file","file_id":"5868","date_created":"2019-01-22T08:17:56Z","date_updated":"2020-07-14T12:46:29Z","checksum":"337a65786875f64a1fe9fc0ac24767dc"}],"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"Pancreatic cancer has a five-year survival rate of ~8%, with characteristic molecular heterogeneity and restricted treatment options. Targeting metabolism has emerged as a potentially effective therapeutic strategy for cancers such as pancreatic cancer, which are driven by genetic alterations that are not tractable drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been observed in various tumors types, understanding of metabolic genotype-phenotype relationships is limited."}]},{"issue":"1","publist_id":"7378","abstract":[{"lang":"eng","text":"The Loschmidt echo, defined as the overlap between quantum wave function evolved with different Hamiltonians, quantifies the sensitivity of quantum dynamics to perturbations and is often used as a probe of quantum chaos. In this work we consider the behavior of the Loschmidt echo in the many-body localized phase, which is characterized by emergent local integrals of motion and provides a generic example of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt echo decay as a power law in time in the many-body localized phase, in contrast to the exponential decay in few-body ergodic systems. We consider the spin-echo generalization of the Loschmidt echo and argue that the corresponding correlation function saturates to a finite value in localized systems. Slow, power-law decay of fluctuations of such spin-echo-type overlap is related to the operator spreading and is present only in the many-body localized phase, but not in a noninteracting Anderson insulator. While most of the previously considered probes of dephasing dynamics could be understood by approximating physical spin operators with local integrals of motion, the Loschmidt echo and its generalizations crucially depend on the full expansion of the physical operators via local integrals of motion operators, as well as operators which flip local integrals of motion. Hence these probes allow one to get insights into the relation between physical operators and local integrals of motion and access the operator spreading in the many-body localized phase."}],"extern":1,"type":"journal_article","author":[{"full_name":"Maksym Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","last_name":"Serbyn"},{"full_name":"Abanin, Dimitry A","last_name":"Abanin","first_name":"Dimitry"}],"volume":96,"date_created":"2018-12-11T11:46:31Z","date_updated":"2021-01-12T07:57:03Z","_id":"445","year":"2017","acknowledgement":"This research was supported in part by the National\nScience Foundation under Grant No. NSF PHY11-25915.\nM.S. was supported by Gordon and Betty Moore Foundation’s\nEPiQS Initiative through Grant No. GBMF4307. D.A. also\nacknowledges support by Swiss National Science Foundation.","publisher":"American Physical Society","intvolume":" 96","title":"Loschmidt echo in many body localized phases","status":"public","publication_status":"published","month":"07","day":"12","doi":"10.1103/PhysRevB.96.014202","date_published":"2017-07-12T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1701.07772","open_access":"1"}],"oa":1,"citation":{"mla":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202.","short":"M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","chicago":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.","ama":"Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202","ista":"Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 96(1).","ieee":"M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American Physical Society, 2017.","apa":"Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.014202"},"publication":"Physical Review B - Condensed Matter and Materials Physics","quality_controlled":0},{"month":"11","language":[{"iso":"eng"}],"doi":"10.1016/j.bpj.2017.09.006","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:46:31Z","publist_id":"7369","date_created":"2018-12-11T11:46:33Z","date_updated":"2021-01-12T07:59:28Z","volume":113,"author":[{"full_name":"Fallesen, Todd","last_name":"Fallesen","first_name":"Todd"},{"first_name":"Johanna","last_name":"Roostalu","full_name":"Roostalu, Johanna"},{"orcid":"0000-0001-6335-9748","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","first_name":"Christian F","full_name":"Düllberg, Christian F"},{"full_name":"Pruessner, Gunnar","first_name":"Gunnar","last_name":"Pruessner"},{"last_name":"Surrey","first_name":"Thomas","full_name":"Surrey, Thomas"}],"publication_status":"published","publisher":"Biophysical Society","department":[{"_id":"MaLo"}],"year":"2017","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","day":"07","article_processing_charge":"No","has_accepted_license":"1","date_published":"2017-11-07T00:00:00Z","article_type":"original","page":"2055 - 2067","publication":"Biophysical Journal","citation":{"ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006."},"abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"issue":"9","type":"journal_article","oa_version":"Published Version","file":[{"file_id":"5052","relation":"main_file","date_created":"2018-12-12T10:14:03Z","date_updated":"2020-07-14T12:46:31Z","checksum":"99a2474088e20ac74b1882c4fbbb45b1","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","access_level":"open_access","creator":"system","file_size":977192,"content_type":"application/pdf"}],"pubrep_id":"965","ddc":["570"],"status":"public","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","intvolume":" 113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"453"},{"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"external_id":{"arxiv":["1410.0833"]},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"doi":"10.23638/LMCS-13(3:26)2017","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["1860-5974"]},"year":"2017","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"related_material":{"record":[{"id":"1661","relation":"earlier_version","status":"public"}]},"date_created":"2018-12-11T11:46:37Z","date_updated":"2023-02-23T10:08:55Z","volume":13,"article_number":"26","file_date_updated":"2020-07-14T12:46:32Z","ec_funded":1,"publist_id":"7357","publication":"Logical Methods in Computer Science","citation":{"chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017"},"date_published":"2017-09-26T00:00:00Z","scopus_import":"1","day":"26","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"464","status":"public","ddc":["004"],"title":"Improved algorithms for parity and Streett objectives","intvolume":" 13","pubrep_id":"956","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5010","date_created":"2018-12-12T10:13:27Z","date_updated":"2020-07-14T12:46:32Z","checksum":"12d469ae69b80361333d7dead965cf5d","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","access_level":"open_access","file_size":582940,"content_type":"application/pdf","creator":"system"}],"type":"journal_article","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"issue":"3"},{"article_number":"103","publist_id":"7350","ec_funded":1,"file_date_updated":"2020-07-14T12:46:34Z","department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published","year":"2017","volume":36,"date_updated":"2023-02-23T12:20:26Z","date_created":"2018-12-11T11:46:39Z","author":[{"full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","first_name":"Stefan"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"}],"publication_identifier":{"issn":["07300301"]},"month":"07","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"doi":"10.1145/3072959.3073678","type":"journal_article","issue":"4","abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"intvolume":" 36","title":"Water wave packets","ddc":["006"],"status":"public","_id":"470","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","date_created":"2020-01-24T09:32:35Z","date_updated":"2020-07-14T12:46:34Z","file_id":"7359","relation":"main_file","creator":"wojtan","file_size":13131683,"content_type":"application/pdf","access_level":"open_access","file_name":"wavepackets_final.pdf"}],"scopus_import":1,"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"01","article_type":"original","citation":{"ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017)."},"publication":"ACM Transactions on Graphics","date_published":"2017-07-01T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1145/3060139","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"month":"05","publication_identifier":{"issn":["15293785"]},"date_created":"2018-12-11T11:46:39Z","date_updated":"2023-02-21T16:48:11Z","volume":18,"author":[{"full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana"}],"related_material":{"record":[{"id":"1234","status":"public","relation":"earlier_version"}]},"publication_status":"published","publisher":"ACM","department":[{"_id":"ToHe"}],"year":"2017","publist_id":"7349","ec_funded":1,"article_number":"12","date_published":"2017-05-01T00:00:00Z","publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017."},"day":"01","scopus_import":1,"oa_version":"Submitted Version","title":"Faster statistical model checking for unbounded temporal properties","status":"public","intvolume":" 18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"471","abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. ","lang":"eng"}],"issue":"2","type":"journal_article"},{"pubrep_id":"949","file":[{"relation":"main_file","file_id":"4758","date_created":"2018-12-12T10:09:34Z","date_updated":"2020-07-14T12:46:35Z","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","access_level":"open_access","content_type":"application/pdf","file_size":769296,"creator":"system"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"481","intvolume":" 26","status":"public","ddc":["004","514","516"],"title":"Planar matchings for weighted straight skeletons","issue":"3-4","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"type":"journal_article","date_published":"2017-04-13T00:00:00Z","citation":{"short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229."},"publication":"International Journal of Computational Geometry and Applications","page":"211 - 229","has_accepted_license":"1","day":"13","scopus_import":1,"related_material":{"record":[{"id":"10892","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Biedl, Therese","first_name":"Therese","last_name":"Biedl"},{"full_name":"Huber, Stefan","last_name":"Huber","first_name":"Stefan","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"volume":26,"date_created":"2018-12-11T11:46:43Z","date_updated":"2023-02-21T16:06:22Z","year":"2017","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","publisher":"World Scientific Publishing","department":[{"_id":"HeEd"}],"publication_status":"published","publist_id":"7338","file_date_updated":"2020-07-14T12:46:35Z","doi":"10.1142/S0218195916600050","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","month":"04"},{"type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"484","intvolume":" 21","status":"public","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","oa_version":"Submitted Version","scopus_import":1,"day":"01","citation":{"mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017."},"publication":"Advances in Theoretical and Mathematical Physics","page":"683 - 738","date_published":"2017-01-01T00:00:00Z","publist_id":"7336","ec_funded":1,"year":"2017","department":[{"_id":"RoSe"}],"publisher":"International Press","publication_status":"published","author":[{"full_name":"Nam, Phan","first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M"}],"volume":21,"date_created":"2018-12-11T11:46:43Z","date_updated":"2021-01-12T08:00:58Z","publication_identifier":{"issn":["10950761"]},"month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"quality_controlled":"1","doi":"10.4310/ATMP.2017.v21.n3.a4","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"25","citation":{"ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5."},"publication":"Advances in Theoretical and Mathematical Physics","page":"739 - 800","date_published":"2017-08-25T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"_id":"483","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 21","status":"public","title":"Universality for a class of random band matrices","oa_version":"Submitted Version","publication_identifier":{"issn":["10950761"]},"month":"08","main_file_link":[{"url":"https://arxiv.org/abs/1602.02312","open_access":"1"}],"oa":1,"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.4310/ATMP.2017.v21.n3.a5","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"7337","year":"2017","department":[{"_id":"LaEr"}],"publisher":"International Press","publication_status":"published","author":[{"first_name":"Paul","last_name":"Bourgade","full_name":"Bourgade, Paul"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"},{"first_name":"Jun","last_name":"Yin","full_name":"Yin, Jun"}],"volume":21,"date_updated":"2021-01-12T08:00:57Z","date_created":"2018-12-11T11:46:43Z"},{"article_number":"16032","file_date_updated":"2020-07-14T12:46:36Z","publist_id":"7305","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"JoCs"}],"year":"2017","date_updated":"2021-01-12T08:01:16Z","date_created":"2018-12-11T11:46:54Z","volume":8,"author":[{"first_name":"Jean","last_name":"Simonnet","full_name":"Simonnet, Jean"},{"full_name":"Nassar, Mérie","first_name":"Mérie","last_name":"Nassar"},{"first_name":"Federico","last_name":"Stella","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico"},{"full_name":"Cohen, Ivan","last_name":"Cohen","first_name":"Ivan"},{"full_name":"Mathon, Bertrand","last_name":"Mathon","first_name":"Bertrand"},{"orcid":"0000-0001-7237-5109","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","last_name":"Boccara","first_name":"Charlotte","full_name":"Boccara, Charlotte"},{"last_name":"Miles","first_name":"Richard","full_name":"Miles, Richard"},{"full_name":"Fricker, Desdemona","first_name":"Desdemona","last_name":"Fricker"}],"month":"07","publication_identifier":{"issn":["20411723"]},"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/ncomms16032","type":"journal_article","abstract":[{"text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum.","lang":"eng"}],"title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","ddc":["571"],"status":"public","intvolume":" 8","_id":"514","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"5083","checksum":"76d8a2b72a58e56adb410ec37dfa7eee","date_created":"2018-12-12T10:14:31Z","date_updated":"2020-07-14T12:46:36Z","access_level":"open_access","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","file_size":2948357,"content_type":"application/pdf","creator":"system"}],"oa_version":"Published Version","pubrep_id":"937","scopus_import":1,"day":"01","has_accepted_license":"1","publication":"Nature Communications","citation":{"ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","ieee":"J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032","ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032.","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.","short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017)."},"date_published":"2017-07-01T00:00:00Z"},{"abstract":[{"text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.","lang":"eng"}],"issue":"10","type":"journal_article","file":[{"date_created":"2019-11-07T12:51:07Z","date_updated":"2020-07-14T12:46:36Z","checksum":"9bc7e8c41b43636dd7566289e511f096","file_id":"6993","relation":"main_file","creator":"lsazanov","content_type":"application/pdf","file_size":4118385,"file_name":"29893_2_merged_1501257589_red.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","ddc":["572"],"status":"public","intvolume":" 24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"515","day":"05","has_accepted_license":"1","scopus_import":1,"date_published":"2017-10-05T00:00:00Z","article_type":"original","page":"800 - 808","publication":"Nature Structural and Molecular Biology","citation":{"chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.","mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808.","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","apa":"Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460"},"file_date_updated":"2020-07-14T12:46:36Z","ec_funded":1,"publist_id":"7304","date_updated":"2021-01-12T08:01:17Z","date_created":"2018-12-11T11:46:54Z","volume":24,"author":[{"id":"322DA418-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9864-3586","first_name":"James A","last_name":"Letts","full_name":"Letts, James A"},{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A"}],"publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"LeSa"}],"year":"2017","month":"10","publication_identifier":{"issn":["15459993"]},"language":[{"iso":"eng"}],"doi":"10.1038/nsmb.3460","quality_controlled":"1","project":[{"grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"oa":1},{"date_published":"2017-04-01T00:00:00Z","doi":"10.1103/PhysRevFluids.2.043904","language":[{"iso":"eng"}],"publication":"Physical Review Fluids","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02619"}],"oa":1,"citation":{"ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904.","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904."},"quality_controlled":"1","month":"04","day":"01","scopus_import":1,"author":[{"full_name":"Klotz, Lukasz","last_name":"Klotz","first_name":"Lukasz","orcid":"0000-0003-1740-7635","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lemoult","first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","full_name":"Lemoult, Grégoire M"},{"full_name":"Frontczak, Idalia","last_name":"Frontczak","first_name":"Idalia"},{"full_name":"Tuckerman, Laurette","last_name":"Tuckerman","first_name":"Laurette"},{"last_name":"Wesfreid","first_name":"José","full_name":"Wesfreid, José"}],"date_created":"2018-12-11T11:46:54Z","date_updated":"2021-01-12T08:01:16Z","volume":2,"oa_version":"Preprint","_id":"513","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","publication_status":"published","status":"public","title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","department":[{"_id":"BjHo"}],"intvolume":" 2","publisher":"American Physical Society","abstract":[{"lang":"eng","text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction."}],"publist_id":"7306","issue":"4","article_number":"043904","type":"journal_article"},{"publist_id":"7299","abstract":[{"lang":"eng","text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension."}],"type":"journal_article","author":[{"last_name":"Austin","first_name":"Kyle","full_name":"Austin, Kyle"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","last_name":"Virk","first_name":"Ziga","full_name":"Virk, Ziga"}],"oa_version":"Submitted Version","volume":215,"date_updated":"2021-01-12T08:01:21Z","date_created":"2018-12-11T11:46:56Z","_id":"521","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"publisher":"Elsevier","intvolume":" 215","status":"public","title":"Higson compactification and dimension raising","publication_status":"published","publication_identifier":{"issn":["01668641"]},"month":"01","day":"01","doi":"10.1016/j.topol.2016.10.005","date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.03954v1"}],"oa":1,"citation":{"mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. Topology and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57.","apa":"Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017."},"publication":"Topology and its Applications","page":"45 - 57","quality_controlled":"1"},{"extern":1,"abstract":[{"lang":"eng","text":"The Casparian strip is an important barrier regulating water and nutrient uptake into root tissues. New research reveals two peptide signals and their co-receptors play critical roles patterning and maintaining barrier integrity. "}],"file_date_updated":"2020-07-14T12:46:38Z","publist_id":"7294","issue":"5","type":"journal_article","date_updated":"2021-01-12T08:01:23Z","date_created":"2018-12-11T11:46:58Z","file":[{"access_level":"open_access","file_name":"IST-2018-983-v1+1_Plant_biology_Building_barriers__in_roots.pdf","file_size":2840413,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5330","checksum":"81fd4475c5a2a2c6f4313beeab215ed9","date_created":"2018-12-12T10:18:11Z","date_updated":"2020-07-14T12:46:38Z"}],"volume":27,"author":[{"first_name":"Daniel","last_name":"Von Wangenheim","id":"49E91952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-1247","full_name":"Daniel von Wangenheim"},{"first_name":"Tatsuaki","last_name":"Goh","full_name":"Goh, Tatsuaki"},{"last_name":"Dietrich","first_name":"Daniela","full_name":"Dietrich, Daniela"},{"last_name":"Bennett","first_name":"Malcolm","full_name":"Bennett, Malcolm J"}],"pubrep_id":"983","title":"Plant biology: Building barriers… in roots","publication_status":"published","status":"public","intvolume":" 27","publisher":"Cell Press","_id":"525","acknowledgement":"Biotechnology and Biological Sciences Research Council:\tBBSRC BB/M001806/1 and BB/H020314/1\t","year":"2017","day":"06","month":"03","doi":"10.1016/j.cub.2017.01.060","date_published":"2017-03-06T00:00:00Z","quality_controlled":0,"page":"R172 - R174","publication":"Current Biology","citation":{"apa":"von Wangenheim, D., Goh, T., Dietrich, D., & Bennett, M. (2017). Plant biology: Building barriers… in roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.01.060","ieee":"D. von Wangenheim, T. Goh, D. Dietrich, and M. Bennett, “Plant biology: Building barriers… in roots,” Current Biology, vol. 27, no. 5. Cell Press, pp. R172–R174, 2017.","ista":"von Wangenheim D, Goh T, Dietrich D, Bennett M. 2017. Plant biology: Building barriers… in roots. Current Biology. 27(5), R172–R174.","ama":"von Wangenheim D, Goh T, Dietrich D, Bennett M. Plant biology: Building barriers… in roots. Current Biology. 2017;27(5):R172-R174. doi:10.1016/j.cub.2017.01.060","chicago":"Wangenheim, Daniel von, Tatsuaki Goh, Daniela Dietrich, and Malcolm Bennett. “Plant Biology: Building Barriers… in Roots.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.01.060.","short":"D. von Wangenheim, T. Goh, D. Dietrich, M. Bennett, Current Biology 27 (2017) R172–R174.","mla":"von Wangenheim, Daniel, et al. “Plant Biology: Building Barriers… in Roots.” Current Biology, vol. 27, no. 5, Cell Press, 2017, pp. R172–74, doi:10.1016/j.cub.2017.01.060."},"oa":1,"main_file_link":[{"url":"https://repository.ist.ac.at/id/eprint/983","open_access":"1"}]},{"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-21T17:01:34Z","volume":58,"author":[{"full_name":"Burton, Benjamin","first_name":"Benjamin","last_name":"Burton"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N","last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N"},{"last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"related_material":{"record":[{"id":"1379","relation":"earlier_version","status":"public"}]},"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","year":"2017","publist_id":"7283","language":[{"iso":"eng"}],"doi":"10.1007/s00454-017-9900-0","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.07907","open_access":"1"}],"external_id":{"arxiv":["1602.07907"]},"month":"06","publication_identifier":{"issn":["01795376"]},"oa_version":"Preprint","title":"Finding non-orientable surfaces in 3-Manifolds","status":"public","intvolume":" 58","_id":"534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"issue":"4","type":"journal_article","date_published":"2017-06-09T00:00:00Z","article_type":"original","page":"871 - 888","publication":"Discrete & Computational Geometry","citation":{"chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0.","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0"},"day":"09","article_processing_charge":"No","scopus_import":1},{"intvolume":" 129","title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","status":"public","ddc":["571"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"538","file":[{"relation":"main_file","file_id":"5007","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T10:13:24Z","access_level":"open_access","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","file_size":1668557,"content_type":"application/pdf","creator":"system"}],"oa_version":"Published Version","pubrep_id":"932","type":"journal_article","issue":"16","abstract":[{"text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. ","lang":"ger"}],"page":"4679 - 4682","citation":{"ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998."},"publication":"Angewandte Chemie","date_published":"2017-05-20T00:00:00Z","has_accepted_license":"1","day":"20","department":[{"_id":"CaGu"},{"_id":"HaJa"}],"publisher":"Wiley","publication_status":"published","year":"2017","volume":129,"date_updated":"2021-01-12T08:01:33Z","date_created":"2018-12-11T11:47:02Z","author":[{"last_name":"Kainrath","first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"full_name":"Stadler, Manuela","first_name":"Manuela","last_name":"Stadler"},{"full_name":"Gschaider-Reichhart, Eva","first_name":"Eva","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7218-7738"},{"last_name":"Distel","first_name":"Martin","full_name":"Distel, Martin"},{"last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"}],"ec_funded":1,"publist_id":"7279","file_date_updated":"2020-07-14T12:46:39Z","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Molecular Drug Targets","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1002/ange.201611998","month":"05"},{"date_published":"2017-12-01T00:00:00Z","publication":"PLoS Pathogens","citation":{"ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017.","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758."},"day":"01","has_accepted_license":"1","scopus_import":1,"pubrep_id":"931","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:46:44Z","date_created":"2018-12-12T10:12:26Z","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","file_id":"4944","relation":"main_file","creator":"system","file_size":4106772,"content_type":"application/pdf","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","access_level":"open_access"}],"_id":"540","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576","616"],"status":"public","title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","intvolume":" 13","abstract":[{"text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.","lang":"eng"}],"issue":"12","type":"journal_article","doi":"10.1371/journal.ppat.1006758","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","month":"12","publication_identifier":{"issn":["15537366"]},"author":[{"last_name":"Khamina","first_name":"Kseniya","full_name":"Khamina, Kseniya"},{"full_name":"Lercher, Alexander","first_name":"Alexander","last_name":"Lercher"},{"first_name":"Michael","last_name":"Caldera","full_name":"Caldera, Michael"},{"last_name":"Schliehe","first_name":"Christopher","full_name":"Schliehe, Christopher"},{"last_name":"Vilagos","first_name":"Bojan","full_name":"Vilagos, Bojan"},{"full_name":"Sahin, Mehmet","first_name":"Mehmet","last_name":"Sahin"},{"first_name":"Lindsay","last_name":"Kosack","full_name":"Kosack, Lindsay"},{"full_name":"Bhattacharya, Anannya","first_name":"Anannya","last_name":"Bhattacharya"},{"first_name":"Peter","last_name":"Májek","full_name":"Májek, Peter"},{"full_name":"Stukalov, Alexey","first_name":"Alexey","last_name":"Stukalov"},{"full_name":"Sacco, Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto","last_name":"Sacco"},{"full_name":"James, Leo","first_name":"Leo","last_name":"James"},{"full_name":"Pinschewer, Daniel","last_name":"Pinschewer","first_name":"Daniel"},{"last_name":"Bennett","first_name":"Keiryn","full_name":"Bennett, Keiryn"},{"full_name":"Menche, Jörg","first_name":"Jörg","last_name":"Menche"},{"first_name":"Andreas","last_name":"Bergthaler","full_name":"Bergthaler, Andreas"}],"date_created":"2018-12-11T11:47:03Z","date_updated":"2021-01-12T08:01:48Z","volume":13,"year":"2017","publication_status":"published","department":[{"_id":"GaNo"}],"publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:46:44Z","publist_id":"7276","article_number":"e1006758"},{"department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","publication_status":"published","year":"2017","volume":13,"date_created":"2018-12-11T11:46:38Z","date_updated":"2023-02-23T12:26:16Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1657"},{"relation":"earlier_version","status":"public","id":"5429"},{"id":"5435","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Zuzana","last_name":"Křetínská","full_name":"Křetínská, Zuzana"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"article_number":"15","ec_funded":1,"publist_id":"7355","file_date_updated":"2020-07-14T12:46:33Z","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"quality_controlled":"1","oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(2:15)2017","publication_identifier":{"issn":["18605974"]},"month":"07","intvolume":" 13","status":"public","ddc":["004"],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","_id":"466","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_size":511832,"creator":"system","access_level":"open_access","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","checksum":"bfa405385ec6229ad5ead89ab5751639","date_created":"2018-12-12T10:18:32Z","date_updated":"2020-07-14T12:46:33Z","relation":"main_file","file_id":"5354"}],"oa_version":"Published Version","pubrep_id":"957","type":"journal_article","issue":"2","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017"},"publication":"Logical Methods in Computer Science","date_published":"2017-07-03T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"03"},{"scopus_import":1,"day":"01","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769"},"publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2017-12-01T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"_id":"467","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 18","status":"public","title":"Nested weighted automata","oa_version":"Preprint","publication_identifier":{"issn":["15293785"]},"month":"12","oa":1,"external_id":{"arxiv":["1606.03598"]},"main_file_link":[{"url":"https://arxiv.org/abs/1606.03598","open_access":"1"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1145/3152769","language":[{"iso":"eng"}],"article_number":"31","ec_funded":1,"publist_id":"7354","year":"2017","publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"1656","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"volume":18,"date_updated":"2023-02-23T12:26:19Z","date_created":"2018-12-11T11:46:38Z"},{"month":"09","publication_identifier":{"issn":["18605974"]},"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"doi":"10.23638/LMCS-13(3:23)2017","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:33Z","ec_funded":1,"publist_id":"7356","year":"2017","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1610"},{"id":"5438","relation":"earlier_version","status":"public"}]},"date_updated":"2023-02-23T12:26:25Z","date_created":"2018-12-11T11:46:37Z","volume":13,"scopus_import":1,"day":"13","has_accepted_license":"1","publication":"Logical Methods in Computer Science","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017"},"date_published":"2017-09-13T00:00:00Z","type":"journal_article","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"issue":"3","_id":"465","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","title":"Edit distance for pushdown automata","intvolume":" 13","pubrep_id":"955","file":[{"relation":"main_file","file_id":"5090","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","checksum":"08041379ba408d40664f449eb5907a8f","file_name":"IST-2015-321-v1+1_main.pdf","access_level":"open_access","file_size":279071,"content_type":"application/pdf","creator":"system"},{"access_level":"open_access","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","creator":"system","content_type":"application/pdf","file_size":279071,"file_id":"5091","relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","date_created":"2018-12-12T10:14:38Z","date_updated":"2020-07-14T12:46:33Z"}],"oa_version":"Published Version"},{"year":"2017","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","publication_status":"published","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5449"}]},"author":[{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"volume":7,"date_updated":"2023-02-23T12:26:57Z","date_created":"2018-12-11T11:46:53Z","article_number":"82","publist_id":"7307","ec_funded":1,"file_date_updated":"2020-07-14T12:46:36Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","doi":"10.1038/s41598-017-00107-w","language":[{"iso":"eng"}],"publication_identifier":{"issn":["20452322"]},"month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"512","intvolume":" 7","title":"Amplification on undirected population structures: Comets beat stars","status":"public","ddc":["004"],"pubrep_id":"938","file":[{"file_id":"5357","relation":"main_file","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:18:35Z","access_level":"open_access","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","creator":"system","file_size":1536783,"content_type":"application/pdf"}],"oa_version":"Published Version","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. "}],"citation":{"ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w."},"publication":"Scientific Reports","date_published":"2017-03-06T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"06"},{"article_number":"30","ec_funded":1,"file_date_updated":"2021-12-07T08:06:28Z","year":"2017","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"id":"5455","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Choudhary, Bhavya","first_name":"Bhavya","last_name":"Choudhary"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"}],"volume":2,"date_created":"2021-12-05T23:01:48Z","date_updated":"2023-02-23T12:27:13Z","publication_identifier":{"eissn":["2475-1421"]},"month":"12","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1910.00241"]},"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1145/3158118","conference":{"location":"Los Angeles, CA, United States","start_date":"2018-01-07","end_date":"2018-01-13","name":"POPL: Programming Languages"},"language":[{"iso":"eng"}],"type":"journal_article","issue":"POPL","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"_id":"10416","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 2","status":"public","title":"Optimal Dyck reachability for data-dependence and Alias analysis","ddc":["000"],"file":[{"creator":"cchlebak","file_size":460188,"content_type":"application/pdf","file_name":"2017_ACMProgLang_Chatterjee.pdf","access_level":"open_access","date_created":"2021-12-07T08:06:28Z","date_updated":"2021-12-07T08:06:28Z","success":1,"checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","file_id":"10421","relation":"main_file"}],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"27","citation":{"chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118"},"publication":"Proceedings of the ACM on Programming Languages","article_type":"original","date_published":"2017-12-27T00:00:00Z"},{"month":"10","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2017-870-v1-1","language":[{"iso":"eng"}],"oa":1,"file_date_updated":"2020-07-14T12:46:59Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10416"}]},"date_created":"2018-12-12T11:39:26Z","date_updated":"2023-02-21T15:54:10Z","year":"2017","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"day":"23","has_accepted_license":"1","article_processing_charge":"No","date_published":"2017-10-23T00:00:00Z","citation":{"ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1."},"page":"37","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"870","oa_version":"Published Version","file":[{"file_id":"5524","relation":"main_file","checksum":"177a84a46e3ac17e87b31534ad16a4c9","date_created":"2018-12-12T11:54:02Z","date_updated":"2020-07-14T12:46:59Z","access_level":"open_access","file_name":"IST-2017-870-v1+1_main.pdf","creator":"system","content_type":"application/pdf","file_size":960491}],"_id":"5455","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","title":"Optimal Dyck reachability for data-dependence and alias analysis","ddc":["000"]},{"type":"report","abstract":[{"text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:59Z","extern":0,"_id":"5450","year":"2017","status":"public","title":"Implementing the institutional data repository IST DataRep","publisher":"IST Austria","department":[{"_id":"E-Lib"}],"author":[{"id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","first_name":"Barbara","last_name":"Petritsch","full_name":"Barbara Petritsch"}],"pubrep_id":"724","date_updated":"2020-07-14T23:05:03Z","date_created":"2018-12-12T11:39:24Z","file":[{"access_level":"open_access","file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf","content_type":"application/pdf","file_size":3460985,"creator":"system","relation":"main_file","file_id":"5483","checksum":"6321792dcfa82bf490f17615a9b22355","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:22Z"}],"day":"26","month":"06","citation":{"ieee":"B. Petritsch, Implementing the institutional data repository IST DataRep. IST Austria, 2017.","apa":"Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.","ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","ama":"Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017.","chicago":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","mla":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017."},"oa":1,"main_file_link":[{"url":"https://repository.ist.ac.at/id/eprint/724.","open_access":"1"}],"publication_date":"2017-06-26","date_published":"2017-06-26T00:00:00Z"},{"publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","year":"2017","date_created":"2021-12-05T23:01:49Z","date_updated":"2023-02-23T12:27:16Z","volume":2,"author":[{"first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"},{"last_name":"Sinha","first_name":"Nishant","full_name":"Sinha, Nishant"},{"last_name":"Vaidya","first_name":"Kapil","full_name":"Vaidya, Kapil"}],"related_material":{"record":[{"id":"5448","status":"public","relation":"earlier_version"},{"id":"5456","status":"public","relation":"earlier_version"}]},"article_number":"31","ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"oa":1,"external_id":{"arxiv":["1610.01188"]},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158119","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"POPL: Programming Languages","location":"Los Angeles, CA, United States","start_date":"2018-01-07","end_date":"2018-01-13"},"doi":"10.1145/3158119","month":"12","publication_identifier":{"eissn":["2475-1421"]},"status":"public","title":"Data-centric dynamic partial order reduction","intvolume":" 2","_id":"10417","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.","lang":"eng"}],"issue":"POPL","article_type":"original","publication":"Proceedings of the ACM on Programming Languages","citation":{"apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119."},"date_published":"2017-12-27T00:00:00Z","scopus_import":"1","day":"27","article_processing_charge":"No"},{"page":"36","oa":1,"citation":{"short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.","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","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","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p."},"language":[{"iso":"eng"}],"date_published":"2017-10-23T00:00:00Z","doi":"10.15479/AT:IST-2017-872-v1-1","day":"23","month":"10","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","status":"public","ddc":["000"],"title":"Data-centric dynamic partial order reduction","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IST Austria","_id":"5456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","date_created":"2018-12-12T11:39:26Z","date_updated":"2023-02-23T12:26:54Z","file":[{"file_name":"IST-2017-872-v1+1_main.pdf","access_level":"open_access","content_type":"application/pdf","file_size":910347,"creator":"system","relation":"main_file","file_id":"5487","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:26Z","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7"}],"oa_version":"Published Version","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"last_name":"Sinha","first_name":"Nishant","full_name":"Sinha, Nishant"},{"first_name":"Kapil","last_name":"Vaidya","full_name":"Vaidya, Kapil"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10417"},{"id":"5448","relation":"earlier_version","status":"public"}]},"pubrep_id":"872","alternative_title":["IST Austria Technical Report"],"type":"technical_report","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."}],"file_date_updated":"2020-07-14T12:46:59Z"},{"file_date_updated":"2020-07-14T12:47:00Z","publist_id":"7263","article_number":"61","date_created":"2018-12-11T11:47:08Z","date_updated":"2021-01-12T08:02:34Z","volume":83,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"year":"2017","month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"language":[{"iso":"eng"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25"},"doi":"10.4230/LIPIcs.MFCS.2017.61","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"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"}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:18:04Z","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","file_id":"5322","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":535077,"file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","access_level":"open_access"}],"oa_version":"Published Version","pubrep_id":"924","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","status":"public","ddc":["004"],"intvolume":" 83","_id":"551","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2017-11-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"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.","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.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","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 Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","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"}},{"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25"},"doi":"10.4230/LIPIcs.MFCS.2017.39","month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"year":"2017","date_updated":"2023-02-14T10:06:46Z","date_created":"2018-12-11T11:47:08Z","volume":83,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"article_number":"39","license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2020-07-14T12:47:00Z","publist_id":"7262","ec_funded":1,"publication":"Leibniz International Proceedings in Informatics","citation":{"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.","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.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","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.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"date_published":"2017-11-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","title":"Faster algorithms for mean-payoff parity games","ddc":["004"],"status":"public","intvolume":" 83","_id":"552","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","creator":"system","file_size":610339,"content_type":"application/pdf","file_id":"5248","relation":"main_file","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:16:57Z"}],"pubrep_id":"923","alternative_title":["LIPIcs"],"type":"conference","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":"55","file_date_updated":"2020-07-14T12:47:00Z","publist_id":"7261","year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Hansen, Kristofer","last_name":"Hansen","first_name":"Kristofer"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"}],"date_created":"2018-12-11T11:47:08Z","date_updated":"2021-01-12T08:02:35Z","volume":83,"month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"quality_controlled":"1","conference":{"start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"doi":"10.4230/LIPIcs.MFCS.2017.55","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","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. "}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"553","title":"Strategy complexity of concurrent safety games","status":"public","ddc":["004"],"intvolume":" 83","pubrep_id":"922","oa_version":"Published Version","file":[{"checksum":"7101facb56ade363205c695d72dbd173","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:09:29Z","relation":"main_file","file_id":"4753","file_size":549967,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf"}],"scopus_import":1,"day":"01","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","citation":{"chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55"},"date_published":"2017-11-01T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"560","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","status":"public","intvolume":" 473","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions."}],"issue":"2207","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","citation":{"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.","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.","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","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","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.","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.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017)."},"date_published":"2017-11-01T00:00:00Z","scopus_import":1,"day":"01","year":"2017","publication_status":"published","publisher":"Royal Society of London","department":[{"_id":"JaMa"}],"author":[{"full_name":"Gerencser, Mate","last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arnulf","last_name":"Jentzen","full_name":"Jentzen, Arnulf"},{"last_name":"Salimova","first_name":"Diyora","full_name":"Salimova, Diyora"}],"date_created":"2018-12-11T11:47:11Z","date_updated":"2021-01-12T08:03:04Z","volume":473,"article_number":"0104","publist_id":"7256","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.03229"}],"oa":1,"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1098/rspa.2017.0104","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["13645021"]}},{"publication_identifier":{"issn":["15320073"]},"month":"01","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.4310/HHA.2017.v19.n2.a16","ec_funded":1,"publist_id":"7246","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publisher":"International Press","publication_status":"published","year":"2017","volume":19,"date_updated":"2021-01-12T08:03:12Z","date_created":"2018-12-11T11:47:14Z","author":[{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Franek","full_name":"Franek, Peter"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Krcál","full_name":"Krcál, Marek"}],"scopus_import":1,"day":"01","page":"313 - 342","citation":{"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.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","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","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.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","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"},"publication":"Homology, Homotopy and Applications","date_published":"2017-01-01T00:00:00Z","type":"journal_article","issue":"2","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)."}],"intvolume":" 19","title":"Persistence of zero sets","status":"public","_id":"568","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version"},{"scopus_import":1,"day":"13","has_accepted_license":"1","publication":"eLife","citation":{"chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).","ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","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.","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","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"},"date_published":"2017-11-13T00:00:00Z","type":"journal_article","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. "}],"title":"Regulatory network structure determines patterns of intermolecular epistasis","ddc":["576"],"status":"public","intvolume":" 6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"570","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5096","checksum":"273ab17f33305e4eaafd911ff88e7c5b","date_created":"2018-12-12T10:14:42Z","date_updated":"2020-07-14T12:47:10Z","access_level":"open_access","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","file_size":8453470,"content_type":"application/pdf","creator":"system"},{"creator":"system","content_type":"application/pdf","file_size":1953221,"file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:14:43Z","checksum":"b433f90576c7be597cd43367946f8e7f","file_id":"5097","relation":"main_file"}],"pubrep_id":"918","month":"11","publication_identifier":{"issn":["2050084X"]},"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.7554/eLife.28921","article_number":"e28921","file_date_updated":"2020-07-14T12:47:10Z","publist_id":"7244","ec_funded":1,"publication_status":"published","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"publisher":"eLife Sciences Publications","year":"2017","date_created":"2018-12-11T11:47:14Z","date_updated":"2021-01-12T08:03:15Z","volume":6,"author":[{"full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator","first_name":"Mato"},{"id":"35F0286E-F248-11E8-B48F-1D18A9856A87","last_name":"Sarikas","first_name":"Srdjan","full_name":"Sarikas, Srdjan"},{"id":"2DDF136A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1986-9753","first_name":"Hande","last_name":"Acar","full_name":"Acar, Hande"},{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"},{"last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"}]},{"type":"journal_article","abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}],"title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","status":"public","ddc":["570"],"intvolume":" 6","_id":"569","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":9666973,"creator":"system","access_level":"open_access","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","checksum":"ba09c1451153d39e4f4b7cee013e314c","date_created":"2018-12-12T10:10:40Z","date_updated":"2020-07-14T12:47:10Z","relation":"main_file","file_id":"4829"},{"file_id":"4830","relation":"main_file","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:10:41Z","checksum":"01eb51f1d6ad679947415a51c988e137","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","access_level":"open_access","creator":"system","file_size":5951246,"content_type":"application/pdf"}],"pubrep_id":"919","scopus_import":1,"day":"06","has_accepted_license":"1","publication":"eLife","citation":{"ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017.","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","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.","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017)."},"date_published":"2017-11-06T00:00:00Z","article_number":"e30867","file_date_updated":"2020-07-14T12:47:10Z","publist_id":"7245","publication_status":"published","publisher":"eLife Sciences Publications","department":[{"_id":"MiSi"}],"year":"2017","date_updated":"2023-02-23T12:30:29Z","date_created":"2018-12-11T11:47:14Z","volume":6,"author":[{"full_name":"Spira, Felix","last_name":"Spira","first_name":"Felix"},{"full_name":"Cuylen Haering, Sara","first_name":"Sara","last_name":"Cuylen Haering"},{"full_name":"Mehta, Shalin","first_name":"Shalin","last_name":"Mehta"},{"full_name":"Samwer, Matthias","first_name":"Matthias","last_name":"Samwer"},{"full_name":"Reversat, Anne","last_name":"Reversat","first_name":"Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Verma, Amitabh","first_name":"Amitabh","last_name":"Verma"},{"last_name":"Oldenbourg","first_name":"Rudolf","full_name":"Oldenbourg, Rudolf"},{"full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gerlich","first_name":"Daniel","full_name":"Gerlich, Daniel"}],"month":"11","publication_identifier":{"issn":["2050084X"]},"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7554/eLife.30867"},{"issue":"12","abstract":[{"lang":"eng","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."}],"type":"journal_article","file":[{"access_level":"open_access","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","content_type":"application/pdf","file_size":920962,"creator":"system","relation":"main_file","file_id":"4718","checksum":"82d51f11e493f7eec02976d9a9a9805e","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:08:55Z"}],"oa_version":"Published Version","pubrep_id":"917","intvolume":" 18","ddc":["580"],"title":"Control of endogenous auxin levels in plant root development","status":"public","_id":"572","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2017-12-01T00:00:00Z","citation":{"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","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.","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.","short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","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.","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."},"publication":"International Journal of Molecular Sciences","publist_id":"7242","file_date_updated":"2020-07-14T12:47:10Z","article_number":"2587","volume":18,"date_created":"2018-12-11T11:47:15Z","date_updated":"2021-01-12T08:03:16Z","author":[{"full_name":"Olatunji, Damilola","first_name":"Damilola","last_name":"Olatunji"},{"full_name":"Geelen, Danny","first_name":"Danny","last_name":"Geelen"},{"full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge"}],"department":[{"_id":"JiFr"}],"publisher":"MDPI","publication_status":"published","year":"2017","month":"12","language":[{"iso":"eng"}],"doi":"10.3390/ijms18122587","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"date_published":"2017-07-14T00:00:00Z","citation":{"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.","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.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004","ieee":"N. Camus et al., “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","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.","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"},"day":"14","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5871","date_updated":"2020-07-14T12:46:00Z","date_created":"2019-01-22T08:34:10Z","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","file_name":"2017_Physics_Camus.pdf","access_level":"open_access","file_size":949321,"content_type":"application/pdf","creator":"dernst"}],"status":"public","title":"Experimental evidence for Wigner's tunneling time","ddc":["530"],"intvolume":" 999","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"313","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."}],"issue":"1","alternative_title":["Journal of Physics: Conference Series"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"Annual International Laser Physics Workshop LPHYS","location":"Kazan, Russian Federation","start_date":"2017-08-17","end_date":"2017-08-21"},"doi":"10.1088/1742-6596/999/1/012004","quality_controlled":"1","external_id":{"arxiv":["1611.03701"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"07","publication_identifier":{"issn":["17426588"]},"date_created":"2018-12-11T11:45:46Z","date_updated":"2023-02-23T12:36:07Z","volume":999,"author":[{"last_name":"Camus","first_name":"Nicolas","full_name":"Camus, Nicolas"},{"full_name":"Yakaboylu, Enderalp","first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"first_name":"Michael","last_name":"Klaiber","full_name":"Klaiber, Michael"},{"first_name":"Martin","last_name":"Laux","full_name":"Laux, Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"first_name":"Karen","last_name":"Hatsagortsyan","full_name":"Hatsagortsyan, Karen"},{"last_name":"Pfeifer","first_name":"Thomas","full_name":"Pfeifer, Thomas"},{"last_name":"Keitel","first_name":"Cristoph","full_name":"Keitel, Cristoph"},{"full_name":"Moshammer, Robert","last_name":"Moshammer","first_name":"Robert"}],"related_material":{"record":[{"id":"6013","status":"public","relation":"later_version"}]},"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","year":"2017","file_date_updated":"2020-07-14T12:46:00Z","publist_id":"7552","article_number":"012004"}]