[{"external_id":{"isi":["000348759300007"]},"department":[{"_id":"RoSe"}],"publication_status":"published","doi":"10.1088/1367-2630/17/1/013022","abstract":[{"text":"We investigate the relation between Bose-Einstein condensation (BEC) and superfluidity in the ground state of a one-dimensional model of interacting bosons in a strong random potential. We prove rigorously that in a certain parameter regime the superfluid fraction can be arbitrarily small while complete BEC prevails. In another regime there is both complete BEC and complete superfluidity, despite the strong disorder","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:20Z","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:20Z","file_size":768108,"file_name":"IST-2016-447-v1+1_document_1_.pdf","creator":"system","date_created":"2018-12-12T10:12:44Z","content_type":"application/pdf","file_id":"4963","checksum":"38fdf2b5ac30445e26a5d613abd84b16","relation":"main_file"}],"intvolume":"        17","publication":"New Journal of Physics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:30Z","year":"2015","publist_id":"5214","ddc":["530"],"project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"date_published":"2015-01-15T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"volume":17,"date_updated":"2025-09-23T10:51:00Z","title":"Superfluid behavior of a Bose-Einstein condensate in a random potential","isi":1,"acknowledgement":"Support from the Natural Sciences and Engineering Research Council of Canada NSERC (MK and RS) and from the Austrian Science Fund FWF (JY, under project P 22929-N16) is gratefully acknowledged","scopus_import":"1","oa_version":"Published Version","pubrep_id":"447","has_accepted_license":"1","citation":{"mla":"Könenberg, Martin, et al. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” <i>New Journal of Physics</i>, vol. 17, 013022, IOP Publishing, 2015, doi:<a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">10.1088/1367-2630/17/1/013022</a>.","chicago":"Könenberg, Martin, Thomas Moser, Robert Seiringer, and Jakob Yngvason. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” <i>New Journal of Physics</i>. IOP Publishing, 2015. <a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">https://doi.org/10.1088/1367-2630/17/1/013022</a>.","ama":"Könenberg M, Moser T, Seiringer R, Yngvason J. Superfluid behavior of a Bose-Einstein condensate in a random potential. <i>New Journal of Physics</i>. 2015;17. doi:<a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">10.1088/1367-2630/17/1/013022</a>","ieee":"M. Könenberg, T. Moser, R. Seiringer, and J. Yngvason, “Superfluid behavior of a Bose-Einstein condensate in a random potential,” <i>New Journal of Physics</i>, vol. 17. IOP Publishing, 2015.","short":"M. Könenberg, T. Moser, R. Seiringer, J. Yngvason, New Journal of Physics 17 (2015).","ista":"Könenberg M, Moser T, Seiringer R, Yngvason J. 2015. Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. 17, 013022.","apa":"Könenberg, M., Moser, T., Seiringer, R., &#38; Yngvason, J. (2015). Superfluid behavior of a Bose-Einstein condensate in a random potential. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">https://doi.org/10.1088/1367-2630/17/1/013022</a>"},"status":"public","type":"journal_article","day":"15","article_number":"013022","publisher":"IOP Publishing","month":"01","quality_controlled":"1","_id":"1880","article_processing_charge":"No","author":[{"last_name":"Könenberg","full_name":"Könenberg, Martin","first_name":"Martin"},{"last_name":"Moser","full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"license":"https://creativecommons.org/licenses/by/4.0/","oa":1,"language":[{"iso":"eng"}]},{"intvolume":"      8997","publication_status":"published","external_id":{"arxiv":["1408.1256"]},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ec_funded":1,"abstract":[{"text":"We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations.","lang":"eng"}],"alternative_title":["LNCS"],"doi":"10.1007/978-3-319-15317-9_19","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"date_published":"2015-01-30T00:00:00Z","volume":8997,"date_updated":"2025-06-11T07:22:00Z","conference":{"location":"Bertinoro, Italy","start_date":"2014-09-10","end_date":"2014-09-12","name":"FACS: Formal Aspects of Component Software"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publist_id":"5216","main_file_link":[{"url":"http://arxiv.org/abs/1408.1256","open_access":"1"}],"date_created":"2018-12-11T11:54:31Z","citation":{"mla":"Fahrenberg, Uli, et al. <i>Compositionality for Quantitative Specifications</i>. Vol. 8997, Springer, 2015, pp. 306–24, doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>.","chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>.","ista":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324.","apa":"Fahrenberg, U., Kretinsky, J., Legay, A., &#38; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.","ieee":"U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>"},"arxiv":1,"title":"Compositionality for quantitative specifications","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.","scopus_import":"1","oa_version":"Preprint","article_processing_charge":"No","corr_author":"1","_id":"1882","oa":1,"language":[{"iso":"eng"}],"author":[{"last_name":"Fahrenberg","full_name":"Fahrenberg, Uli","first_name":"Uli"},{"first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"},{"last_name":"Traonouez","full_name":"Traonouez, Louis","first_name":"Louis"}],"type":"conference","day":"30","page":"306 - 324","status":"public","quality_controlled":"1","month":"01","publisher":"Springer"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1012.3298"}],"date_created":"2018-12-11T11:54:31Z","year":"2015","publist_id":"5213","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":91,"date_updated":"2025-09-23T07:53:52Z","date_published":"2015-02-02T00:00:00Z","doi":"10.1103/PhysRevE.91.022803","abstract":[{"lang":"eng","text":"We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age τ as τ-α. Depending on the exponent α, the scaling of tree depth with tree size n displays a transition between the logarithmic scaling of random trees and an algebraic growth. At the transition (α=1) tree depth grows as (logn)2. This anomalous scaling is in good agreement with the trend observed in evolution of biological species, thus providing a theoretical support for age-dependent speciation and associating it to the occurrence of a critical point.\r\n"}],"external_id":{"isi":["000349860900006"],"arxiv":["1012.3298"]},"department":[{"_id":"NiBa"}],"publication_status":"published","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","intvolume":"        91","article_number":"022803","publisher":"American Institute of Physics","month":"02","quality_controlled":"1","status":"public","type":"journal_article","day":"02","author":[{"first_name":"Stephanie","last_name":"Keller-Schmidt","full_name":"Keller-Schmidt, Stephanie"},{"id":"37C323C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8523-0758","full_name":"Tugrul, Murat","last_name":"Tugrul","first_name":"Murat"},{"full_name":"Eguíluz, Víctor","last_name":"Eguíluz","first_name":"Víctor"},{"first_name":"Emilio","last_name":"Hernandez Garcia","full_name":"Hernandez Garcia, Emilio"},{"full_name":"Klemm, Konstantin","last_name":"Klemm","first_name":"Konstantin"}],"oa":1,"language":[{"iso":"eng"}],"_id":"1883","issue":"2","article_processing_charge":"No","article_type":"original","isi":1,"scopus_import":"1","oa_version":"Preprint","title":"Anomalous scaling in an age-dependent branching model","citation":{"mla":"Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching Model.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 2, 022803, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">10.1103/PhysRevE.91.022803</a>.","chicago":"Keller-Schmidt, Stephanie, Murat Tugrul, Víctor Eguíluz, Emilio Hernandez Garcia, and Konstantin Klemm. “Anomalous Scaling in an Age-Dependent Branching Model.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">https://doi.org/10.1103/PhysRevE.91.022803</a>.","short":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, K. Klemm, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","ama":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. Anomalous scaling in an age-dependent branching model. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2015;91(2). doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">10.1103/PhysRevE.91.022803</a>","ieee":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, and K. Klemm, “Anomalous scaling in an age-dependent branching model,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 2. American Institute of Physics, 2015.","apa":"Keller-Schmidt, S., Tugrul, M., Eguíluz, V., Hernandez Garcia, E., &#38; Klemm, K. (2015). Anomalous scaling in an age-dependent branching model. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">https://doi.org/10.1103/PhysRevE.91.022803</a>","ista":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. 2015. Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(2), 022803."},"arxiv":1},{"abstract":[{"lang":"eng","text":"The concept of positional information is central to our understanding of how cells determine their location in a multicellular structure and thereby their developmental fates. Nevertheless, positional information has neither been defined mathematically nor quantified in a principled way. Here we provide an information-theoretic definition in the context of developmental gene expression patterns and examine the features of expression patterns that affect positional information quantitatively. We connect positional information with the concept of positional error and develop tools to directly measure information and error from experimental data. We illustrate our framework for the case of gap gene expression patterns in the early Drosophila embryo and show how information that is distributed among only four genes is sufficient to determine developmental fates with nearly single-cell resolution. Our approach can be generalized to a variety of different model systems; procedures and examples are discussed in detail. "}],"doi":"10.1534/genetics.114.171850","publication_status":"published","department":[{"_id":"GaTk"}],"external_id":{"isi":["000347712900004"],"arxiv":["1404.5599"]},"publication":"Genetics","intvolume":"       199","publist_id":"5210","year":"2015","date_created":"2018-12-11T11:54:32Z","main_file_link":[{"url":"http://arxiv.org/abs/1404.5599","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:53:07Z","volume":199,"date_published":"2015-01-01T00:00:00Z","scopus_import":"1","oa_version":"Preprint","isi":1,"title":"Positional information, positional error, and readout precision in morphogenesis: A mathematical framework","arxiv":1,"citation":{"ieee":"G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information, positional error, and readout precision in morphogenesis: A mathematical framework,” <i>Genetics</i>, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.","ama":"Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. 2015;199(1):39-59. doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>","short":"G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59.","ista":"Tkačik G, Dubuis J, Petkova M, Gregor T. 2015. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 199(1), 39–59.","apa":"Tkačik, G., Dubuis, J., Petkova, M., &#38; Gregor, T. (2015). Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>","chicago":"Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>. Genetics Society of America, 2015. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>.","mla":"Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>, vol. 199, no. 1, Genetics Society of America, 2015, pp. 39–59, doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>."},"quality_controlled":"1","month":"01","publisher":"Genetics Society of America","day":"01","type":"journal_article","status":"public","page":"39 - 59","language":[{"iso":"eng"}],"oa":1,"author":[{"first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Julien","last_name":"Dubuis","full_name":"Dubuis, Julien"},{"first_name":"Mariela","full_name":"Petkova, Mariela","last_name":"Petkova"},{"first_name":"Thomas","last_name":"Gregor","full_name":"Gregor, Thomas"}],"article_processing_charge":"No","_id":"1885","corr_author":"1","issue":"1"},{"doi":"10.1016/j.physleta.2014.12.010","abstract":[{"lang":"eng","text":"We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2."}],"department":[{"_id":"HeEd"}],"external_id":{"isi":["000349586000006"]},"publication_status":"published","intvolume":"       379","publication":"Physics Letters, Section A","date_created":"2018-12-11T11:54:49Z","publist_id":"5152","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:44:12Z","volume":379,"date_published":"2015-03-06T00:00:00Z","isi":1,"acknowledgement":"F.P. was supported by the Graduate School of IST Austria. S.S. was partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and Michael Kerber for sharing their implementation of the persistence algorithm. ","scopus_import":"1","oa_version":"None","title":"On the distribution of local extrema in quantum chaos","citation":{"ieee":"F. Pausinger and S. Steinerberger, “On the distribution of local extrema in quantum chaos,” <i>Physics Letters, Section A</i>, vol. 379, no. 6. Elsevier, pp. 535–541, 2015.","ama":"Pausinger F, Steinerberger S. On the distribution of local extrema in quantum chaos. <i>Physics Letters, Section A</i>. 2015;379(6):535-541. doi:<a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">10.1016/j.physleta.2014.12.010</a>","short":"F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.","apa":"Pausinger, F., &#38; Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. <i>Physics Letters, Section A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">https://doi.org/10.1016/j.physleta.2014.12.010</a>","ista":"Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">https://doi.org/10.1016/j.physleta.2014.12.010</a>.","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>, vol. 379, no. 6, Elsevier, 2015, pp. 535–41, doi:<a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">10.1016/j.physleta.2014.12.010</a>."},"publisher":"Elsevier","quality_controlled":"1","month":"03","status":"public","page":"535 - 541","day":"06","type":"journal_article","author":[{"first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768"},{"first_name":"Stefan","last_name":"Steinerberger","full_name":"Steinerberger, Stefan"}],"language":[{"iso":"eng"}],"issue":"6","_id":"1938","corr_author":"1","article_processing_charge":"No"},{"doi":"10.1103/PhysRevE.91.062710","abstract":[{"text":"We typically think of cells as responding to external signals independently by regulating their gene expression levels, yet they often locally exchange information and coordinate. Can such spatial coupling be of benefit for conveying signals subject to gene regulatory noise? Here we extend our information-theoretic framework for gene regulation to spatially extended systems. As an example, we consider a lattice of nuclei responding to a concentration field of a transcriptional regulator (the &quot;input&quot;) by expressing a single diffusible target gene. When input concentrations are low, diffusive coupling markedly improves information transmission; optimal gene activation functions also systematically change. A qualitatively new regulatory strategy emerges where individual cells respond to the input in a nearly step-like fashion that is subsequently averaged out by strong diffusion. While motivated by early patterning events in the Drosophila embryo, our framework is generically applicable to spatially coupled stochastic gene expression models.","lang":"eng"}],"department":[{"_id":"GaTk"}],"external_id":{"isi":["000356131600006"],"arxiv":["1501.04015"]},"publication_status":"published","intvolume":"        91","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","date_created":"2018-12-11T11:54:49Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04015"}],"publist_id":"5145","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:46:10Z","volume":91,"date_published":"2015-06-15T00:00:00Z","isi":1,"scopus_import":"1","oa_version":"Preprint","title":"Optimizing information flow in small genetic networks. IV. Spatial coupling","arxiv":1,"citation":{"chicago":"Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>.","mla":"Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6, 062710, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>.","ieee":"T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic networks. IV. Spatial coupling,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6. American Institute of Physics, 2015.","ama":"Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2015;91(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>","short":"T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","apa":"Sokolowski, T. R., &#38; Tkačik, G. (2015). Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>","ista":"Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(6), 062710."},"article_number":"062710","publisher":"American Institute of Physics","quality_controlled":"1","month":"06","status":"public","day":"15","type":"journal_article","author":[{"id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski","orcid":"0000-0002-1287-3779","full_name":"Sokolowski, Thomas R","first_name":"Thomas R"},{"first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"language":[{"iso":"eng"}],"_id":"1940","corr_author":"1","issue":"6","article_processing_charge":"No"},{"issue":"2","_id":"1944","corr_author":"1","article_processing_charge":"No","author":[{"first_name":"Hana","full_name":"Rakusová, Hana","last_name":"Rakusová"},{"first_name":"Matyas","last_name":"Fendrych","full_name":"Fendrych, Matyas","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"}],"language":[{"iso":"eng"}],"page":"116 - 123","status":"public","type":"journal_article","day":"01","publisher":"Elsevier","quality_controlled":"1","month":"02","citation":{"ieee":"H. Rakusová, M. Fendrych, and J. Friml, “Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants,” <i>Current Opinion in Plant Biology</i>, vol. 23, no. 2. Elsevier, pp. 116–123, 2015.","ama":"Rakusová H, Fendrych M, Friml J. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. <i>Current Opinion in Plant Biology</i>. 2015;23(2):116-123. doi:<a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">10.1016/j.pbi.2014.12.002</a>","short":"H. Rakusová, M. Fendrych, J. Friml, Current Opinion in Plant Biology 23 (2015) 116–123.","apa":"Rakusová, H., Fendrych, M., &#38; Friml, J. (2015). Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">https://doi.org/10.1016/j.pbi.2014.12.002</a>","ista":"Rakusová H, Fendrych M, Friml J. 2015. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 23(2), 116–123.","chicago":"Rakusová, Hana, Matyas Fendrych, and Jiří Friml. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">https://doi.org/10.1016/j.pbi.2014.12.002</a>.","mla":"Rakusová, Hana, et al. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” <i>Current Opinion in Plant Biology</i>, vol. 23, no. 2, Elsevier, 2015, pp. 116–23, doi:<a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">10.1016/j.pbi.2014.12.002</a>."},"title":"Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants","isi":1,"scopus_import":"1","oa_version":"None","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP); the Agency for Innovation by Science and Technology (IWT) (predoctoral fellowship to H.R.); and the People Programme (Marie Curie Actions) of the European Union","project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"date_published":"2015-02-01T00:00:00Z","volume":23,"date_updated":"2025-09-23T09:23:09Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:51Z","year":"2015","publist_id":"5140","intvolume":"        23","publication":"Current Opinion in Plant Biology","external_id":{"isi":["000349880900017"]},"department":[{"_id":"JiFr"}],"publication_status":"published","doi":"10.1016/j.pbi.2014.12.002","ec_funded":1},{"file_date_updated":"2020-07-14T12:46:35Z","intvolume":"         2","file":[{"file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","date_updated":"2020-07-14T12:46:35Z","file_size":1084254,"access_level":"open_access","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:12:53Z","relation":"main_file","checksum":"a40eb4016717ddc9927154798a4c164a","file_id":"4974"}],"publication":"Journal de l'Ecole Polytechnique - Mathematiques","department":[{"_id":"RoSe"}],"publication_status":"published","doi":"10.5802/jep.18","abstract":[{"lang":"eng","text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2."}],"ec_funded":1,"date_published":"2015-01-01T00:00:00Z","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ddc":["539"],"date_updated":"2021-01-12T08:00:52Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"volume":2,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:40Z","publist_id":"7344","year":"2015","has_accepted_license":"1","pubrep_id":"951","citation":{"apa":"Lewin, M., Nam, P., &#38; Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2015;2:65-115. doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>.","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2015. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>."},"title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","oa_version":"Published Version","scopus_import":1,"_id":"473","license":"https://creativecommons.org/licenses/by-nd/4.0/","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan Thanh","full_name":"Phan Thanh, Nam","first_name":"Nam"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"oa":1,"language":[{"iso":"eng"}],"page":"65 - 115","status":"public","day":"01","type":"journal_article","publisher":"Ecole Polytechnique","quality_controlled":"1","month":"01"},{"_id":"477","issue":"15","article_processing_charge":"No","author":[{"full_name":"Holst, Katrin","last_name":"Holst","first_name":"Katrin"},{"first_name":"Daria","last_name":"Guseva","full_name":"Guseva, Daria"},{"first_name":"Susann","last_name":"Schindler","full_name":"Schindler, Susann"},{"first_name":"Michael K","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Braun, Armin","last_name":"Braun","first_name":"Armin"},{"first_name":"Himpriya","last_name":"Chopra","full_name":"Chopra, Himpriya"},{"last_name":"Pabst","full_name":"Pabst, Oliver","first_name":"Oliver"},{"first_name":"Evgeni","full_name":"Ponimaskin, Evgeni","last_name":"Ponimaskin"}],"language":[{"iso":"eng"}],"page":"2866 - 2880","status":"public","type":"journal_article","day":"15","publisher":"Company of Biologists","month":"06","quality_controlled":"1","citation":{"mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>.","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>.","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>","ieee":"K. Holst <i>et al.</i>, “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” <i>Journal of Cell Science</i>, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. 2015;128(15):2866-2880. doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>"},"title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","isi":1,"oa_version":"None","scopus_import":"1","date_published":"2015-06-15T00:00:00Z","volume":128,"date_updated":"2025-09-23T14:16:38Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:46:41Z","year":"2015","publist_id":"7343","publication":"Journal of Cell Science","intvolume":"       128","external_id":{"isi":["000359782100013"]},"department":[{"_id":"MiSi"}],"publication_status":"published","doi":"10.1242/jcs.167999","abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}]},{"title":"Looking at mean-payoff and total-payoff through windows","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2279"}]},"oa_version":"Preprint","scopus_import":"1","isi":1,"arxiv":1,"citation":{"short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. 2015;242(6):25-52. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>.","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>."},"day":"24","type":"journal_article","page":"25 - 52","status":"public","month":"03","quality_controlled":"1","publisher":"Elsevier","article_processing_charge":"No","_id":"523","issue":"6","oa":1,"language":[{"iso":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"publication_status":"published","department":[{"_id":"KrCh"}],"external_id":{"isi":["000355664900003"],"arxiv":["1302.4248"]},"abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"ec_funded":1,"doi":"10.1016/j.ic.2015.03.010","publication":"Information and Computation","intvolume":"       242","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"7296","year":"2015","date_created":"2018-12-11T11:46:57Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.4248"}],"date_published":"2015-03-24T00:00:00Z","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_updated":"2025-09-23T09:29:55Z","volume":242},{"date_updated":"2025-09-23T09:56:28Z","volume":242,"date_published":"2015-10-11T00:00:00Z","date_created":"2018-12-11T11:46:57Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.5306"}],"publist_id":"7295","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"       242","publication":"Information and Computation","doi":"10.1016/j.ic.2015.03.009","abstract":[{"text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time.","lang":"eng"}],"department":[{"_id":"KrCh"}],"external_id":{"isi":["000355664900002"],"arxiv":["1409.5306"]},"publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"language":[{"iso":"eng"}],"oa":1,"issue":"6","_id":"524","corr_author":"1","article_processing_charge":"No","publisher":"Elsevier","quality_controlled":"1","month":"10","status":"public","page":"2 - 24","day":"11","type":"journal_article","arxiv":1,"citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. 2015;242(6):2-24. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 2–24, 2015."},"isi":1,"scopus_import":"1","oa_version":"Preprint","related_material":{"record":[{"id":"5403","status":"public","relation":"earlier_version"}]},"title":"Qualitative analysis of concurrent mean payoff games"},{"citation":{"short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. 2015;163(3):670-683. doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>","ieee":"W. Li <i>et al.</i>, “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” <i>Cell</i>, vol. 163, no. 3. Cell Press, pp. 670–683, 2015.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>.","chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>."},"title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","isi":1,"oa_version":"None","scopus_import":"1","_id":"532","issue":"3","article_processing_charge":"No","author":[{"last_name":"Li","full_name":"Li, Wenyang","first_name":"Wenyang"},{"full_name":"Ma, Mengdi","last_name":"Ma","first_name":"Mengdi"},{"first_name":"Ying","last_name":"Feng","full_name":"Feng, Ying"},{"id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","last_name":"Li","orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","first_name":"Hongjiang"},{"last_name":"Wang","full_name":"Wang, Yichuan","first_name":"Yichuan"},{"full_name":"Ma, Yutong","last_name":"Ma","first_name":"Yutong"},{"first_name":"Mingzhe","last_name":"Li","full_name":"Li, Mingzhe"},{"first_name":"Fengying","full_name":"An, Fengying","last_name":"An"},{"full_name":"Guo, Hongwei","last_name":"Guo","first_name":"Hongwei"}],"language":[{"iso":"eng"}],"status":"public","page":"670 - 683","day":"22","type":"journal_article","publisher":"Cell Press","quality_controlled":"1","month":"10","intvolume":"       163","publication":"Cell","department":[{"_id":"JiFr"}],"external_id":{"isi":["000364828900020"]},"publication_status":"published","doi":"10.1016/j.cell.2015.09.037","abstract":[{"text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.","lang":"eng"}],"date_published":"2015-10-22T00:00:00Z","date_updated":"2025-09-23T08:40:43Z","volume":163,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:47:00Z","publist_id":"7285","year":"2015"},{"doi":"10.15479/AT:IST-2015-319-v1-1","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"department":[{"_id":"KrCh"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"5437"},{"status":"public","relation":"later_version","id":"1607"}]},"title":"Faster algorithms for quantitative verification in constant treewidth graphs","publication_status":"published","pubrep_id":"319","has_accepted_license":"1","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>."},"file":[{"creator":"system","date_updated":"2020-07-14T12:46:52Z","file_name":"IST-2015-319-v1+1_long.pdf","file_size":1089651,"access_level":"open_access","relation":"main_file","file_id":"5482","checksum":"62c6ea01e342553dcafb88a070fb1ad5","content_type":"application/pdf","date_created":"2018-12-12T11:53:21Z"}],"file_date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:39:17Z","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","month":"02","year":"2015","status":"public","page":"31","day":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"date_updated":"2025-09-23T08:47:23Z","oa":1,"language":[{"iso":"eng"}],"_id":"5430","date_published":"2015-02-10T00:00:00Z","ddc":["000"]},{"doi":"10.15479/AT:IST-2015-322-v1-1","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"department":[{"_id":"KrCh"}],"publication_status":"published","title":"The patience of concurrent stochastic games with safety and reachability objectives","pubrep_id":"322","has_accepted_license":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>"},"file":[{"date_updated":"2020-07-14T12:46:53Z","file_size":661015,"file_name":"IST-2015-322-v1+1_safetygames.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T11:53:31Z","relation":"main_file","checksum":"bfb858262c30445b8e472c40069178a2","file_id":"5491"}],"file_date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:39:17Z","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"month":"02","year":"2015","status":"public","page":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","type":"technical_report","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Kristoffer","full_name":"Hansen, Kristoffer","last_name":"Hansen"}],"date_updated":"2021-01-12T08:02:13Z","language":[{"iso":"eng"}],"oa":1,"_id":"5431","date_published":"2015-02-19T00:00:00Z","ddc":["005","519"]},{"abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2015-323-v1-1","publication_status":"published","related_material":{"record":[{"id":"5421","status":"public","relation":"earlier_version"},{"id":"5440","relation":"later_version","status":"public"}]},"title":"The complexity of evolutionary games on graphs","department":[{"_id":"KrCh"}],"file":[{"date_created":"2018-12-12T11:53:57Z","content_type":"application/pdf","file_id":"5519","checksum":"546c1b291d545e7b24aaaf4199dac671","relation":"main_file","access_level":"open_access","file_name":"IST-2015-323-v1+1_main.pdf","date_updated":"2020-07-14T12:46:53Z","file_size":576347,"creator":"system"}],"citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>."},"pubrep_id":"323","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:53Z","year":"2015","month":"02","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","date_created":"2018-12-12T11:39:18Z","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","page":"29","status":"public","language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-02-23T12:26:33Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"ddc":["005","576"],"date_published":"2015-02-19T00:00:00Z","_id":"5432"},{"author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"}],"date_updated":"2020-07-14T23:04:59Z","oa":1,"language":[{"iso":"eng"}],"_id":"5434","date_published":"2015-02-19T00:00:00Z","ddc":["000"],"date_created":"2018-12-12T11:39:18Z","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"month":"02","year":"2015","status":"public","page":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","type":"technical_report","pubrep_id":"326","has_accepted_license":"1","file":[{"date_created":"2018-12-12T11:53:14Z","content_type":"application/pdf","file_id":"5475","checksum":"8542fd0b10aed7811cd41077b8ccb632","relation":"main_file","access_level":"open_access","file_size":378162,"date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-326-v1+1_main.pdf","creator":"system"},{"file_name":"IST-2015-326-v1+2_authors.txt","date_updated":"2020-07-14T12:46:53Z","file_size":64,"access_level":"closed","creator":"dernst","content_type":"text/plain","date_created":"2019-04-16T13:00:33Z","relation":"main_file","checksum":"84c31c537bdaf7a91909f18d25d640ab","file_id":"6317"}],"citation":{"mla":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","chicago":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria; 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.","ieee":"1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria, 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","apa":"Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria."},"file_date_updated":"2020-07-14T12:46:53Z","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results."}],"title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","publication_status":"published"},{"type":"technical_report","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","page":"27","year":"2015","month":"04","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:19Z","ddc":["000"],"date_published":"2015-04-27T00:00:00Z","_id":"5437","language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-09-23T08:47:23Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"publication_status":"published","related_material":{"record":[{"id":"5430","relation":"earlier_version","status":"public"},{"status":"public","relation":"later_version","id":"1607"}]},"title":"Faster algorithms for quantitative verification in constant treewidth graphs","department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2015-330-v2-1","file_date_updated":"2020-07-14T12:46:54Z","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>"},"file":[{"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:54Z","file_size":1072137,"file_name":"IST-2015-330-v2+1_main.pdf","file_id":"5473","checksum":"f5917c20f84018b362d385c000a2e123","relation":"main_file","date_created":"2018-12-12T11:53:12Z","content_type":"application/pdf"}],"pubrep_id":"333","has_accepted_license":"1"},{"month":"05","year":"2015","date_created":"2018-12-12T11:39:20Z","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","day":"18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","status":"public","page":"20","date_updated":"2025-04-15T08:11:50Z","oa":1,"language":[{"iso":"eng"}],"author":[{"full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"date_published":"2015-05-18T00:00:00Z","ddc":["004","512","513"],"_id":"5439","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. "}],"doi":"10.15479/AT:IST-2015-335-v1-1","alternative_title":["IST Austria Technical Report"],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"title":"The target discounted-sum problem","publication_status":"published","department":[{"_id":"ToHe"}],"file":[{"creator":"system","access_level":"open_access","file_size":589619,"file_name":"IST-2015-335-v1+1_report.pdf","date_updated":"2020-07-14T12:46:55Z","checksum":"40405907aa012acece1bc26cf0be554d","file_id":"5517","relation":"main_file","date_created":"2018-12-12T11:53:55Z","content_type":"application/pdf"}],"citation":{"apa":"Boker, U., Henzinger, T. A., &#38; Otop, J. (2015). <i>The target discounted-sum problem</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","ama":"Boker U, Henzinger TA, Otop J. <i>The Target Discounted-Sum Problem</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>","ieee":"U. Boker, T. A. Henzinger, and J. Otop, <i>The target discounted-sum problem</i>. IST Austria, 2015.","short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","mla":"Boker, Udi, et al. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>."},"has_accepted_license":"1","pubrep_id":"335","file_date_updated":"2020-07-14T12:46:55Z"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"date_updated":"2023-02-23T12:26:10Z","language":[{"iso":"eng"}],"oa":1,"_id":"5440","date_published":"2015-06-16T00:00:00Z","ddc":["005","576"],"date_created":"2018-12-12T11:39:21Z","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"month":"06","year":"2015","status":"public","page":"18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","type":"technical_report","pubrep_id":"338","has_accepted_license":"1","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015."},"file":[{"content_type":"application/pdf","date_created":"2018-12-12T11:53:23Z","relation":"main_file","file_id":"5484","checksum":"66aace7d367032af97c15e35c9be9636","date_updated":"2020-07-14T12:46:56Z","file_size":466161,"file_name":"IST-2015-323-v2+2_main.pdf","access_level":"open_access","creator":"system"}],"file_date_updated":"2020-07-14T12:46:56Z","doi":"10.15479/AT:IST-2015-323-v2-2","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive.","lang":"eng"}],"department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"5421","relation":"earlier_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5432"}]},"publication_status":"published","title":"The complexity of evolutionary games on graphs"},{"year":"2015","month":"07","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","date_created":"2018-12-12T11:39:21Z","type":"technical_report","day":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"24","status":"public","language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-04-15T08:11:48Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"},{"full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"date_published":"2015-07-11T00:00:00Z","_id":"5441","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2015-340-v1-1","publication_status":"published","related_material":{"record":[{"id":"5442","status":"public","relation":"earlier_version"},{"status":"public","relation":"later_version","id":"6009"},{"status":"public","relation":"later_version","id":"1437"}]},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","department":[{"_id":"KrCh"}],"file":[{"access_level":"open_access","file_name":"IST-2015-340-v1+1_main.pdf","file_size":861396,"date_updated":"2020-07-14T12:46:56Z","creator":"system","date_created":"2018-12-12T11:54:09Z","content_type":"application/pdf","file_id":"5531","checksum":"df383dc62c94d7b2ea639aba088a76c6","relation":"main_file"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &#38; Pavlogiannis, A. (2015). <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p."},"has_accepted_license":"1","pubrep_id":"340","file_date_updated":"2020-07-14T12:46:56Z"}]