[{"title":"RealSense = real heart rate: Illumination invariant heart rate estimation from videos","doi":"10.1109/ipta.2016.7820970","abstract":[{"lang":"eng","text":"Recent studies validated the feasibility of estimating heart rate from human faces in RGB video. However, test subjects are often recorded under controlled conditions, as illumination variations significantly affect the RGB-based heart rate estimation accuracy. Intel newly-announced low-cost RealSense 3D (RGBD) camera is becoming ubiquitous in laptops and mobile devices starting this year, opening the door to new and more robust computer vision. RealSense cameras produce RGB images with extra depth information inferred from a latent near-infrared (NIR) channel. In this paper, we experimentally demonstrate, for the first time, that heart rate can be reliably estimated from RealSense near-infrared images. This enables illumination invariant heart rate estimation, extending the heart rate from video feasibility to low-light applications, such as night driving. With the (coming) ubiquitous presence of RealSense devices, the proposed method not only utilizes its near-infrared channel, designed originally to be hidden from consumers; but also exploits the associated depth information for improved robustness to head pose."}],"publication_identifier":{"eissn":["2154-512X"],"isbn":["9781467389112"]},"year":"2017","date_published":"2017-01-19T00:00:00Z","status":"public","publisher":"IEEE","citation":{"apa":"Chen, J., Chang, Z., Qiu, Q., Li, X., Sapiro, G., Bronstein, A. M., &#38; Pietikainen, M. (2017). RealSense = real heart rate: Illumination invariant heart rate estimation from videos. In <i>2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)</i>. Oulu, Finland: IEEE. <a href=\"https://doi.org/10.1109/ipta.2016.7820970\">https://doi.org/10.1109/ipta.2016.7820970</a>","chicago":"Chen, Jie, Zhuoqing Chang, Qiang Qiu, Xiaobai Li, Guillermo Sapiro, Alex M. Bronstein, and Matti Pietikainen. “RealSense = Real Heart Rate: Illumination Invariant Heart Rate Estimation from Videos.” In <i>2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/ipta.2016.7820970\">https://doi.org/10.1109/ipta.2016.7820970</a>.","short":"J. Chen, Z. Chang, Q. Qiu, X. Li, G. Sapiro, A.M. Bronstein, M. Pietikainen, in:, 2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA), IEEE, 2017.","ieee":"J. Chen <i>et al.</i>, “RealSense = real heart rate: Illumination invariant heart rate estimation from videos,” in <i>2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)</i>, Oulu, Finland, 2017.","ista":"Chen J, Chang Z, Qiu Q, Li X, Sapiro G, Bronstein AM, Pietikainen M. 2017. RealSense = real heart rate: Illumination invariant heart rate estimation from videos. 2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA). 6th International Conference on Image Processing Theory, Tools and Applications, 7820970.","mla":"Chen, Jie, et al. “RealSense = Real Heart Rate: Illumination Invariant Heart Rate Estimation from Videos.” <i>2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)</i>, 7820970, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/ipta.2016.7820970\">10.1109/ipta.2016.7820970</a>.","ama":"Chen J, Chang Z, Qiu Q, et al. RealSense = real heart rate: Illumination invariant heart rate estimation from videos. In: <i>2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/ipta.2016.7820970\">10.1109/ipta.2016.7820970</a>"},"quality_controlled":"1","publication":"2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)","author":[{"last_name":"Chen","first_name":"Jie","full_name":"Chen, Jie"},{"last_name":"Chang","first_name":"Zhuoqing","full_name":"Chang, Zhuoqing"},{"full_name":"Qiu, Qiang","first_name":"Qiang","last_name":"Qiu"},{"last_name":"Li","first_name":"Xiaobai","full_name":"Li, Xiaobai"},{"last_name":"Sapiro","first_name":"Guillermo","full_name":"Sapiro, Guillermo"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","orcid":"0000-0001-9699-8730"},{"last_name":"Pietikainen","full_name":"Pietikainen, Matti","first_name":"Matti"}],"date_updated":"2024-12-04T14:32:02Z","month":"01","_id":"18403","article_number":"7820970","oa_version":"None","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2024-10-15T11:20:54Z","day":"19","article_processing_charge":"No","publication_status":"published","conference":{"name":"6th International Conference on Image Processing Theory, Tools and Applications","start_date":"2016-12-12","location":"Oulu, Finland","end_date":"2016-12-15"},"type":"conference","fulldoi":"https://doi.org/10.1109/ipta.2016.7820970","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"abstract":[{"text":"We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a variant of the JAD problem with an appropriately modified coupling term (surprisingly) allows to construct quasi-harmonic bases localized on the latent corresponding parts. This circumvents the need to explicitly compute the unknown parts by means of the cumbersome alternating minimization used in the previous approaches, and allows performing all the calculations in the spectral domain with constant complexity independent of the number of shape vertices. We provide an extensive evaluation of the proposed technique on standard non-rigid correspondence benchmarks and show state-of-the-art performance in various settings, including partiality and the presence of topological noise.","lang":"eng"}],"year":"2017","date_published":"2017-05-01T00:00:00Z","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"intvolume":"        36","title":"Fully spectral partial shape matching","doi":"10.1111/cgf.13123","quality_controlled":"1","publication":"Computer Graphics Forum","citation":{"mla":"Litany, O., et al. “Fully Spectral Partial Shape Matching.” <i>Computer Graphics Forum</i>, vol. 36, no. 2, Wiley, 2017, pp. 247–58, doi:<a href=\"https://doi.org/10.1111/cgf.13123\">10.1111/cgf.13123</a>.","ista":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. 2017. Fully spectral partial shape matching. Computer Graphics Forum. 36(2), 247–258.","ama":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. Fully spectral partial shape matching. <i>Computer Graphics Forum</i>. 2017;36(2):247-258. doi:<a href=\"https://doi.org/10.1111/cgf.13123\">10.1111/cgf.13123</a>","chicago":"Litany, O., E. Rodolà, Alex M. Bronstein, and M. M. Bronstein. “Fully Spectral Partial Shape Matching.” <i>Computer Graphics Forum</i>. Wiley, 2017. <a href=\"https://doi.org/10.1111/cgf.13123\">https://doi.org/10.1111/cgf.13123</a>.","apa":"Litany, O., Rodolà, E., Bronstein, A. M., &#38; Bronstein, M. M. (2017). Fully spectral partial shape matching. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13123\">https://doi.org/10.1111/cgf.13123</a>","ieee":"O. Litany, E. Rodolà, A. M. Bronstein, and M. M. Bronstein, “Fully spectral partial shape matching,” <i>Computer Graphics Forum</i>, vol. 36, no. 2. Wiley, pp. 247–258, 2017.","short":"O. Litany, E. Rodolà, A.M. Bronstein, M.M. Bronstein, Computer Graphics Forum 36 (2017) 247–258."},"month":"05","date_updated":"2024-12-19T14:38:05Z","page":"247-258","author":[{"last_name":"Litany","first_name":"O.","full_name":"Litany, O."},{"first_name":"E.","full_name":"Rodolà, E.","last_name":"Rodolà"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"}],"status":"public","publisher":"Wiley","day":"01","date_created":"2024-10-15T11:20:55Z","issue":"2","_id":"18427","scopus_import":"1","oa_version":"None","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1111/cgf.13123","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","publication_status":"published","volume":36},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1145/3084873.3084877","conference":{"location":"Los Angeles, CA, United States","end_date":"2017-08-03","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques Conference","start_date":"2017-07-30"},"oa":1,"publication_status":"published","date_created":"2024-10-15T11:20:55Z","day":"30","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"_id":"18435","OA_place":"repository","author":[{"last_name":"Ovsjanikov","first_name":"Maks","full_name":"Ovsjanikov, Maks"},{"full_name":"Corman, Etienne","first_name":"Etienne","last_name":"Corman"},{"last_name":"Bronstein","first_name":"Michael","full_name":"Bronstein, Michael"},{"first_name":"Emanuele","full_name":"Rodolà, Emanuele","last_name":"Rodolà"},{"first_name":"Mirela","full_name":"Ben-Chen, Mirela","last_name":"Ben-Chen"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"first_name":"Frederic","full_name":"Chazal, Frederic","last_name":"Chazal"},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","first_name":"Alexander"}],"quality_controlled":"1","citation":{"mla":"Ovsjanikov, Maks, et al. “Computing and Processing Correspondences with Functional Maps.” <i>ACM SIGGRAPH 2017 Courses</i>, 5, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3084873.3084877\">10.1145/3084873.3084877</a>.","ista":"Ovsjanikov M, Corman E, Bronstein M, Rodolà E, Ben-Chen M, Guibas L, Chazal F, Bronstein AM. 2017. Computing and processing correspondences with functional maps. ACM SIGGRAPH 2017 Courses. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 5.","ama":"Ovsjanikov M, Corman E, Bronstein M, et al. Computing and processing correspondences with functional maps. In: <i>ACM SIGGRAPH 2017 Courses</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3084873.3084877\">10.1145/3084873.3084877</a>","chicago":"Ovsjanikov, Maks, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas Guibas, Frederic Chazal, and Alex M. Bronstein. “Computing and Processing Correspondences with Functional Maps.” In <i>ACM SIGGRAPH 2017 Courses</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3084873.3084877\">https://doi.org/10.1145/3084873.3084877</a>.","apa":"Ovsjanikov, M., Corman, E., Bronstein, M., Rodolà, E., Ben-Chen, M., Guibas, L., … Bronstein, A. M. (2017). Computing and processing correspondences with functional maps. In <i>ACM SIGGRAPH 2017 Courses</i>. Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3084873.3084877\">https://doi.org/10.1145/3084873.3084877</a>","ieee":"M. Ovsjanikov <i>et al.</i>, “Computing and processing correspondences with functional maps,” in <i>ACM SIGGRAPH 2017 Courses</i>, Los Angeles, CA, United States, 2017.","short":"M. Ovsjanikov, E. Corman, M. Bronstein, E. Rodolà, M. Ben-Chen, L. Guibas, F. Chazal, A.M. Bronstein, in:, ACM SIGGRAPH 2017 Courses, ACM, 2017."},"publisher":"ACM","status":"public","date_published":"2017-07-30T00:00:00Z","publication_identifier":{"isbn":["9781450350143"]},"doi":"10.1145/3084873.3084877","extern":"1","type":"conference","OA_type":"green","article_processing_charge":"No","article_number":"5","month":"07","date_updated":"2025-02-04T15:01:50Z","publication":"ACM SIGGRAPH 2017 Courses","year":"2017","main_file_link":[{"url":"https://inria.hal.science/hal-01664767/","open_access":"1"}],"abstract":[{"lang":"eng","text":"Notions of similarity and correspondence between geometric shapes and images are central to many tasks in geometry processing, computer vision, and computer graphics. The goal of this course is to familiarize the audience with a set of recent techniques that greatly facilitate the computation of mappings or correspondences between geometric datasets, such as 3D shapes or 2D images by formulating them as mappings between functions rather than points or triangles.\r\nMethods based on the functional map framework have recently led to state-of-the-art results in problems as diverse as non-rigid shape matching, image co-segmentation and even some aspects of tangent vector field design. One challenge in adopting these methods in practice, however, is that their exposition often assumes a significant amount of background in geometry processing, spectral methods and functional analysis, which can make it difficult to gain an intuition about their performance or about their applicability to real-life problems. In this course, we try to provide all the tools necessary to appreciate and use these techniques, while assuming very little background knowledge. We also give a unifying treatment of these techniques, which may be difficult to extract from the individual publications and, at the same time, hint at the generality of this point of view, which can help tackle many problems in the analysis and creation of visual content.\r\nThis course is structured as a half day course. We will assume that the participants have knowledge of basic linear algebra and some knowledge of differential geometry, to the extent of being familiar with the concepts of a manifold and a tangent vector space. We will discuss in detail the functional approach to finding correspondences between non-rigid shapes, the design and analysis of tangent vector fields on surfaces, consistent map estimation in networks of shapes and applications to shape and image segmentation, shape variability analysis, and other areas."}],"title":"Computing and processing correspondences with functional maps"},{"OA_place":"repository","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"full_name":"Oh, Tadahiro","first_name":"Tadahiro","last_name":"Oh"},{"full_name":"Pocovnicu, Oana","first_name":"Oana","last_name":"Pocovnicu"},{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"page":"469-548","quality_controlled":"1","citation":{"short":"R. Killip, T. Oh, O. Pocovnicu, M. Vişan, Archive for Rational Mechanics and Analysis 225 (2017) 469–548.","ieee":"R. Killip, T. Oh, O. Pocovnicu, and M. Vişan, “Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 225. Springer Nature, pp. 469–548, 2017.","apa":"Killip, R., Oh, T., Pocovnicu, O., &#38; Vişan, M. (2017). Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-017-1109-0\">https://doi.org/10.1007/s00205-017-1109-0</a>","chicago":"Killip, Rowan, Tadahiro Oh, Oana Pocovnicu, and Monica Vişan. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00205-017-1109-0\">https://doi.org/10.1007/s00205-017-1109-0</a>.","ama":"Killip R, Oh T, Pocovnicu O, Vişan M. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. <i>Archive for Rational Mechanics and Analysis</i>. 2017;225:469-548. doi:<a href=\"https://doi.org/10.1007/s00205-017-1109-0\">10.1007/s00205-017-1109-0</a>","ista":"Killip R, Oh T, Pocovnicu O, Vişan M. 2017. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. Archive for Rational Mechanics and Analysis. 225, 469–548.","mla":"Killip, Rowan, et al. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 225, Springer Nature, 2017, pp. 469–548, doi:<a href=\"https://doi.org/10.1007/s00205-017-1109-0\">10.1007/s00205-017-1109-0</a>."},"publisher":"Springer Nature","status":"public","date_published":"2017-07-01T00:00:00Z","publication_identifier":{"issn":["0003-9527"],"eissn":["1432-0673"]},"external_id":{"arxiv":["1409.6734"]},"article_type":"original","doi":"10.1007/s00205-017-1109-0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1007/s00205-017-1109-0","volume":225,"publication_status":"published","oa":1,"date_created":"2026-06-19T08:21:38Z","day":"01","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"_id":"22071","month":"07","arxiv":1,"date_updated":"2026-06-30T10:52:12Z","publication":"Archive for Rational Mechanics and Analysis","year":"2017","abstract":[{"text":"We consider the cubic–quintic nonlinear Schrödinger equation: (mathematical formular)\r\nIn the first part of the paper, we analyze the one-parameter family of ground state solitons associated to this equation with particular attention to the shape of the associated mass/energy curve. Additionally, we are able to characterize the kernel of the linearized operator about such solitons and to demonstrate that they occur as optimizers for a one-parameter family of inequalities of Gagliardo–Nirenberg type. Building on this work, in the latter part of the paper we prove that scattering holds for solutions belonging to the region R of the mass/energy plane where the virial is positive. We show that this region is partially bounded by solitons also by rescalings of solitons (which are not soliton solutions in their own right). The discovery of rescaled solitons in this context is new and highlights an unexpected limitation of any virial-based methodology.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1409.6734","open_access":"1"}],"intvolume":"       225","title":"Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3","extern":"1","type":"journal_article","OA_type":"green","article_processing_charge":"No"},{"citation":{"chicago":"Killip, Rowan, Jason Murphy, Monica Vişan, and Jiqiang Zheng. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” <i>Differential and Integral Equations</i>. Khayyam Publishing, 2017. <a href=\"https://doi.org/10.57262/die/1487386822\">https://doi.org/10.57262/die/1487386822</a>.","apa":"Killip, R., Murphy, J., Vişan, M., &#38; Zheng, J. (2017). The focusing cubic NLS with inverse-square potential in three space dimensions. <i>Differential and Integral Equations</i>. Khayyam Publishing. <a href=\"https://doi.org/10.57262/die/1487386822\">https://doi.org/10.57262/die/1487386822</a>","ieee":"R. Killip, J. Murphy, M. Vişan, and J. Zheng, “The focusing cubic NLS with inverse-square potential in three space dimensions,” <i>Differential and Integral Equations</i>, vol. 30, no. 3/4. Khayyam Publishing, pp. 161–206, 2017.","short":"R. Killip, J. Murphy, M. Vişan, J. Zheng, Differential and Integral Equations 30 (2017) 161–206.","mla":"Killip, Rowan, et al. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” <i>Differential and Integral Equations</i>, vol. 30, no. 3/4, Khayyam Publishing, 2017, pp. 161–206, doi:<a href=\"https://doi.org/10.57262/die/1487386822\">10.57262/die/1487386822</a>.","ista":"Killip R, Murphy J, Vişan M, Zheng J. 2017. The focusing cubic NLS with inverse-square potential in three space dimensions. Differential and Integral Equations. 30(3/4), 161–206.","ama":"Killip R, Murphy J, Vişan M, Zheng J. The focusing cubic NLS with inverse-square potential in three space dimensions. <i>Differential and Integral Equations</i>. 2017;30(3/4):161-206. doi:<a href=\"https://doi.org/10.57262/die/1487386822\">10.57262/die/1487386822</a>"},"quality_controlled":"1","OA_place":"repository","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"first_name":"Jason","full_name":"Murphy, Jason","last_name":"Murphy"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica"},{"last_name":"Zheng","full_name":"Zheng, Jiqiang","first_name":"Jiqiang"}],"page":"161-206","status":"public","publisher":"Khayyam Publishing","article_type":"original","publication_identifier":{"issn":["0893-4983"]},"external_id":{"arxiv":["1603.08912"]},"date_published":"2017-03-01T00:00:00Z","doi":"10.57262/die/1487386822","mathsc":["35Q55"],"fulldoi":"https://doi.org/10.57262/die/1487386822","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa":1,"volume":30,"day":"01","date_created":"2026-06-19T08:47:48Z","_id":"22088","language":[{"iso":"eng"}],"oa_version":"Preprint","scopus_import":"1","publication":"Differential and Integral Equations","date_updated":"2026-07-01T12:42:38Z","arxiv":1,"month":"03","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1603.08912"}],"abstract":[{"lang":"eng","text":"We consider the focusing cubic nonlinear Schrödinger equation with inverse-square potential in three space dimensions. We identify a sharp threshold between scattering and blowup, establishing a result analogous to that of Duyckaerts, Holmer, and Roudenko for the standard focusing cubic NLS. We also prove failure of uniform space-time bounds at the threshold."}],"year":"2017","title":"The focusing cubic NLS with inverse-square potential in three space dimensions","intvolume":"        30","type":"journal_article","extern":"1","article_processing_charge":"No","OA_type":"green","issue":"3/4","das_tickbox":"1"},{"article_processing_charge":"No","type":"journal_article","article_number":"15","das_tickbox":"1","issue":"2","publication":"Logical Methods in Computer Science","date_updated":"2026-07-06T13:26:27Z","month":"07","file":[{"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","file_id":"5354","access_level":"open_access","file_size":511832,"date_created":"2018-12-12T10:18:32Z","checksum":"bfa405385ec6229ad5ead89ab5751639","content_type":"application/pdf","creator":"system","relation":"main_file"}],"intvolume":"        13","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","has_accepted_license":"1","related_material":{"record":[{"id":"5429","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5435"},{"relation":"earlier_version","status":"public","id":"1657"}]},"license":"https://creativecommons.org/licenses/by-nd/4.0/","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"publist_id":"7355","year":"2017","publication_status":"published","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"volume":13,"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"701309","call_identifier":"H2020","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.23638/LMCS-13(2:15)2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"466","language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Published Version","scopus_import":"1","pubrep_id":"957","day":"03","date_created":"2018-12-11T11:46:38Z","ddc":["004"],"ec_funded":1,"status":"public","publisher":"International Federation for Computational Logic","isi":1,"citation":{"ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>","apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation for Computational Logic, 2017."},"quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Křetínská, Zuzana","first_name":"Zuzana","last_name":"Křetínská"},{"first_name":"Jan","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","orcid":"0000-0002-8122-2881"}],"department":[{"_id":"KrCh"}],"doi":"10.23638/LMCS-13(2:15)2017","file_date_updated":"2020-07-14T12:46:33Z","external_id":{"isi":["000419160800002"]},"publication_identifier":{"issn":["1860-5974"]},"date_published":"2017-07-03T00:00:00Z"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:33Z","doi":"10.23638/LMCS-13(3:23)2017","publication_identifier":{"issn":["1860-5974"]},"external_id":{"isi":["000419163000005"]},"date_published":"2017-09-13T00:00:00Z","publisher":"International Federation for Computational Logic","status":"public","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>."},"isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Published Version","pubrep_id":"955","scopus_import":"1","_id":"465","ddc":["004"],"ec_funded":1,"date_created":"2018-12-11T11:46:37Z","day":"13","project":[{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"volume":13,"oa":1,"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.23638/LMCS-13(3:23)2017","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5438"},{"id":"1610","relation":"earlier_version","status":"public"}]},"title":"Edit distance for pushdown automata","intvolume":"        13","has_accepted_license":"1","year":"2017","publist_id":"7356","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"date_updated":"2026-07-06T13:27:53Z","month":"09","file":[{"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2015-321-v1+1_main.pdf","file_id":"5090","access_level":"open_access","file_size":279071,"date_created":"2018-12-12T10:14:37Z","content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f","creator":"system","relation":"main_file"},{"content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f","date_created":"2018-12-12T10:14:38Z","file_size":279071,"relation":"main_file","creator":"system","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","date_updated":"2020-07-14T12:46:33Z","access_level":"open_access","file_id":"5091"}],"publication":"Logical Methods in Computer Science","das_tickbox":"1","issue":"3","article_processing_charge":"No","type":"journal_article"},{"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika","first_name":"Veronika"}],"isi":1,"citation":{"apa":"Chatterjee, K., Henzinger, M., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>"},"quality_controlled":"1","publisher":"International Federation for Computational Logic","status":"public","external_id":{"arxiv":["1410.0833"],"isi":["000419163000001"]},"publication_identifier":{"issn":["1860-5974"]},"date_published":"2017-09-26T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.23638/LMCS-13(3:26)2017","file_date_updated":"2020-07-14T12:46:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.23638/LMCS-13(3:26)2017","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"volume":13,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"oa":1,"publication_status":"published","ddc":["004"],"ec_funded":1,"date_created":"2018-12-11T11:46:37Z","day":"26","oa_version":"Published Version","corr_author":"1","language":[{"iso":"eng"}],"pubrep_id":"956","scopus_import":"1","_id":"464","arxiv":1,"date_updated":"2026-07-06T13:28:05Z","month":"09","file":[{"file_id":"5010","access_level":"open_access","date_updated":"2020-07-14T12:46:32Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","relation":"main_file","creator":"system","content_type":"application/pdf","checksum":"12d469ae69b80361333d7dead965cf5d","file_size":582940,"date_created":"2018-12-12T10:13:27Z"}],"publication":"Logical Methods in Computer Science","publist_id":"7357","year":"2017","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1661"}]},"intvolume":"        13","title":"Improved algorithms for parity and Streett objectives","has_accepted_license":"1","type":"journal_article","article_processing_charge":"No","issue":"3","das_tickbox":"1","article_number":"26"},{"status":"public","publisher":"International Press of Boston","quality_controlled":"1","isi":1,"citation":{"chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 683–738, 2017.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>"},"author":[{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","first_name":"Phan","full_name":"Nam, Phan"},{"first_name":"Marcin M","full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski"}],"page":"683 - 738","doi":"10.4310/ATMP.2017.v21.n3.a4","department":[{"_id":"RoSe"}],"date_published":"2017-01-01T00:00:00Z","external_id":{"arxiv":["1509.04631"],"isi":["000409382300004"]},"publication_identifier":{"issn":["1095-0761"]},"publication_status":"published","oa":1,"volume":21,"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P27533_N27"}],"fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"484","scopus_import":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:46:43Z","day":"01","ec_funded":1,"publication":"Advances in Theoretical and Mathematical Physics","month":"01","arxiv":1,"date_updated":"2026-07-06T13:34:16Z","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","intvolume":"        21","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"abstract":[{"text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β &lt; 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.","lang":"eng"}],"year":"2017","publist_id":"7336","article_processing_charge":"No","type":"journal_article","das_tickbox":"1","issue":"3"},{"date_created":"2018-12-11T11:46:43Z","day":"25","ec_funded":1,"_id":"483","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","volume":21,"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"publication_identifier":{"issn":["1095-0761"]},"external_id":{"arxiv":["1602.02312"],"isi":["000409382300005"]},"date_published":"2017-08-25T00:00:00Z","department":[{"_id":"LaEr"}],"doi":"10.4310/ATMP.2017.v21.n3.a5","isi":1,"citation":{"apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 739–800, 2017.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>"},"quality_controlled":"1","page":"739 - 800","author":[{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"},{"full_name":"Yin, Jun","first_name":"Jun","last_name":"Yin"}],"status":"public","publisher":"International Press of Boston","issue":"3","das_tickbox":"1","type":"journal_article","article_processing_charge":"No","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"year":"2017","publist_id":"7337","intvolume":"        21","title":"Universality for a class of random band matrices","publication":"Advances in Theoretical and Mathematical Physics","date_updated":"2026-07-06T13:35:08Z","arxiv":1,"month":"08"},{"day":"01","date_created":"2018-12-11T11:49:37Z","ec_funded":1,"_id":"1000","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa":1,"conference":{"start_date":"2017-08-06","name":"ICML: International Conference on Machine Learning","end_date":"2017-08-11","location":"Sydney, Australia"},"volume":70,"project":[{"grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"}],"date_published":"2017-08-01T00:00:00Z","publication_identifier":{"isbn":["978-151085514-4"]},"external_id":{"isi":["000683309501102"],"arxiv":["1612.08185"]},"department":[{"_id":"ChLa"}],"quality_controlled":"1","citation":{"ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, Journal of Machine Learning Research, 2017, pp. 1905–14.","ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. Journal of Machine Learning Research; 2017:1905-1914.","apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: Journal of Machine Learning Research.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. Journal of Machine Learning Research, 2017.","short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, Journal of Machine Learning Research, 2017, pp. 1905–1914.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914."},"isi":1,"author":[{"first_name":"Alexander","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","last_name":"Kolesnikov"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph"}],"page":"1905 - 1914","status":"public","publisher":"Journal of Machine Learning Research","acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","das_tickbox":"1","type":"conference","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. "}],"main_file_link":[{"url":"https://arxiv.org/abs/1612.08185","open_access":"1"}],"publist_id":"6398","year":"2017","has_accepted_license":"1","title":"PixelCNN models with auxiliary variables for natural image modeling","intvolume":"        70","publication":"34th International Conference on Machine Learning","month":"08","date_updated":"2026-07-06T13:41:23Z","arxiv":1},{"scopus_import":"1","corr_author":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","_id":"568","ec_funded":1,"date_created":"2018-12-11T11:47:14Z","day":"01","volume":19,"project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"701309","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa":1,"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.4310/HHA.2017.v19.n2.a16","doi":"10.4310/HHA.2017.v19.n2.a16","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_published":"2017-01-01T00:00:00Z","publication_identifier":{"issn":["1532-0073"]},"external_id":{"isi":["000440749400010"],"arxiv":["1507.04310"]},"publisher":"International Press of Boston","status":"public","author":[{"orcid":"0000-0001-8878-8397","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","first_name":"Peter","full_name":"Franek, Peter"},{"first_name":"Marek","full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál"}],"page":"313 - 342","quality_controlled":"1","isi":1,"citation":{"short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2. International Press of Boston, pp. 313–342, 2017.","apa":"Franek, P., &#38; Krcál, M. (2017). Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>.","ama":"Franek P, Krcál M. Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. 2017;19(2):313-342. doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2, International Press of Boston, 2017, pp. 313–42, doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>."},"das_tickbox":"1","issue":"2","article_processing_charge":"No","type":"journal_article","intvolume":"        19","title":"Persistence of zero sets","publist_id":"7246","year":"2017","abstract":[{"text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z&lt; r(f) := (g-1(0): ||g - f|| &lt; r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z&lt; r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r &gt; 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"month":"01","arxiv":1,"date_updated":"2026-07-06T13:38:28Z","publication":"Homology, Homotopy and Applications"},{"publication_status":"published","oa":1,"volume":24,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"701","pubrep_id":"984","oa_version":"Submitted Version","corr_author":"1","language":[{"iso":"eng"}],"day":"14","date_created":"2018-12-11T11:48:00Z","ddc":["500"],"status":"public","publisher":"International Press of Boston","quality_controlled":"1","citation":{"ista":"Kynčl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. 24(3), 1–44.","mla":"Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3, International Press of Boston, 2017, pp. 1–44.","ama":"Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. <i>The Electronic Journal of Combinatorics</i>. 2017;24(3):1-44.","apa":"Kynčl, J., &#38; Patakova, Z. (2017). On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. <i>The Electronic Journal of Combinatorics</i>. International Press of Boston.","chicago":"Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” <i>The Electronic Journal of Combinatorics</i>. International Press of Boston, 2017.","short":"J. Kynčl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017) 1–44.","ieee":"J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4,” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3. International Press of Boston, pp. 1–44, 2017."},"page":"1-44","author":[{"last_name":"Kynčl","full_name":"Kynčl, Jan","first_name":"Jan"},{"first_name":"Zuzana","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","last_name":"Patakova"}],"file_date_updated":"2020-07-14T12:47:47Z","department":[{"_id":"UlWa"}],"date_published":"2017-07-14T00:00:00Z","publication_identifier":{"issn":["1077-8926"]},"article_processing_charge":"No","type":"journal_article","das_tickbox":"1","issue":"3","publication":"The Electronic Journal of Combinatorics","file":[{"date_updated":"2020-07-14T12:47:47Z","file_name":"IST-2018-984-v1+1_Patakova_on_the_nonexistence_of_k-reptile_simplices_in_R_3_and_R_4_2017.pdf","file_id":"5077","access_level":"open_access","file_size":544042,"date_created":"2018-12-12T10:14:25Z","content_type":"application/pdf","checksum":"a431e573e31df13bc0f66de3061006ec","creator":"system","relation":"main_file"}],"month":"07","date_updated":"2026-07-06T13:38:44Z","has_accepted_license":"1","intvolume":"        24","title":"On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4","abstract":[{"lang":"eng","text":"A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d = 2, triangular k-reptiles exist for all k of the form a^2, 3a^2 or a^2+b^2 and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, the only k-reptile simplices that are known for d ≥ 3, have k = m^d, where m is a positive integer. We substantially simplify the proof by Matoušek and the second author that for d = 3, k-reptile tetrahedra can exist only for k = m^3. We then prove a weaker analogue of this result for d = 4 by showing that four-dimensional k-reptile simplices can exist only for k = m^2."}],"year":"2017","publist_id":"6996"},{"article_number":"e2001894","issue":"5","article_processing_charge":"No","type":"journal_article","related_material":{"record":[{"status":"public","relation":"research_data","id":"9856"},{"id":"9858","status":"public","relation":"research_data"},{"relation":"research_data","status":"public","id":"9857"}]},"intvolume":"        15","title":"Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti","has_accepted_license":"1","publist_id":"6464","year":"2017","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"Dengue-suppressing Wolbachia strains are promising tools for arbovirus control, particularly as they have the potential to self-spread following local introductions. To test this, we followed the frequency of the transinfected Wolbachia strain wMel through Ae. aegypti in Cairns, Australia, following releases at 3 nonisolated locations within the city in early 2013. Spatial spread was analysed graphically using interpolation and by fitting a statistical model describing the position and width of the wave. For the larger 2 of the 3 releases (covering 0.97 km2 and 0.52 km2), we observed slow but steady spatial spread, at about 100–200 m per year, roughly consistent with theoretical predictions. In contrast, the smallest release (0.11 km2) produced erratic temporal and spatial dynamics, with little evidence of spread after 2 years. This is consistent with the prediction concerning fitness-decreasing Wolbachia transinfections that a minimum release area is needed to achieve stable local establishment and spread in continuous habitats. Our graphical and likelihood analyses produced broadly consistent estimates of wave speed and wave width. Spread at all sites was spatially heterogeneous, suggesting that environmental heterogeneity will affect large-scale Wolbachia transformations of urban mosquito populations. The persistence and spread of Wolbachia in release areas meeting minimum area requirements indicates the promise of successful large-scale population transfo"}],"date_updated":"2026-07-06T13:53:54Z","month":"05","file":[{"date_created":"2018-12-12T10:08:30Z","file_size":5541206,"checksum":"107d290bd1159ec77b734eb2824b01c8","content_type":"application/pdf","creator":"system","relation":"main_file","file_name":"IST-2017-843-v1+1_journal.pbio.2001894.pdf","date_updated":"2020-07-14T12:48:16Z","access_level":"open_access","file_id":"4691"}],"publication":"PLoS Biology","oa_version":"Published Version","language":[{"iso":"eng"}],"pubrep_id":"843","scopus_import":"1","_id":"951","ddc":["576"],"date_created":"2018-12-11T11:49:22Z","day":"30","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":15,"publication_status":"published","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1371/journal.pbio.2001894","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:48:16Z","doi":"10.1371/journal.pbio.2001894","external_id":{"isi":["000402520000012"]},"publication_identifier":{"issn":["1544-9173"]},"date_published":"2017-05-30T00:00:00Z","publisher":"Public Library of Science","status":"public","author":[{"first_name":"Tom","full_name":"Schmidt, Tom","last_name":"Schmidt"},{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"last_name":"Rasic","first_name":"Gordana","full_name":"Rasic, Gordana"},{"full_name":"Turley, Andrew","first_name":"Andrew","last_name":"Turley"},{"last_name":"Montgomery","full_name":"Montgomery, Brian","first_name":"Brian"},{"last_name":"Iturbe Ormaetxe","first_name":"Inaki","full_name":"Iturbe Ormaetxe, Inaki"},{"last_name":"Cook","first_name":"Peter","full_name":"Cook, Peter"},{"first_name":"Peter","full_name":"Ryan, Peter","last_name":"Ryan"},{"first_name":"Scott","full_name":"Ritchie, Scott","last_name":"Ritchie"},{"last_name":"Hoffmann","first_name":"Ary","full_name":"Hoffmann, Ary"},{"full_name":"O’Neill, Scott","first_name":"Scott","last_name":"O’Neill"},{"last_name":"Turelli","full_name":"Turelli, Michael","first_name":"Michael"}],"citation":{"mla":"Schmidt, Tom, et al. “Local Introduction and Heterogeneous Spatial Spread of Dengue-Suppressing Wolbachia through an Urban Population of Aedes Aegypti.” <i>PLoS Biology</i>, vol. 15, no. 5, e2001894, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894\">10.1371/journal.pbio.2001894</a>.","ista":"Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I, Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. PLoS Biology. 15(5), e2001894.","ama":"Schmidt T, Barton NH, Rasic G, et al. Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. <i>PLoS Biology</i>. 2017;15(5). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894\">10.1371/journal.pbio.2001894</a>","chicago":"Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery, Inaki Iturbe Ormaetxe, Peter Cook, et al. “Local Introduction and Heterogeneous Spatial Spread of Dengue-Suppressing Wolbachia through an Urban Population of Aedes Aegypti.” <i>PLoS Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pbio.2001894\">https://doi.org/10.1371/journal.pbio.2001894</a>.","apa":"Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe, I., … Turelli, M. (2017). Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2001894\">https://doi.org/10.1371/journal.pbio.2001894</a>","ieee":"T. Schmidt <i>et al.</i>, “Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti,” <i>PLoS Biology</i>, vol. 15, no. 5. Public Library of Science, 2017.","short":"T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe, P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, PLoS Biology 15 (2017)."},"isi":1,"quality_controlled":"1"},{"publisher":"Public Library of Science","status":"public","author":[{"last_name":"Schmidt","full_name":"Schmidt, Tom","first_name":"Tom"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Rasic","first_name":"Gordana","full_name":"Rasic, Gordana"},{"last_name":"Turley","full_name":"Turley, Andrew","first_name":"Andrew"},{"first_name":"Brian","full_name":"Montgomery, Brian","last_name":"Montgomery"},{"last_name":"Iturbe Ormaetxe","first_name":"Inaki","full_name":"Iturbe Ormaetxe, Inaki"},{"full_name":"Cook, Peter","first_name":"Peter","last_name":"Cook"},{"last_name":"Ryan","first_name":"Peter","full_name":"Ryan, Peter"},{"last_name":"Ritchie","full_name":"Ritchie, Scott","first_name":"Scott"},{"full_name":"Hoffmann, Ary","first_name":"Ary","last_name":"Hoffmann"},{"last_name":"O’Neill","full_name":"O’Neill, Scott","first_name":"Scott"},{"last_name":"Turelli","full_name":"Turelli, Michael","first_name":"Michael"}],"date_updated":"2026-07-06T13:53:55Z","month":"05","citation":{"ieee":"T. Schmidt <i>et al.</i>, “Supporting information concerning observed wMel frequencies and analyses of habitat variables.” Public Library of Science, 2017.","short":"T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe, P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, (2017).","chicago":"Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery, Inaki Iturbe Ormaetxe, Peter Cook, et al. “Supporting Information Concerning Observed WMel Frequencies and Analyses of Habitat Variables.” Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">https://doi.org/10.1371/journal.pbio.2001894.s015</a>.","apa":"Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe, I., … Turelli, M. (2017). Supporting information concerning observed wMel frequencies and analyses of habitat variables. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">https://doi.org/10.1371/journal.pbio.2001894.s015</a>","ama":"Schmidt T, Barton NH, Rasic G, et al. Supporting information concerning observed wMel frequencies and analyses of habitat variables. 2017. doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>","mla":"Schmidt, Tom, et al. <i>Supporting Information Concerning Observed WMel Frequencies and Analyses of Habitat Variables</i>. Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>.","ista":"Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I, Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Supporting information concerning observed wMel frequencies and analyses of habitat variables, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>."},"department":[{"_id":"NiBa"}],"doi":"10.1371/journal.pbio.2001894.s015","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"951"}]},"title":"Supporting information concerning observed wMel frequencies and analyses of habitat variables","date_published":"2017-05-30T00:00:00Z","year":"2017","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","fulldoi":"https://doi.org/10.1371/journal.pbio.2001894.s015","oa_version":"Published Version","_id":"9857","day":"30","date_created":"2021-08-10T07:41:52Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1039/9781782626800-00444","volume":11,"publication_status":"published","oa":1,"date_created":"2018-12-11T11:47:27Z","day":"14","oa_version":"Submitted Version","language":[{"iso":"eng"}],"scopus_import":"1","_id":"604","author":[{"first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"full_name":"Schmidt, Richard","first_name":"Richard","last_name":"Schmidt"}],"page":"444 - 495","citation":{"mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, Royal Society of Chemistry, 2017, pp. 444–95, doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>.","ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>. Vol 11. Theoretical and Computational Chemistry Series. Royal Society of Chemistry; 2017:444-495. doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>.","apa":"Lemeshko, M., &#38; Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu &#38; A. Osterwalder (Eds.), <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i> (Vol. 11, pp. 444–495). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, vol. 11, O. Dulieu and A. Osterwalder, Eds. Royal Society of Chemistry, 2017, pp. 444–495.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , Royal Society of Chemistry, 2017, pp. 444–495."},"quality_controlled":"1","publisher":"Royal Society of Chemistry","status":"public","publication_identifier":{"issn":["2041-3181"]},"external_id":{"arxiv":["1703.06753"]},"date_published":"2017-12-14T00:00:00Z","department":[{"_id":"MiLe"}],"doi":"10.1039/9781782626800-00444","type":"book_chapter","article_processing_charge":"No","das_tickbox":"1","date_updated":"2026-07-07T05:50:51Z","alternative_title":["Theoretical and Computational Chemistry Series"],"arxiv":1,"month":"12","publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","series_title":"Theoretical and Computational Chemistry Series","publist_id":"7201","year":"2017","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"main_file_link":[{"url":"https://arxiv.org/abs/1703.06753","open_access":"1"}],"editor":[{"last_name":"Dulieu","full_name":"Dulieu, Oliver","first_name":"Oliver"},{"full_name":"Osterwalder, Andreas","first_name":"Andreas","last_name":"Osterwalder"}],"title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","intvolume":"        11"},{"ddc":["020"],"day":"01","date_created":"2018-12-11T11:48:36Z","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","_id":"807","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.31263/voebm.v70i2.1898","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":70,"publication_status":"published","oa":1,"date_published":"2017-08-01T00:00:00Z","publication_identifier":{"issn":["1022-2588"]},"popular_science":"1","file_date_updated":"2020-07-14T12:48:09Z","doi":"10.31263/voebm.v70i2.1898","department":[{"_id":"E-Lib"}],"author":[{"first_name":"Magdalena","full_name":"Andrae, Magdalena","last_name":"Andrae"},{"orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","last_name":"Villányi","first_name":"Márton","full_name":"Villányi, Márton"}],"page":"274 - 280","citation":{"ama":"Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2017;70(2):274-280. doi:<a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">10.31263/voebm.v70i2.1898</a>","ista":"Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280.","mla":"Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>, vol. 70, no. 2, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2017, pp. 274–80, doi:<a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">10.31263/voebm.v70i2.1898</a>.","short":"M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 70 (2017) 274–280.","ieee":"M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 70, no. 2. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 274–280, 2017.","apa":"Andrae, M., &#38; Villányi, M. (2017). Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">https://doi.org/10.31263/voebm.v70i2.1898</a>","chicago":"Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2017. <a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">https://doi.org/10.31263/voebm.v70i2.1898</a>."},"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","status":"public","issue":"2","das_tickbox":"1","type":"journal_article","article_processing_charge":"No","publist_id":"6843","year":"2017","abstract":[{"lang":"eng","text":"On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries and the publisher Springer took its effect: this deal covers accessing the licensed content on the one hand, and publishing open access on the other hand. More than 1000 papers by Austrian authors were published open access at Springer in the first year alone. The working group &quot;Springer Compact Evaluierung&quot; made the data for these articles available via the platform OpenAPC and would like to use this opportunity to give a short account of what this publishing agreement actually entails and the working group intends to do."}],"has_accepted_license":"1","title":"Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung","intvolume":"        70","month":"08","file":[{"file_id":"5851","access_level":"open_access","date_updated":"2020-07-14T12:48:09Z","file_name":"2017_VOEB_Andrae.pdf","creator":"dernst","relation":"main_file","file_size":125065,"date_created":"2019-01-18T13:39:26Z","content_type":"application/pdf","checksum":"558c18bcf5580d87dd371ec626d52075"}],"date_updated":"2026-07-07T06:08:32Z","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare"},{"date_created":"2018-12-11T11:48:41Z","day":"26","ec_funded":1,"_id":"823","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","fulldoi":"https://doi.org/10.1088/1742-5468/aa85c3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","volume":2017,"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1705.06303"],"isi":["000411842900001"]},"publication_identifier":{"issn":["1742-5468"]},"date_published":"2017-09-26T00:00:00Z","department":[{"_id":"GaTk"}],"doi":"10.1088/1742-5468/aa85c3","citation":{"chicago":"Colabrese, Simona, Daniele De Martino, Luca Leuzzi, and Enzo Marinari. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2017. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>.","apa":"Colabrese, S., De Martino, D., Leuzzi, L., &#38; Marinari, E. (2017). Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>","ieee":"S. Colabrese, D. De Martino, L. Leuzzi, and E. Marinari, “Phase transitions in integer linear problems,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9. IOP Publishing, 2017.","short":"S. Colabrese, D. De Martino, L. Leuzzi, E. Marinari, Journal of Statistical Mechanics: Theory and Experiment 2017 (2017).","mla":"Colabrese, Simona, et al. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9, 093404, IOP Publishing, 2017, doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>.","ista":"Colabrese S, De Martino D, Leuzzi L, Marinari E. 2017. Phase transitions in integer linear problems. Journal of Statistical Mechanics: Theory and Experiment. 2017(9), 093404.","ama":"Colabrese S, De Martino D, Leuzzi L, Marinari E. Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2017;2017(9). doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>"},"isi":1,"quality_controlled":"1","author":[{"last_name":"Colabrese","full_name":"Colabrese, Simona","first_name":"Simona"},{"full_name":"De Martino, Daniele","first_name":"Daniele","last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5214-4706"},{"last_name":"Leuzzi","full_name":"Leuzzi, Luca","first_name":"Luca"},{"last_name":"Marinari","first_name":"Enzo","full_name":"Marinari, Enzo"}],"status":"public","publisher":"IOP Publishing","issue":"9","article_number":"093404","das_tickbox":"1","type":"journal_article","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1705.06303","open_access":"1"}],"abstract":[{"lang":"eng","text":"The resolution of a linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density c and the ratio α=N/M between number of variables N and number of constraints M. By means of ensemble calculations we show that the space of feasible solutions endows a Van-Der-Waals phase diagram in the plane (c, α). We give numerical evidence that the associated computational problems become more difficult across the critical point and in particular in the coexistence region."}],"year":"2017","publist_id":"6826","intvolume":"      2017","title":"Phase transitions in integer linear problems","publication":"Journal of Statistical Mechanics: Theory and Experiment","arxiv":1,"date_updated":"2026-07-07T13:11:04Z","month":"09"},{"ec_funded":1,"day":"01","date_created":"2018-12-11T11:49:10Z","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","corr_author":"1","_id":"912","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1063/1.4996580","project":[{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"volume":58,"oa":1,"publication_status":"published","date_published":"2017-08-01T00:00:00Z","external_id":{"arxiv":["1703.04616"],"isi":["000409197200015"]},"publication_identifier":{"issn":["0022-2488"]},"doi":"10.1063/1.4996580","department":[{"_id":"RoSe"}],"author":[{"full_name":"Deuchert, Andreas","first_name":"Andreas","orcid":"0000-0003-3146-6746","last_name":"Deuchert","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","isi":1,"citation":{"ista":"Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions at infinity. Journal of Mathematical Physics. 58(8), 081901.","mla":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8, 081901, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>.","ama":"Deuchert A. A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. 2017;58(8). doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>","apa":"Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>","chicago":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>.","short":"A. Deuchert, Journal of Mathematical Physics 58 (2017).","ieee":"A. Deuchert, “A lower bound for the BCS functional with boundary conditions at infinity,” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8. AIP Publishing, 2017."},"publisher":"AIP Publishing","status":"public","issue":"8","das_tickbox":"1","article_number":"081901","type":"journal_article","article_processing_charge":"No","year":"2017","publist_id":"6531","main_file_link":[{"url":"https://arxiv.org/abs/1703.04616","open_access":"1"}],"abstract":[{"lang":"eng","text":"We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"}],"title":"A lower bound for the BCS functional with boundary conditions at infinity","intvolume":"        58","month":"08","arxiv":1,"date_updated":"2026-07-07T13:10:46Z","publication":"Journal of Mathematical Physics"},{"type":"journal_article","pmid":1,"article_processing_charge":"No","das_tickbox":"1","publication":"Journal of Theoretical Biology","file":[{"file_id":"7047","access_level":"open_access","date_updated":"2020-07-14T12:47:58Z","file_name":"2017_JournTheoretBio_Priklopil.pdf","relation":"main_file","creator":"dernst","checksum":"4b43af1615ebf1a861840cb03d8a320c","content_type":"application/pdf","file_size":537323,"date_created":"2019-11-19T07:57:39Z"}],"month":"11","date_updated":"2026-07-07T13:11:54Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"In evolutionary game theory interactions between individuals are often assumed obligatory. However, in many real-life situations, individuals can decide to opt out of an interaction depending on the information they have about the opponent. We consider a simple evolutionary game theoretic model to study such a scenario, where at each encounter between two individuals the type of the opponent (cooperator/defector) is known with some probability, and where each individual either accepts or opts out of the interaction. If the type of the opponent is unknown, a trustful individual accepts the interaction, whereas a suspicious individual opts out of the interaction. If either of the two individuals opt out both individuals remain without an interaction. We show that in the prisoners dilemma optional interactions along with suspicious behaviour facilitates the emergence of trustful cooperation.","lang":"eng"}],"publist_id":"6923","year":"2017","has_accepted_license":"1","title":"Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma","intvolume":"       433","fulldoi":"https://doi.org/10.1016/j.jtbi.2017.08.025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"volume":433,"date_created":"2018-12-11T11:48:16Z","day":"21","ec_funded":1,"ddc":["000","570"],"_id":"744","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","corr_author":"1","quality_controlled":"1","citation":{"short":"T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.","ieee":"T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” <i>Journal of Theoretical Biology</i>, vol. 433. Elsevier, pp. 64–72, 2017.","apa":"Priklopil, T., Chatterjee, K., &#38; Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>","chicago":"Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>.","ama":"Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. 2017;433:64-72. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>","ista":"Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.","mla":"Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>, vol. 433, Elsevier, 2017, pp. 64–72, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>."},"isi":1,"author":[{"full_name":"Priklopil, Tadeas","first_name":"Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"page":"64 - 72","status":"public","publisher":"Elsevier","article_type":"original","date_published":"2017-11-21T00:00:00Z","publication_identifier":{"issn":["0022-5193"]},"external_id":{"isi":["000412039800007"],"pmid":["28867224"]},"doi":"10.1016/j.jtbi.2017.08.025","file_date_updated":"2020-07-14T12:47:58Z","department":[{"_id":"KrCh"}]}]