[{"abstract":[{"lang":"eng","text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally-suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasises that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems."}],"type":"research_data_reference","author":[{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"},{"last_name":"Rafajlović","first_name":"Marina","full_name":"Rafajlović, Marina"},{"last_name":"Chaube","first_name":"Pragya","full_name":"Chaube, Pragya"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"full_name":"Larsson, Tomas","last_name":"Larsson","first_name":"Tomas"},{"first_name":"Marina","last_name":"Panova","full_name":"Panova, Marina"},{"first_name":"Mark","last_name":"Ravinet","full_name":"Ravinet, Mark"},{"full_name":"Blomberg, Anders","first_name":"Anders","last_name":"Blomberg"},{"full_name":"Mehlig, Bernhard","last_name":"Mehlig","first_name":"Bernhard"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"related_material":{"record":[{"id":"9917","relation":"used_in_publication","status":"public"}]},"date_created":"2021-08-17T08:58:47Z","date_updated":"2023-09-19T15:08:24Z","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9930","year":"2018","status":"public","title":"Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow","publisher":"Dryad","department":[{"_id":"BeVi"}],"day":"23","month":"07","article_processing_charge":"No","doi":"10.5061/dryad.bp25b65","date_published":"2018-07-23T00:00:00Z","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.bp25b65"}],"citation":{"ama":"Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. 2018. doi:10.5061/dryad.bp25b65","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow, Dryad, 10.5061/dryad.bp25b65.","ieee":"A. M. Westram et al., “Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65","mla":"Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad, 2018, doi:10.5061/dryad.bp25b65.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).","chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018. https://doi.org/10.5061/dryad.bp25b65."}},{"article_processing_charge":"No","month":"10","day":"17","date_published":"2018-10-17T00:00:00Z","doi":"10.5061/dryad.51sd2p5","oa":1,"citation":{"mla":"Hollander, Johan, et al. Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, (2018).","chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018. https://doi.org/10.5061/dryad.51sd2p5.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.","ieee":"J. Hollander et al., “Data from: Are assortative mating and genital divergence driven by reinforcement?” Dryad, 2018.","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5"},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.51sd2p5","open_access":"1"}],"abstract":[{"text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favour reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence.","lang":"eng"}],"type":"research_data_reference","oa_version":"Published Version","date_updated":"2023-09-19T15:08:53Z","date_created":"2021-08-17T08:51:06Z","related_material":{"record":[{"id":"9915","relation":"used_in_publication","status":"public"}]},"author":[{"full_name":"Hollander, Johan","first_name":"Johan","last_name":"Hollander"},{"first_name":"Mauricio","last_name":"Montaño-Rendón","full_name":"Montaño-Rendón, Mauricio"},{"full_name":"Bianco, Giuseppe","first_name":"Giuseppe","last_name":"Bianco"},{"first_name":"Xi","last_name":"Yang","full_name":"Yang, Xi"},{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"},{"first_name":"Ludovic","last_name":"Duvaux","full_name":"Duvaux, Ludovic"},{"last_name":"Reid","first_name":"David G.","full_name":"Reid, David G."},{"full_name":"Butlin, Roger K.","last_name":"Butlin","first_name":"Roger K."}],"department":[{"_id":"BeVi"}],"publisher":"Dryad","title":"Data from: Are assortative mating and genital divergence driven by reinforcement?","status":"public","_id":"9929","year":"2018","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"author":[{"first_name":"Jasper","last_name":"Uijlings","full_name":"Uijlings, Jasper"},{"full_name":"Konyushkova, Ksenia","last_name":"Konyushkova","first_name":"Ksenia"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}],"date_updated":"2023-09-19T15:11:49Z","date_created":"2022-03-18T12:45:09Z","year":"2018","publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"IEEE","conference":{"name":"CVF: Conference on Computer Vision and Pattern Recognition","end_date":"2018-06-23","start_date":"2018-06-18","location":"Salt Lake City, UT, United States"},"doi":"10.1109/cvpr.2018.00956","language":[{"iso":"eng"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1712.08087","open_access":"1"}],"external_id":{"isi":["000457843609036"],"arxiv":["1712.08087"]},"oa":1,"isi":1,"quality_controlled":"1","month":"12","publication_identifier":{"eissn":["2575-7075"],"isbn":["9781538664209"]},"oa_version":"Preprint","_id":"10882","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Learning intelligent dialogs for bounding box annotation","status":"public","abstract":[{"text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger.","lang":"eng"}],"type":"conference","date_published":"2018-12-17T00:00:00Z","publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","citation":{"ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","apa":"Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956","ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956","chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00956.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184."},"page":"9175-9184","day":"17","article_processing_charge":"No","scopus_import":"1"},{"year":"2018","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"DaAl"}],"publication_status":"published","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Allen-Zhu","first_name":"Zeyuan","full_name":"Allen-Zhu, Zeyuan"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"}],"volume":2018,"date_created":"2019-06-13T08:22:37Z","date_updated":"2023-09-19T15:12:45Z","oa":1,"external_id":{"arxiv":["1803.08917"],"isi":["000461823304061"]},"main_file_link":[{"url":"https://arxiv.org/abs/1803.08917","open_access":"1"}],"isi":1,"quality_controlled":"1","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","location":"Montreal, Canada","start_date":"2018-12-02","end_date":"2018-12-08"},"language":[{"iso":"eng"}],"month":"12","_id":"6558","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2018","title":"Byzantine stochastic gradient descent","status":"public","oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity."}],"citation":{"ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","apa":"Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018."},"publication":"Advances in Neural Information Processing Systems","page":"4613-4623","date_published":"2018-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"oa":1,"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"doi":"10.1145/3230649","language":[{"iso":"eng"}],"article_number":"22","ec_funded":1,"year":"2018","department":[{"_id":"VlKo"}],"publisher":"ACM","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1192"}]},"author":[{"id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda","first_name":"Alexandr","full_name":"Kazda, Alexandr"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"}],"volume":15,"date_created":"2019-02-17T22:59:25Z","date_updated":"2023-09-20T11:20:26Z","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"apa":"Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649."},"publication":"ACM Transactions on Algorithms","article_type":"original","date_published":"2018-12-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6032","intvolume":" 15","status":"public","title":"Even delta-matroids and the complexity of planar boolean CSPs","oa_version":"Preprint"},{"year":"2018","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","author":[{"last_name":"Ringbauer","first_name":"Harald","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","full_name":"Ringbauer, Harald"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"563"},{"status":"public","relation":"part_of_dissertation","id":"1074"}]},"date_updated":"2023-09-20T12:00:56Z","date_created":"2018-12-11T11:45:10Z","file_date_updated":"2020-07-14T12:45:23Z","publist_id":"7713","license":"https://creativecommons.org/licenses/by-nc/4.0/","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"doi":"10.15479/AT:ISTA:th_963","degree_awarded":"PhD","supervisor":[{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"month":"02","publication_identifier":{"issn":["2663-337X"]},"_id":"200","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["576"],"status":"public","title":"Inferring recent demography from spatial genetic structure","pubrep_id":"963","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":5792935,"creator":"system","access_level":"open_access","file_name":"IST-2018-963-v1+1_thesis.pdf","checksum":"8cc534d2b528ae017acf80874cce48c9","date_updated":"2020-07-14T12:45:23Z","date_created":"2018-12-12T10:14:55Z","relation":"main_file","file_id":"5111"},{"file_id":"6224","relation":"source_file","date_created":"2019-04-05T09:30:12Z","date_updated":"2020-07-14T12:45:23Z","checksum":"6af18d7e5a7e2728ceda2f41ee24f628","file_name":"2018_thesis_ringbauer_source.zip","access_level":"closed","creator":"dernst","content_type":"application/zip","file_size":113365}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This thesis is concerned with the inference of current population structure based on geo-referenced genetic data. The underlying idea is that population structure affects its spatial genetic structure. Therefore, genotype information can be utilized to estimate important demographic parameters such as migration rates. These indirect estimates of population structure have become very attractive, as genotype data is now widely available. However, there also has been much concern about these approaches. Importantly, genetic structure can be influenced by many complex patterns, which often cannot be disentangled. Moreover, many methods merely fit heuristic patterns of genetic structure, and do not build upon population genetics theory. Here, I describe two novel inference methods that address these shortcomings. In Chapter 2, I introduce an inference scheme based on a new type of signal, identity by descent (IBD) blocks. Recently, it has become feasible to detect such long blocks of genome shared between pairs of samples. These blocks are direct traces of recent coalescence events. As such, they contain ample signal for inferring recent demography. I examine sharing of IBD blocks in two-dimensional populations with local migration. Using a diffusion approximation, I derive formulas for an isolation by distance pattern of long IBD blocks and show that sharing of long IBD blocks approaches rapid exponential decay for growing sample distance. I describe an inference scheme based on these results. It can robustly estimate the dispersal rate and population density, which is demonstrated on simulated data. I also show an application to estimate mean migration and the rate of recent population growth within Eastern Europe. Chapter 3 is about a novel method to estimate barriers to gene flow in a two dimensional population. This inference scheme utilizes geographically localized allele frequency fluctuations - a classical isolation by distance signal. The strength of these local fluctuations increases on average next to a barrier, and there is less correlation across it. I again use a framework of diffusion of ancestral lineages to model this effect, and provide an efficient numerical implementation to fit the results to geo-referenced biallelic SNP data. This inference scheme is able to robustly estimate strong barriers to gene flow, as tests on simulated data confirm.","lang":"eng"}],"citation":{"chicago":"Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.","mla":"Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.","short":"H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure, Institute of Science and Technology Austria, 2018.","ista":"Ringbauer H. 2018. Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria.","ieee":"H. Ringbauer, “Inferring recent demography from spatial genetic structure,” Institute of Science and Technology Austria, 2018.","apa":"Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963","ama":"Ringbauer H. Inferring recent demography from spatial genetic structure. 2018. doi:10.15479/AT:ISTA:th_963"},"page":"146","date_published":"2018-02-21T00:00:00Z","day":"21","article_processing_charge":"No","has_accepted_license":"1"},{"scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","article_type":"original","page":"1001-1009","publication":"Discrete & Computational Geometry","citation":{"ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009. doi:10.1007/s00454-017-9883-x","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","apa":"Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9883-x","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry 59 (2018) 1001–1009.","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x."},"date_published":"2018-06-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}],"issue":"4","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","ddc":["516","000"],"status":"public","intvolume":" 59","_id":"1064","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"creator":"dernst","file_size":482518,"content_type":"application/pdf","file_name":"2018_DiscreteComp_Akopyan.pdf","access_level":"open_access","date_updated":"2019-01-18T09:27:36Z","date_created":"2019-01-18T09:27:36Z","success":1,"file_id":"5844","relation":"main_file"}],"oa_version":"Published Version","month":"06","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"isi":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"external_id":{"isi":["000432205500011"]},"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.1007/s00454-017-9883-x","file_date_updated":"2019-01-18T09:27:36Z","ec_funded":1,"publist_id":"6324","publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"year":"2018","date_updated":"2023-09-20T12:08:51Z","date_created":"2018-12-11T11:49:57Z","volume":59,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"first_name":"Alexey","last_name":"Balitskiy","full_name":"Balitskiy, Alexey"},{"full_name":"Grigorev, Mikhail","last_name":"Grigorev","first_name":"Mikhail"}]},{"month":"01","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_913","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"},"file_date_updated":"2020-07-14T12:46:24Z","publist_id":"7405","date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-22T09:20:10Z","author":[{"first_name":"Eva","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva"}],"related_material":{"record":[{"id":"1441","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1678"},{"id":"2084","relation":"part_of_dissertation","status":"public"},{"id":"1028","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","department":[{"_id":"HaJa"}],"publisher":"Institute of Science and Technology Austria","year":"2018","day":"08","has_accepted_license":"1","article_processing_charge":"No","date_published":"2018-01-08T00:00:00Z","page":"107","citation":{"mla":"Gschaider-Reichhart, Eva. Optical and Optogenetic Control of Proliferation and Survival . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_913.","short":"E. Gschaider-Reichhart, Optical and Optogenetic Control of Proliferation and Survival , Institute of Science and Technology Austria, 2018.","chicago":"Gschaider-Reichhart, Eva. “Optical and Optogenetic Control of Proliferation and Survival .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_913.","ama":"Gschaider-Reichhart E. Optical and optogenetic control of proliferation and survival . 2018. doi:10.15479/AT:ISTA:th_913","ista":"Gschaider-Reichhart E. 2018. Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria.","ieee":"E. Gschaider-Reichhart, “Optical and optogenetic control of proliferation and survival ,” Institute of Science and Technology Austria, 2018.","apa":"Gschaider-Reichhart, E. (2018). Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_913"},"abstract":[{"lang":"eng","text":"The aim of this thesis was the development of new strategies for optical and optogenetic control of proliferative and pro-survival signaling, and characterizing them from the molecular mechanism up to cellular effects. These new light-based methods have unique features, such as red light as an activator, or the avoidance of gene delivery, which enable to overcome current limitations, such as light delivery to target tissues and feasibility as therapeutic approach. A special focus was placed on implementing these new light-based approaches in pancreatic β-cells, as β-cells are the key players in diabetes and especially their loss in number negatively affects disease progression. Currently no treatment options are available to compensate the lack of functional β-cells in diabetic patients.\r\nIn a first approach, red-light-activated growth factor receptors, in particular receptor tyrosine kinases were engineered and characterized. Receptor activation with light allows spatio-temporal control compared to ligand-based activation, and especially red light exhibits deeper tissue penetration than other wavelengths of the visible spectrum. Red-light-activated receptor tyrosine kinases robustly activated major growth factor related signaling pathways with a high temporal resolution. Moreover, the remote activation of the proliferative MAPK/Erk pathway by red-light-activated receptor tyrosine kinases in a pancreatic β-cell line was also achieved, through one centimeter thick mouse tissue. Although red-light-activated receptor tyrosine kinases are particularly attractive for applications in animal models due to the deep tissue penetration of red light, a drawback, especially with regard to translation into humans, is the requirement of gene therapy.\r\nIn a second approach an endogenous light-sensitive mechanism was identified and its potential to promote proliferative and pro-survival signals was explored, towards light-based tissue regeneration without the need for gene transfer. Blue-green light illumination was found to be sufficient for the activation of proliferation and survival promoting signaling pathways in primary pancreatic murine and human islets. Blue-green light also led to an increase in proliferation of primary islet cells, an effect which was shown to be mostly β-cell specific in human islets. Moreover, it was demonstrated that this approach of pancreatic β-cell expansion did not have any negative effect on the β-cell function, in particular on their insulin secretion capacity. In contrast, a trend for enhanced insulin secretion under high glucose conditions after illumination was detected. In order to unravel the detailed characteristics of this endogenous light-sensitive mechanism, the precise light requirements were determined. In addition, the expression of light sensing proteins, OPN3 and rhodopsin, was detected. The observed effects were found to be independent of handling effects such as temperature differences and cytochrome c oxidase dependent ATP increase, but they were found to be enhanced through the knockout of OPN3. The exact mechanism of how islets cells sense light and the identity of the photoreceptor remains unknown.\r\nSummarized two new light-based systems with unique features were established that enable the activation of proliferative and pro-survival signaling pathways. While red-light-activated receptor tyrosine kinases open a new avenue for optogenetics research, by allowing non-invasive control of signaling in vivo, the identified endogenous light-sensitive mechanism has the potential to be the basis of a gene therapy-free therapeutical approach for light-based β-cell expansion."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"date_created":"2019-04-05T09:28:03Z","date_updated":"2020-07-14T12:46:24Z","checksum":"697fa72ca36fb1b8ceabc133d58a73e5","relation":"source_file","file_id":"6222","file_size":7012495,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"dernst","file_name":"2018_THESIS_Gschaider-Reichhart_source.docx","access_level":"closed"},{"file_name":"2018_THESIS_Gschaider-Reichhart.pdf","access_level":"open_access","creator":"dernst","file_size":6355280,"content_type":"application/pdf","file_id":"6223","relation":"main_file","date_created":"2019-04-05T09:28:03Z","date_updated":"2020-07-14T12:46:24Z","checksum":"58d7d1e9e58aeb7f061ab686b1d8a48c"}],"pubrep_id":"913","ddc":["571","570"],"title":"Optical and optogenetic control of proliferation and survival ","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"418"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"1012","intvolume":" 2018","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","status":"public","oa_version":"Preprint","type":"journal_article","issue":"10","abstract":[{"text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense.","lang":"eng"}],"citation":{"chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.","short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” International Mathematics Research Notices, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","apa":"Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298. doi:10.1093/imrn/rnw330"},"publication":"International Mathematics Research Notices","page":"3255-3298","date_published":"2018-05-18T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"18","year":"2018","department":[{"_id":"LaEr"}],"publisher":"Oxford University Press","publication_status":"published","related_material":{"record":[{"id":"6179","relation":"dissertation_contains","status":"public"}]},"author":[{"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ó"},{"full_name":"Schröder, Dominik J","first_name":"Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856"}],"volume":2018,"date_created":"2018-12-11T11:49:41Z","date_updated":"2023-09-22T09:44:21Z","ec_funded":1,"publist_id":"6383","oa":1,"external_id":{"arxiv":["1608.05163"],"isi":["000441668300009"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.05163"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"isi":1,"quality_controlled":"1","doi":"10.1093/imrn/rnw330","language":[{"iso":"eng"}],"publication_identifier":{"issn":["10737928"]},"month":"05"},{"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","apa":"Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG. https://doi.org/10.3390/g9030039","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI AG, 2018.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. Games. 2018;9(3). doi:10.3390/g9030039","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games. MDPI AG, 2018. https://doi.org/10.3390/g9030039.","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018)."},"publication":"Games","date_published":"2018-09-01T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6006","intvolume":" 9","status":"public","ddc":["004"],"title":"An abstraction-refinement methodology for reasoning about network games","file":[{"access_level":"open_access","file_name":"2018_MDPI_Avni.pdf","content_type":"application/pdf","file_size":505155,"creator":"kschuh","relation":"main_file","file_id":"6008","checksum":"749d65ca4ce74256a029d9644a1b1cb0","date_created":"2019-02-14T14:20:31Z","date_updated":"2020-07-14T12:47:16Z"}],"oa_version":"Published Version","publication_identifier":{"issn":["2073-4336"]},"month":"09","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","doi":"10.3390/g9030039","language":[{"iso":"eng"}],"article_number":"39","file_date_updated":"2020-07-14T12:47:16Z","year":"2018","publisher":"MDPI AG","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"1003","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guha, Shibashis","first_name":"Shibashis","last_name":"Guha"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"volume":9,"date_created":"2019-02-14T14:17:54Z","date_updated":"2023-09-22T09:48:59Z"},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018."},"publication":"28th International Conference on Automated Planning and Scheduling ","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"type":"conference","oa_version":"None","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"35","status":"public","title":"Algorithms and conditional lower bounds for planning problems","month":"06","conference":{"start_date":"2018-06-24","location":"Delft, Netherlands","end_date":"2018-06-29","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000492986200007"],"arxiv":["1804.07031"]},"main_file_link":[{"url":"https://arxiv.org/abs/1804.07031","open_access":"1"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"isi":1,"quality_controlled":"1","ec_funded":1,"publist_id":"8020","related_material":{"record":[{"relation":"later_version","status":"public","id":"9293"}]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"date_created":"2018-12-11T11:44:17Z","date_updated":"2023-09-26T10:41:41Z","year":"2018","department":[{"_id":"KrCh"}],"publisher":"AAAI Press","publication_status":"published"},{"month":"01","isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-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"},"external_id":{"isi":["000419955500006"]},"language":[{"iso":"eng"}],"doi":"10.1007/s11241-017-9293-4","file_date_updated":"2020-07-14T12:47:56Z","ec_funded":1,"publist_id":"6929","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer","year":"2018","date_created":"2018-12-11T11:48:14Z","date_updated":"2023-09-27T12:52:38Z","volume":54,"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"},{"full_name":"Kößler, Alexander","first_name":"Alexander","last_name":"Kößler"},{"first_name":"Ulrich","last_name":"Schmid","full_name":"Schmid, Ulrich"}],"related_material":{"record":[{"id":"2820","status":"public","relation":"earlier_version"}]},"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","page":"166 - 207","publication":"Real-Time Systems","citation":{"ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207."},"date_published":"2018-01-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. "}],"issue":"1","ddc":["000"],"status":"public","title":"Automated competitive analysis of real time scheduling with graph games","intvolume":" 54","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"738","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":1163507,"access_level":"open_access","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","checksum":"c2590ef160709d8054cf29ee173f1454","date_updated":"2020-07-14T12:47:56Z","date_created":"2018-12-12T10:17:14Z","file_id":"5267","relation":"main_file"}],"pubrep_id":"960"},{"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"In this thesis we will discuss systems of point interacting fermions, their stability and other spectral properties. Whereas for bosons a point interacting system is always unstable this ques- tion is more subtle for a gas of two species of fermions. In particular the answer depends on the mass ratio between these two species. Most of this work will be focused on the N + M model which consists of two species of fermions with N, M particles respectively which interact via point interactions. We will introduce this model using a formal limit and discuss the N + 1 system in more detail. In particular, we will show that for mass ratios above a critical one, which does not depend on the particle number, the N + 1 system is stable. In the context of this model we will prove rigorous versions of Tan relations which relate various quantities of the point-interacting model. By restricting the N + 1 system to a box we define a finite density model with point in- teractions. In the context of this system we will discuss the energy change when introducing a point-interacting impurity into a system of non-interacting fermions. We will see that this change in energy is bounded independently of the particle number and in particular the bound only depends on the density and the scattering length. As another special case of the N + M model we will show stability of the 2 + 2 model for mass ratios in an interval around one. Further we will investigate a different model of point interactions which was discussed before in the literature and which is, contrary to the N + M model, not given by a limiting procedure but is based on a Dirichlet form. We will show that this system behaves trivially in the thermodynamic limit, i.e. the free energy per particle is the same as the one of the non-interacting system."}],"title":"Point interactions in systems of fermions","status":"public","ddc":["515","530","519"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"52","file":[{"creator":"dernst","content_type":"application/pdf","file_size":851164,"file_name":"2018_Thesis_Moser.pdf","access_level":"open_access","date_created":"2019-04-09T07:45:38Z","date_updated":"2020-07-14T12:46:37Z","checksum":"fbd8c747d148b468a21213b7cf175225","file_id":"6256","relation":"main_file"},{"access_level":"closed","file_name":"2018_Thesis_Moser_Source.zip","creator":"dernst","content_type":"application/zip","file_size":1531516,"file_id":"6257","relation":"source_file","checksum":"c28e16ecfc1126d3ce324ec96493c01e","date_updated":"2020-07-14T12:46:37Z","date_created":"2019-04-09T07:45:38Z"}],"oa_version":"Published Version","pubrep_id":"1043","day":"04","has_accepted_license":"1","article_processing_charge":"No","page":"115","citation":{"short":"T. Moser, Point Interactions in Systems of Fermions, Institute of Science and Technology Austria, 2018.","mla":"Moser, Thomas. Point Interactions in Systems of Fermions. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1043.","chicago":"Moser, Thomas. “Point Interactions in Systems of Fermions.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1043.","ama":"Moser T. Point interactions in systems of fermions. 2018. doi:10.15479/AT:ISTA:th_1043","ieee":"T. Moser, “Point interactions in systems of fermions,” Institute of Science and Technology Austria, 2018.","apa":"Moser, T. (2018). Point interactions in systems of fermions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1043","ista":"Moser T. 2018. Point interactions in systems of fermions. Institute of Science and Technology Austria."},"date_published":"2018-09-04T00:00:00Z","file_date_updated":"2020-07-14T12:46:37Z","publist_id":"8002","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"RoSe"}],"year":"2018","date_updated":"2023-09-27T12:34:14Z","date_created":"2018-12-11T11:44:22Z","author":[{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Moser","full_name":"Moser, Thomas"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"5856"},{"id":"154","status":"public","relation":"part_of_dissertation"},{"id":"1198","status":"public","relation":"part_of_dissertation"},{"id":"741","relation":"part_of_dissertation","status":"public"}]},"month":"09","publication_identifier":{"issn":["2663-337X"]},"project":[{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"oa":1,"degree_awarded":"PhD","supervisor":[{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_1043"},{"day":"29","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2018-01-29T00:00:00Z","publication":"Journal of Cell Science","citation":{"chicago":"Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer, Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.204198.","mla":"Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science, vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:10.1242/jcs.204198.","short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018).","ista":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. 2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.","apa":"Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L., & Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.204198","ieee":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana,” Journal of Cell Science, vol. 131, no. 2. Company of Biologists, 2018.","ama":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 2018;131(2). doi:10.1242/jcs.204198"},"abstract":[{"lang":"eng","text":"Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis."}],"issue":"2","type":"journal_article","file":[{"date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-12T08:46:32Z","checksum":"bf156c20a4f117b4b932370d54cbac8c","relation":"main_file","file_id":"6299","file_size":14925985,"content_type":"application/pdf","creator":"dernst","file_name":"2017_adamowski_PATELLINS_are.pdf","access_level":"open_access"}],"oa_version":"Published Version","pubrep_id":"988","status":"public","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","ddc":["581"],"intvolume":" 131","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"913","month":"01","publication_identifier":{"issn":["00219533"]},"language":[{"iso":"eng"}],"doi":"10.1242/jcs.204198","quality_controlled":"1","isi":1,"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"oa":1,"external_id":{"isi":["000424842400019"]},"file_date_updated":"2020-07-14T12:48:15Z","publist_id":"6530","ec_funded":1,"article_number":"jcs.204198","date_updated":"2023-09-26T15:47:50Z","date_created":"2018-12-11T11:49:10Z","volume":131,"author":[{"last_name":"Tejos","first_name":"Ricardo","full_name":"Tejos, Ricardo"},{"last_name":"Rodríguez Furlán","first_name":"Cecilia","full_name":"Rodríguez Furlán, Cecilia"},{"full_name":"Adamowski, Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257","first_name":"Maciek","last_name":"Adamowski"},{"last_name":"Sauer","first_name":"Michael","full_name":"Sauer, Michael"},{"full_name":"Norambuena, Lorena","first_name":"Lorena","last_name":"Norambuena"},{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml"}],"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Company of Biologists","year":"2018"},{"page":"103","citation":{"ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047."},"date_published":"2018-09-01T00:00:00Z","day":"01","has_accepted_license":"1","article_processing_charge":"No","ddc":["530","600"],"status":"public","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"69","file":[{"date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","relation":"main_file","file_id":"6247","file_size":28452385,"content_type":"application/pdf","creator":"dernst","file_name":"2018_Thesis_Vukusic.pdf","access_level":"open_access"},{"checksum":"7856771d9cd401fe0b311191076db6e1","date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z","relation":"source_file","file_id":"6248","file_size":53058704,"content_type":"application/zip","creator":"dernst","access_level":"closed","file_name":"2018_Thesis_Vukusic_source.zip"}],"oa_version":"Published Version","pubrep_id":"1047","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires."}],"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,"supervisor":[{"first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:TH_1047","month":"09","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"year":"2018","date_updated":"2023-09-26T15:50:22Z","date_created":"2018-12-11T11:44:28Z","author":[{"first_name":"Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"23"},{"id":"840","relation":"part_of_dissertation","status":"public"}]},"file_date_updated":"2020-07-14T12:47:44Z","publist_id":"7985"},{"month":"03","publication_identifier":{"issn":["2663-337X"]},"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,"degree_awarded":"PhD","supervisor":[{"full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_997","file_date_updated":"2020-07-14T12:46:04Z","publist_id":"7541","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"PeJo"}],"year":"2018","date_updated":"2023-09-27T12:26:03Z","date_created":"2018-12-11T11:45:49Z","author":[{"full_name":"Chen, Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chong"}],"related_material":{"record":[{"id":"1117","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"749"}]},"day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"110","citation":{"ista":"Chen C. 2018. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria.","apa":"Chen, C. (2018). Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_997","ieee":"C. Chen, “Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release,” Institute of Science and Technology Austria, 2018.","ama":"Chen C. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. 2018. doi:10.15479/AT:ISTA:th_997","chicago":"Chen, Chong. “Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_997.","mla":"Chen, Chong. Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_997.","short":"C. Chen, Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release, Institute of Science and Technology Austria, 2018."},"date_published":"2018-03-01T00:00:00Z","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"Neuronal networks in the brain consist of two main types of neuron, glutamatergic principal neurons and GABAergic interneurons. Although these interneurons only represent 10–20% of the whole population, they mediate feedback and feedforward inhibition and are involved in the generation of high-frequency network oscillations. A hallmark functional property of GABAergic interneurons, especially of the parvalbumin‑expressing (PV+) subtypes, is the speed of signaling at their output synapse across species and brain regions. Several molecular and subcellular factors may underlie the submillisecond signaling at GABAergic synapses. Such as the selective use of P/Q type Ca2+ channels and the tight coupling between Ca2+ channels and Ca2+ sensors of exocytosis. However, whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Besides, these interneurons are mainly show depression in response to train of stimuli. How could they keep sufficient release to control the activity of postsynaptic principal neurons during high network activity, is largely elusive. For my Ph.D. work, we firstly examined the Ca2+ sensor of exocytosis at the GABAergic basket cell (BC) to Purkinje cell (PC) synapse in the cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ~10% compared to the wild-type control, identifying Syt2 as the major Ca2+ sensor at BC‑PC synapses. Differential adenovirus-mediated rescue revealed Syt2 triggered release with shorter latency and higher temporal precision, and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as the release sensor at BC–PC synapse ensures fast feedforward inhibition in cerebellar microcircuits. Additionally, we tested the function of another synaptotagmin member, Syt7, for inhibitory synaptic transmission at the BC–PC synapse. Syt7 is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, it is strongly expressed in fast-spiking, PV+ GABAergic interneurons and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. How could Syt7, a facilitation sensor, contribute to the depressed inhibitory synaptic transmission needs to be further investigated and understood. Our results indicated that at the BC–PC synapse, Syt7 contributes to asynchronous release, pool replenishment and facilitation. In combination, these three effects ensure efficient transmitter release during high‑frequency activity and guarantee frequency independence of inhibition. Taken together, our results confirmed that Syt2, which has the fastest kinetic properties among all synaptotagmin members, is mainly used by the inhibitory BC‑PC synapse for synaptic transmission, contributing to the speed and temporal precision of transmitter release. Furthermore, we showed that Syt7, another highly expressed synaptotagmin member in the output synapses of cerebellar BCs, is used for ensuring efficient inhibitor synaptic transmission during high activity.","lang":"eng"}],"ddc":["571"],"status":"public","title":"Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release","_id":"324","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"access_level":"open_access","file_name":"IST-2018-997-v1+1_Thesis_chong_a.pdf","creator":"system","content_type":"application/pdf","file_size":8719458,"file_id":"5046","relation":"main_file","checksum":"8e163ae9e927401b9fa7c1b3e6a3631a","date_updated":"2020-07-14T12:46:04Z","date_created":"2018-12-12T10:13:58Z"},{"checksum":"f7d7260029a5fbb5c982db61328ade52","date_updated":"2020-07-14T12:46:04Z","date_created":"2019-04-05T09:25:26Z","file_id":"6221","relation":"source_file","creator":"dernst","file_size":47841940,"content_type":"application/octet-stream","access_level":"closed","file_name":"2018_Thesis_chong_source.pages"}],"oa_version":"Published Version","pubrep_id":"997"},{"date_published":"2018-08-01T00:00:00Z","publication":"Geometriae Dedicata","citation":{"ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.","apa":"Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.","mla":"Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.","short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317."},"page":"307–317","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","pubrep_id":"912","file":[{"date_updated":"2020-07-14T12:47:58Z","date_created":"2019-01-15T13:44:05Z","checksum":"d2f70fc132156504aa4c626aa378a7ab","relation":"main_file","file_id":"5835","file_size":412486,"content_type":"application/pdf","creator":"kschuh","file_name":"s10711-017-0291-4.pdf","access_level":"open_access"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"742","ddc":["514","516"],"status":"public","title":"On expansion and topological overlap","intvolume":" 195","abstract":[{"text":"We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M.","lang":"eng"}],"issue":"1","type":"journal_article","doi":"10.1007/s10711-017-0291-4","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"},"external_id":{"isi":["000437122700017"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"month":"08","author":[{"last_name":"Dotterrer","first_name":"Dominic","full_name":"Dotterrer, Dominic"},{"full_name":"Kaufman, Tali","first_name":"Tali","last_name":"Kaufman"},{"full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1378"}]},"date_updated":"2023-09-27T12:29:57Z","date_created":"2018-12-11T11:48:16Z","volume":195,"year":"2018","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:47:58Z","publist_id":"6925"},{"author":[{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Nejjar","full_name":"Nejjar, Peter"}],"date_created":"2018-12-11T11:44:28Z","date_updated":"2023-10-10T13:11:29Z","volume":15,"year":"2018","publication_status":"published","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publisher":"Instituto Nacional de Matematica Pura e Aplicada","file_date_updated":"2020-07-14T12:47:46Z","ec_funded":1,"doi":"10.30757/ALEA.v15-49","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"isi":1,"quality_controlled":"1","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"month":"10","publication_identifier":{"issn":["1980-0436"]},"file":[{"access_level":"open_access","file_name":"2018_ALEA_Nejjar.pdf","creator":"kschuh","file_size":394851,"content_type":"application/pdf","file_id":"5981","relation":"main_file","checksum":"2ded46aa284a836a8cbb34133a64f1cb","date_updated":"2020-07-14T12:47:46Z","date_created":"2019-02-14T09:44:10Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"70","status":"public","ddc":["510"],"title":"Transition to shocks in TASEP and decoupling of last passage times","intvolume":" 15","abstract":[{"text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.","lang":"eng"}],"issue":"2","type":"journal_article","date_published":"2018-10-01T00:00:00Z","publication":"Latin American Journal of Probability and Mathematical Statistics","citation":{"ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49.","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49."},"article_type":"original","page":"1311-1334","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"doi":"10.1103/PhysRevB.98.155134","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000447919100001"],"arxiv":["1806.10933"]},"main_file_link":[{"url":"https://arxiv.org/abs/1806.10933","open_access":"1"}],"oa":1,"quality_controlled":"1","isi":1,"month":"10","author":[{"full_name":"Turner, C J","last_name":"Turner","first_name":"C J"},{"full_name":"Michailidis, Alexios","first_name":"Alexios","last_name":"Michailidis","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8443-1064"},{"full_name":"Abanin, D A","last_name":"Abanin","first_name":"D A"},{"first_name":"Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"},{"full_name":"Papić, Z","first_name":"Z","last_name":"Papić"}],"date_updated":"2023-10-10T13:28:49Z","date_created":"2018-12-11T11:44:19Z","volume":98,"year":"2018","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MaSe"}],"publist_id":"8010","article_number":"155134","date_published":"2018-10-22T00:00:00Z","publication":"Physical Review B","citation":{"chicago":"Turner, C J, Alexios Michailidis, D A Abanin, Maksym Serbyn, and Z Papić. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.155134.","short":"C.J. Turner, A. Michailidis, D.A. Abanin, M. Serbyn, Z. Papić, Physical Review B 98 (2018).","mla":"Turner, C. J., et al. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B, vol. 98, no. 15, 155134, American Physical Society, 2018, doi:10.1103/PhysRevB.98.155134.","apa":"Turner, C. J., Michailidis, A., Abanin, D. A., Serbyn, M., & Papić, Z. (2018). Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.98.155134","ieee":"C. J. Turner, A. Michailidis, D. A. Abanin, M. Serbyn, and Z. Papić, “Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations,” Physical Review B, vol. 98, no. 15. American Physical Society, 2018.","ista":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. 2018. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 98(15), 155134.","ama":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 2018;98(15). doi:10.1103/PhysRevB.98.155134"},"day":"22","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"44","title":"Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations","status":"public","intvolume":" 98","abstract":[{"lang":"eng","text":"Recent realization of a kinetically constrained chain of Rydberg atoms by Bernien et al., [Nature (London) 551, 579 (2017)] resulted in the observation of unusual revivals in the many-body quantum dynamics. In our previous work [C. J. Turner et al., Nat. Phys. 14, 745 (2018)], such dynamics was attributed to the existence of “quantum scarred” eigenstates in the many-body spectrum of the experimentally realized model. Here, we present a detailed study of the eigenstate properties of the same model. We find that the majority of the eigenstates exhibit anomalous thermalization: the observable expectation values converge to their Gibbs ensemble values, but parametrically slower compared to the predictions of the eigenstate thermalization hypothesis (ETH). Amidst the thermalizing spectrum, we identify nonergodic eigenstates that strongly violate the ETH, whose number grows polynomially with system size. Previously, the same eigenstates were identified via large overlaps with certain product states, and were used to explain the revivals observed in experiment. Here, we find that these eigenstates, in addition to highly atypical expectation values of local observables, also exhibit subthermal entanglement entropy that scales logarithmically with the system size. Moreover, we identify an additional class of quantum scarred eigenstates, and discuss their manifestations in the dynamics starting from initial product states. We use forward scattering approximation to describe the structure and physical properties of quantum scarred eigenstates. Finally, we discuss the stability of quantum scars to various perturbations. We observe that quantum scars remain robust when the introduced perturbation is compatible with the forward scattering approximation. In contrast, the perturbations which most efficiently destroy quantum scars also lead to the restoration of “canonical” thermalization."}],"issue":"15","type":"journal_article"},{"department":[{"_id":"BjHo"}],"publisher":"American Physical Society","publication_status":"published","year":"2018","acknowledgement":"The authors thank Philipp Maier and the IST Austria workshop for their dedicated technical support.","volume":120,"date_created":"2018-12-11T11:45:51Z","date_updated":"2023-10-10T13:27:44Z","author":[{"full_name":"Choueiri, George H","first_name":"George H","last_name":"Choueiri","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lopez Alonso, Jose M","id":"40770848-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0384-2022","first_name":"Jose M","last_name":"Lopez Alonso"},{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"}],"article_number":"124501","publist_id":"7537","ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"}],"isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1703.06271","open_access":"1"}],"oa":1,"external_id":{"isi":["000427804000005"]},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.1103/PhysRevLett.120.124501","month":"03","intvolume":" 120","title":"Exceeding the asymptotic limit of polymer drag reduction","status":"public","_id":"328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"12","abstract":[{"text":"The drag of turbulent flows can be drastically decreased by adding small amounts of high molecular weight polymers. While drag reduction initially increases with polymer concentration, it eventually saturates to what is known as the maximum drag reduction (MDR) asymptote; this asymptote is generally attributed to the dynamics being reduced to a marginal yet persistent state of subdued turbulent motion. Contrary to this accepted view, we show that, for an appropriate choice of parameters, polymers can reduce the drag beyond the suggested asymptotic limit, eliminating turbulence and giving way to laminar flow. At higher polymer concentrations, however, the laminar state becomes unstable, resulting in a fluctuating flow with the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic state is hence dynamically disconnected from ordinary turbulence. © 2018 American Physical Society.","lang":"eng"}],"citation":{"ama":"Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 2018;120(12). doi:10.1103/PhysRevLett.120.124501","ista":"Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 120(12), 124501.","ieee":"G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic limit of polymer drag reduction,” Physical Review Letters, vol. 120, no. 12. American Physical Society, 2018.","apa":"Choueiri, G. H., Lopez Alonso, J. M., & Hof, B. (2018). Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.120.124501","mla":"Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters, vol. 120, no. 12, 124501, American Physical Society, 2018, doi:10.1103/PhysRevLett.120.124501.","short":"G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).","chicago":"Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.124501."},"publication":"Physical Review Letters","date_published":"2018-03-19T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"19"}]