[{"department":[{"_id":"ToBo"}],"date_updated":"2025-09-23T09:58:54Z","_id":"9765","status":"public","author":[{"first_name":"Guillaume","full_name":"Chevereau, Guillaume","id":"424D78A0-F248-11E8-B48F-1D18A9856A87","last_name":"Chevereau"},{"first_name":"Marta","full_name":"Lukacisinova, Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-8004","last_name":"Lukacisinova"},{"last_name":"Batur","first_name":"Tugce","full_name":"Batur, Tugce"},{"last_name":"Guvenek","full_name":"Guvenek, Aysegul","first_name":"Aysegul"},{"last_name":"Ayhan","first_name":"Dilay Hazal","full_name":"Ayhan, Dilay Hazal"},{"last_name":"Toprak","first_name":"Erdal","full_name":"Toprak, Erdal"},{"first_name":"Mark Tobias","full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","orcid":"0000-0003-4398-476X"}],"date_created":"2021-08-03T07:05:16Z","publisher":"Public Library of Science","doi":"10.1371/journal.pbio.1002299.s008","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"1619","relation":"used_in_publication"}]},"title":"Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"18","year":"2015","article_processing_charge":"No","citation":{"apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak, E., &#38; Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>","ieee":"G. Chevereau <i>et al.</i>, “Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak, M.T. Bollenbach, (2015).","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>","mla":"Chevereau, Guillaume, et al. <i>Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>."},"type":"research_data_reference","date_published":"2015-11-18T00:00:00Z","month":"11"},{"title":"Description of the agent based simulations","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2015","day":"18","citation":{"ieee":"B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.” Public Library of Science, 2015.","chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of the Agent Based Simulations.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>.","apa":"Trubenova, B., Novak, S., &#38; Hager, R. (2015). Description of the agent based simulations. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>","ista":"Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","ama":"Trubenova B, Novak S, Hager R. Description of the agent based simulations. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>","mla":"Trubenova, Barbora, et al. <i>Description of the Agent Based Simulations</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","short":"B. Trubenova, S. Novak, R. Hager, (2015)."},"article_processing_charge":"No","date_published":"2015-05-18T00:00:00Z","type":"research_data_reference","month":"05","_id":"9772","department":[{"_id":"NiBa"}],"date_updated":"2025-09-23T09:21:54Z","author":[{"orcid":"0000-0002-6873-2967","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora","full_name":"Trubenova, Barbora"},{"first_name":"Sebastian","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","orcid":"0000-0002-2519-824X"},{"last_name":"Hager","full_name":"Hager, Reinmar","first_name":"Reinmar"}],"status":"public","publisher":"Public Library of Science","date_created":"2021-08-05T12:55:20Z","doi":"10.1371/journal.pone.0126907.s003","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1809"}]},"oa_version":"Published Version"},{"author":[{"first_name":"Tamar","full_name":"Friedlander, Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","last_name":"Friedlander"},{"last_name":"Mayo","full_name":"Mayo, Avraham E.","first_name":"Avraham E."},{"last_name":"Tlusty","full_name":"Tlusty, Tsvi","first_name":"Tsvi"},{"last_name":"Alon","first_name":"Uri","full_name":"Alon, Uri"}],"status":"public","_id":"9773","date_updated":"2025-09-23T08:43:16Z","department":[{"_id":"GaTk"}],"oa_version":"Published Version","related_material":{"record":[{"id":"1827","status":"public","relation":"used_in_publication"}]},"doi":"10.1371/journal.pcbi.1004055.s002","date_created":"2021-08-05T12:58:07Z","publisher":"Public Library of Science","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Evolutionary simulation code","month":"03","date_published":"2015-03-23T00:00:00Z","type":"research_data_reference","citation":{"ama":"Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>","ista":"Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>.","mla":"Friedlander, Tamar, et al. <i>Evolutionary Simulation Code</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>.","short":"T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).","ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation code.” Public Library of Science, 2015.","apa":"Friedlander, T., Mayo, A. E., Tlusty, T., &#38; Alon, U. (2015). Evolutionary simulation code. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">https://doi.org/10.1371/journal.pcbi.1004055.s002</a>","chicago":"Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary Simulation Code.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">https://doi.org/10.1371/journal.pcbi.1004055.s002</a>."},"article_processing_charge":"No","year":"2015","day":"23"},{"status":"public","author":[{"last_name":"Zeljkovic","first_name":"Ilija","full_name":"Zeljkovic, Ilija"},{"last_name":"Okada","full_name":"Okada, Yoshinori","first_name":"Yoshinori"},{"full_name":"Maksym Serbyn","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","last_name":"Serbyn"},{"first_name":"Raman","full_name":"Sankar, Raman","last_name":"Sankar"},{"full_name":"Walkup, Daniel","first_name":"Daniel","last_name":"Walkup"},{"first_name":"Wenwen","full_name":"Zhou, Wenwen","last_name":"Zhou"},{"first_name":"Junwei","full_name":"Liu, Junwei","last_name":"Liu"},{"full_name":"Chang, Guoqing","first_name":"Guoqing","last_name":"Chang"},{"full_name":"Wang, Yungjui","first_name":"Yungjui","last_name":"Wang"},{"last_name":"Hasan","first_name":"Md","full_name":"Hasan, Md Z"},{"first_name":"Fangcheng","full_name":"Chou, Fangcheng","last_name":"Chou"},{"first_name":"Hsin","full_name":"Lin, Hsin","last_name":"Lin"},{"last_name":"Bansil","first_name":"Arun","full_name":"Bansil, Arun"},{"last_name":"Fu","first_name":"Liang","full_name":"Fu, Liang"},{"last_name":"Madhavan","first_name":"Vidya","full_name":"Madhavan, Vidya"}],"oa":1,"date_updated":"2021-01-12T08:22:24Z","_id":"981","intvolume":"        14","main_file_link":[{"url":"https://arxiv.org/abs/1403.4906","open_access":"1"}],"quality_controlled":0,"issue":"3","doi":"10.1038/nmat4215","page":"318 - 324","publist_id":"6419","publisher":"Nature Publishing Group","date_created":"2018-12-11T11:49:31Z","publication":"Nature Materials","title":"Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators","abstract":[{"text":"The tunability of topological surface states and controllable opening of the Dirac gap are of fundamental and practical interest in the field of topological materials. In the newly discovered topological crystalline insulators (TCIs), theory predicts that the Dirac node is protected by a crystalline symmetry and that the surface state electrons can acquire a mass if this symmetry is broken. Recent studies have detected signatures of a spontaneously generated Dirac gap in TCIs; however, the mechanism of mass formation remains elusive. In this work, we present scanning tunnelling microscopy (STM) measurements of the TCI Pb 1â'x Sn x Se for a wide range of alloy compositions spanning the topological and non-topological regimes. The STM topographies reveal a symmetry-breaking distortion on the surface, which imparts mass to the otherwise massless Dirac electrons-a mechanism analogous to the long sought-after Higgs mechanism in particle physics. Interestingly, the measured Dirac gap decreases on approaching the trivial phase, whereas the magnitude of the distortion remains nearly constant. Our data and calculations reveal that the penetration depth of Dirac surface states controls the magnitude of the Dirac mass. At the limit of the critical composition, the penetration depth is predicted to go to infinity, resulting in zero mass, consistent with our measurements. Finally, we discover the existence of surface states in the non-topological regime, which have the characteristics of gapped, double-branched Dirac fermions and could be exploited in realizing superconductivity in these materials.","lang":"eng"}],"acknowledgement":"We thank R. Buczko, C. Chamon, J. C. Seamus Davis, M. El-Batanouny, A. Mesaros, Y. Ran and A. Soumyanarayanan for useful conversations and G. McMahon for help with EDS measurements. V.M. gratefully acknowledges funding from the US Department of Energy, Scanned Probe Division under Award Number DE-FG02-12ER46880 for the support of I.Z., Y.O., W.Z. and D.W. for this project. Work at Massachusetts Institute of Technology is supported by US Department of Energy, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering under Award DE-SC0010526 (L.F.), and NSF-DMR-1104498 (M.S.). H.L. acknowledges the Singapore National Research Foundation for support under NRF Award No. NRF-NRFF2013-03. Y.O. was partly supported by JSPS KAKENHI Grant Numbers 26707016 and 00707656. The work at Northeastern University is supported by the US Department of Energy grant number DE-FG02-07ER46352, and benefited from Northeastern University’s Advanced Scientific Computation Center (ASCC), theory support at the Advanced Light Source, Berkeley and the allocation of supercomputer time at the NERSC through DOE grant number DE-AC02-05CH11231. Work at Princeton University is supported by the US National Science Foundation Grant, NSF-DMR-1006492. F.C. acknowledges the support provided by MOST-Taiwan under project number NSC-102-2119-M-002-004.","date_published":"2015-03-01T00:00:00Z","type":"journal_article","month":"03","extern":1,"publication_status":"published","day":"01","year":"2015","citation":{"ama":"Zeljkovic I, Okada Y, Serbyn M, et al. Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. <i>Nature Materials</i>. 2015;14(3):318-324. doi:<a href=\"https://doi.org/10.1038/nmat4215\">10.1038/nmat4215</a>","ista":"Zeljkovic I, Okada Y, Serbyn M, Sankar R, Walkup D, Zhou W, Liu J, Chang G, Wang Y, Hasan M, Chou F, Lin H, Bansil A, Fu L, Madhavan V. 2015. Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. Nature Materials. 14(3), 318–324.","mla":"Zeljkovic, Ilija, et al. “Dirac Mass Generation from Crystal Symmetry Breaking on the Surfaces of Topological Crystalline Insulators.” <i>Nature Materials</i>, vol. 14, no. 3, Nature Publishing Group, 2015, pp. 318–24, doi:<a href=\"https://doi.org/10.1038/nmat4215\">10.1038/nmat4215</a>.","short":"I. Zeljkovic, Y. Okada, M. Serbyn, R. Sankar, D. Walkup, W. Zhou, J. Liu, G. Chang, Y. Wang, M. Hasan, F. Chou, H. Lin, A. Bansil, L. Fu, V. Madhavan, Nature Materials 14 (2015) 318–324.","ieee":"I. Zeljkovic <i>et al.</i>, “Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators,” <i>Nature Materials</i>, vol. 14, no. 3. Nature Publishing Group, pp. 318–324, 2015.","chicago":"Zeljkovic, Ilija, Yoshinori Okada, Maksym Serbyn, Raman Sankar, Daniel Walkup, Wenwen Zhou, Junwei Liu, et al. “Dirac Mass Generation from Crystal Symmetry Breaking on the Surfaces of Topological Crystalline Insulators.” <i>Nature Materials</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nmat4215\">https://doi.org/10.1038/nmat4215</a>.","apa":"Zeljkovic, I., Okada, Y., Serbyn, M., Sankar, R., Walkup, D., Zhou, W., … Madhavan, V. (2015). Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. <i>Nature Materials</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nmat4215\">https://doi.org/10.1038/nmat4215</a>"},"volume":14},{"type":"journal_article","date_published":"2015-01-01T00:00:00Z","month":"01","year":"2015","extern":1,"publication_status":"published","day":"01","citation":{"ista":"Serbyn M, Papić Z, Abanin D. 2015. Criterion for many-body localization-delocalization phase transition. Physical Review X. 5(4).","ama":"Serbyn M, Papić Z, Abanin D. Criterion for many-body localization-delocalization phase transition. <i>Physical Review X</i>. 2015;5(4). doi:<a href=\"https://doi.org/10.1103/PhysRevX.5.041047\">10.1103/PhysRevX.5.041047</a>","mla":"Serbyn, Maksym, et al. “Criterion for Many-Body Localization-Delocalization Phase Transition.” <i>Physical Review X</i>, vol. 5, no. 4, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevX.5.041047\">10.1103/PhysRevX.5.041047</a>.","short":"M. Serbyn, Z. Papić, D. Abanin, Physical Review X 5 (2015).","ieee":"M. Serbyn, Z. Papić, and D. Abanin, “Criterion for many-body localization-delocalization phase transition,” <i>Physical Review X</i>, vol. 5, no. 4. American Physical Society, 2015.","apa":"Serbyn, M., Papić, Z., &#38; Abanin, D. (2015). Criterion for many-body localization-delocalization phase transition. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevX.5.041047\">https://doi.org/10.1103/PhysRevX.5.041047</a>","chicago":"Serbyn, Maksym, Zlatko Papić, and Dmitry Abanin. “Criterion for Many-Body Localization-Delocalization Phase Transition.” <i>Physical Review X</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevX.5.041047\">https://doi.org/10.1103/PhysRevX.5.041047</a>."},"volume":5,"title":"Criterion for many-body localization-delocalization phase transition","abstract":[{"text":"We propose a new approach to probing ergodicity and its breakdown in one-dimensional quantum manybody systems based on their response to a local perturbation. We study the distribution of matrix elements of a local operator between the system's eigenstates, finding a qualitatively different behavior in the manybody localized (MBL) and ergodic phases. To characterize how strongly a local perturbation modifies the eigenstates, we introduce the parameter g(L) = (In (Vnm/δ)) which represents the disorder-averaged ratio of a typical matrix element of a local operator V to energy level spacing δ this parameter is reminiscent of the Thouless conductance in the single-particle localization. We show that the parameter g(L) decreases with system size L in the MBL phase and grows in the ergodic phase. We surmise that the delocalization transition occurs when g(L) is independent of system size, g(L)=gc ~ 1. We illustrate our approach by studying the many-body localization transition and resolving the many-body mobility edge in a disordered one-dimensional XXZ spin-1=2 chain using exact diagonalization and time-evolving block-decimation methods. Our criterion for the MBL transition gives insights into microscopic details of transition. Its direct physical consequences, in particular, logarithmically slow transport at the transition and extensive entanglement entropy of the eigenstates, are consistent with recent renormalization-group predictions.","lang":"eng"}],"acknowledgement":"We acknowledge helpful discussions with Sid Parameswaran, Andrew Potter, Antonello Scardicchio, Romain Vasseur, and especially with Ehud Altman and David Huse. We would like to thank Miles Stoudenmire for the assistance with ITensor library. Research at Perimeter Institute is supported by the Government of Canada through Industry Canada and by the Province of Ontario through the Ministry of Economic Development & Innovation. This research was supported by Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4307 (M. S.), Sloan Foundation, NSERC, and Early Researcher Award of Ontario (D. A.). This work made use of the facilities of N8 HPC Centre of Excellence, provided and funded by the N8 consortium and EPSRC (Grant No. EP/K000225/1). The Centre is coordinated by the Universities of Leeds and Manchester.","issue":"4","doi":"10.1103/PhysRevX.5.041047","publist_id":"6418","publisher":"American Physical Society","date_created":"2018-12-11T11:49:32Z","publication":"Physical Review X","status":"public","oa":1,"author":[{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Maksym Serbyn","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Papić","full_name":"Papić, Zlatko","first_name":"Zlatko"},{"last_name":"Abanin","full_name":"Abanin, Dmitry A","first_name":"Dmitry"}],"date_updated":"2021-01-12T08:22:25Z","_id":"982","quality_controlled":0,"intvolume":"         5","main_file_link":[{"url":"https://arxiv.org/abs/1507.01635","open_access":"1"}]},{"date_published":"2015-09-14T00:00:00Z","volume":11,"citation":{"apa":"Higginbotham, A. P., Albrecht, S. M., Kiršanskas, G., Chang, W., Kuemmeth, F., Krogstrup, P., … Marcus, C. (2015). Parity lifetime of bound states in a proximitized semiconductor nanowire. <i>Nature Physics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nphys3461\">https://doi.org/10.1038/nphys3461</a>","ieee":"A. P. Higginbotham <i>et al.</i>, “Parity lifetime of bound states in a proximitized semiconductor nanowire,” <i>Nature Physics</i>, vol. 11, no. 12. Nature Publishing Group, pp. 1017–1021, 2015.","chicago":"Higginbotham, Andrew P, S M Albrecht, Gediminas Kiršanskas, W Chang, Ferdinand Kuemmeth, Peter Krogstrup, Thomas Jespersen, Jesper Nygård, Karsten Flensberg, and Charles Marcus. “Parity Lifetime of Bound States in a Proximitized Semiconductor Nanowire.” <i>Nature Physics</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nphys3461\">https://doi.org/10.1038/nphys3461</a>.","mla":"Higginbotham, Andrew P., et al. “Parity Lifetime of Bound States in a Proximitized Semiconductor Nanowire.” <i>Nature Physics</i>, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 1017–21, doi:<a href=\"https://doi.org/10.1038/nphys3461\">10.1038/nphys3461</a>.","ista":"Higginbotham AP, Albrecht SM, Kiršanskas G, Chang W, Kuemmeth F, Krogstrup P, Jespersen T, Nygård J, Flensberg K, Marcus C. 2015. Parity lifetime of bound states in a proximitized semiconductor nanowire. Nature Physics. 11(12), 1017–1021.","ama":"Higginbotham AP, Albrecht SM, Kiršanskas G, et al. Parity lifetime of bound states in a proximitized semiconductor nanowire. <i>Nature Physics</i>. 2015;11(12):1017-1021. doi:<a href=\"https://doi.org/10.1038/nphys3461\">10.1038/nphys3461</a>","short":"A.P. Higginbotham, S.M. Albrecht, G. Kiršanskas, W. Chang, F. Kuemmeth, P. Krogstrup, T. Jespersen, J. Nygård, K. Flensberg, C. Marcus, Nature Physics 11 (2015) 1017–1021."},"publication_status":"published","day":"14","author":[{"first_name":"Andrew P","full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","last_name":"Higginbotham","orcid":"0000-0003-2607-2363"},{"first_name":"S M","full_name":"Albrecht, S M","last_name":"Albrecht"},{"last_name":"Kiršanskas","full_name":"Kiršanskas, Gediminas","first_name":"Gediminas"},{"first_name":"W","full_name":"Chang, W","last_name":"Chang"},{"last_name":"Kuemmeth","full_name":"Kuemmeth, Ferdinand","first_name":"Ferdinand"},{"last_name":"Krogstrup","first_name":"Peter","full_name":"Krogstrup, Peter"},{"first_name":"Thomas","full_name":"Jespersen, Thomas","last_name":"Jespersen"},{"full_name":"Nygård, Jesper","first_name":"Jesper","last_name":"Nygård"},{"full_name":"Flensberg, Karsten","first_name":"Karsten","last_name":"Flensberg"},{"first_name":"Charles","full_name":"Marcus, Charles","last_name":"Marcus"}],"oa":1,"status":"public","quality_controlled":"1","intvolume":"        11","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1501.05155"}],"date_updated":"2021-01-12T08:22:28Z","oa_version":"Preprint","page":"1017 - 1021","arxiv":1,"publication":"Nature Physics","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:37Z","publisher":"Nature Publishing Group","abstract":[{"text":"Quasiparticle excitations can compromise the performance of superconducting devices, causing high-frequency dissipation, decoherence in Josephson qubits, and braiding errors in proposed Majorana-based topological quantum computers. Quasiparticle dynamics have been studied in detail in metallic superconductors but remain relatively unexplored in semiconductor-superconductor structures, which are now being intensely pursued in the context of topological superconductivity. To this end, we use a system comprising a gate-confined semiconductor nanowire with an epitaxially grown superconductor layer, yielding an isolated, proximitized nanowire segment. We identify bound states in the semiconductor by means of bias spectroscopy, determine the characteristic temperatures and magnetic fields for quasiparticle excitations, and extract a parity lifetime (poisoning time) of the bound state in the semiconductor exceeding 10 ms.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Parity lifetime of bound states in a proximitized semiconductor nanowire","acknowledgement":"Research support by Microsoft Project Q, the Danish National Research Foundation, the Lundbeck Foundation, the Carlsberg Foundation, and the European Commission. A.P.H. acknowledges support from the US Department of Energy, C.M.M. acknowledges support from the Villum Foundation.","month":"09","type":"journal_article","external_id":{"arxiv":["1501.05155"]},"extern":"1","year":"2015","_id":"99","publist_id":"7955","doi":"10.1038/nphys3461","issue":"12"},{"abstract":[{"lang":"eng","text":"We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na2IrO3. Above the antiferromagnetic ordering temperature (TN) the system response is due to both Hubbard excitons (HE) and their constituent unpaired SE. The SE response becomes strongly suppressed immediately below TN. We argue that this increase in binding energy is due to a unique interplay between the frustrated Kitaev and the weak Heisenberg-type ordering term in the Hamiltonian, mediating an effective interaction between the spin-singlet SE. This interaction grows with distance causing the SE to become trapped in the HE, similar to quark confinement inside hadrons. This binding of charged particles, induced by magnetic ordering, is a result of a confinement-deconfinement transition of spin excitations. This observation provides evidence for spin liquid type behavior which is expected in Na2IrO3."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3","volume":114,"article_processing_charge":"No","citation":{"ieee":"Z. Alpichshev, F. Mahmood, G. Cao, and N. Gedik, “Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3,” <i>Physical Review Letters</i>, vol. 114, no. 1. American Physical Society, 2015.","apa":"Alpichshev, Z., Mahmood, F., Cao, G., &#38; Gedik, N. (2015). Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">https://doi.org/10.1103/PhysRevLett.114.017203</a>","chicago":"Alpichshev, Zhanybek, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” <i>Physical Review Letters</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">https://doi.org/10.1103/PhysRevLett.114.017203</a>.","short":"Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015).","mla":"Alpichshev, Zhanybek, et al. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” <i>Physical Review Letters</i>, vol. 114, no. 1, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">10.1103/PhysRevLett.114.017203</a>.","ama":"Alpichshev Z, Mahmood F, Cao G, Gedik N. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. <i>Physical Review Letters</i>. 2015;114(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">10.1103/PhysRevLett.114.017203</a>","ista":"Alpichshev Z, Mahmood F, Cao G, Gedik N. 2015. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 114(1)."},"publication_status":"published","day":"07","year":"2015","extern":"1","month":"07","type":"journal_article","date_published":"2015-07-07T00:00:00Z","quality_controlled":"1","main_file_link":[{"url":"https://dspace.mit.edu/handle/1721.1/92979","open_access":"1"}],"intvolume":"       114","_id":"388","date_updated":"2021-01-12T07:52:54Z","author":[{"orcid":"0000-0002-7183-5203","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Alpichshev, Zhanybek","first_name":"Zhanybek"},{"last_name":"Mahmood","full_name":"Mahmood, Fahad","first_name":"Fahad"},{"full_name":"Cao, Gang","first_name":"Gang","last_name":"Cao"},{"last_name":"Gedik","first_name":"Nuh","full_name":"Gedik, Nuh"}],"oa":1,"status":"public","publication":"Physical Review Letters","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:46:11Z","publisher":"American Physical Society","publist_id":"7441","article_type":"original","oa_version":"Published Version","doi":"10.1103/PhysRevLett.114.017203","issue":"1"},{"has_accepted_license":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"date_published":"2015-01-01T00:00:00Z","pubrep_id":"951","ddc":["539"],"day":"01","publication_status":"published","citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2015. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>.","apa":"Lewin, M., Nam, P., &#38; Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2015;2:65-115. doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115."},"volume":2,"status":"public","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"last_name":"Phan Thanh","first_name":"Nam","full_name":"Phan Thanh, Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rougerie","first_name":"Nicolas","full_name":"Rougerie, Nicolas"}],"oa":1,"file":[{"relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_size":1084254,"access_level":"open_access","date_created":"2018-12-12T10:12:53Z","file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","checksum":"a40eb4016717ddc9927154798a4c164a","file_id":"4974"}],"date_updated":"2021-01-12T08:00:52Z","quality_controlled":"1","intvolume":"         2","page":"65 - 115","oa_version":"Published Version","publisher":"Ecole Polytechnique","date_created":"2018-12-11T11:46:40Z","language":[{"iso":"eng"}],"publication":"Journal de l'Ecole Polytechnique - Mathematiques","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","type":"journal_article","month":"01","year":"2015","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"department":[{"_id":"RoSe"}],"_id":"473","doi":"10.5802/jep.18","scopus_import":1,"publist_id":"7344","file_date_updated":"2020-07-14T12:46:35Z","ec_funded":1},{"quality_controlled":"1","intvolume":"       128","date_updated":"2025-09-23T14:16:38Z","isi":1,"author":[{"full_name":"Holst, Katrin","first_name":"Katrin","last_name":"Holst"},{"last_name":"Guseva","full_name":"Guseva, Daria","first_name":"Daria"},{"last_name":"Schindler","first_name":"Susann","full_name":"Schindler, Susann"},{"full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179"},{"last_name":"Braun","first_name":"Armin","full_name":"Braun, Armin"},{"last_name":"Chopra","full_name":"Chopra, Himpriya","first_name":"Himpriya"},{"first_name":"Oliver","full_name":"Pabst, Oliver","last_name":"Pabst"},{"last_name":"Ponimaskin","full_name":"Ponimaskin, Evgeni","first_name":"Evgeni"}],"status":"public","publication":"Journal of Cell Science","language":[{"iso":"eng"}],"publisher":"Company of Biologists","date_created":"2018-12-11T11:46:41Z","oa_version":"None","page":"2866 - 2880","volume":128,"citation":{"short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. 2015;128(15):2866-2880. doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>","mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>.","ieee":"K. Holst <i>et al.</i>, “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” <i>Journal of Cell Science</i>, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>."},"article_processing_charge":"No","day":"15","publication_status":"published","date_published":"2015-06-15T00:00:00Z","_id":"477","department":[{"_id":"MiSi"}],"publist_id":"7343","scopus_import":"1","issue":"15","doi":"10.1242/jcs.167999","abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","external_id":{"isi":["000359782100013"]},"year":"2015","month":"06","type":"journal_article"},{"month":"03","type":"journal_article","external_id":{"isi":["000355664900003"],"arxiv":["1302.4248"]},"year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Looking at mean-payoff and total-payoff through windows","abstract":[{"lang":"eng","text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window."}],"issue":"6","doi":"10.1016/j.ic.2015.03.010","publist_id":"7296","scopus_import":"1","ec_funded":1,"department":[{"_id":"KrCh"}],"_id":"523","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_published":"2015-03-24T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. 2015;242(6):25-52. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>."},"article_processing_charge":"No","day":"24","publication_status":"published","volume":242,"related_material":{"record":[{"status":"public","id":"2279","relation":"earlier_version"}]},"oa_version":"Preprint","page":"25 - 52","arxiv":1,"publisher":"Elsevier","date_created":"2018-12-11T11:46:57Z","publication":"Information and Computation","language":[{"iso":"eng"}],"status":"public","isi":1,"oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"}],"date_updated":"2025-09-23T09:29:55Z","intvolume":"       242","main_file_link":[{"url":"https://arxiv.org/abs/1302.4248","open_access":"1"}],"quality_controlled":"1"},{"isi":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389"}],"oa":1,"status":"public","intvolume":"       242","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1409.5306","open_access":"1"}],"date_updated":"2025-09-23T09:56:28Z","related_material":{"record":[{"id":"5403","status":"public","relation":"earlier_version"}]},"oa_version":"Preprint","arxiv":1,"page":"2 - 24","publication":"Information and Computation","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:46:57Z","publisher":"Elsevier","date_published":"2015-10-11T00:00:00Z","corr_author":"1","volume":242,"article_processing_charge":"No","citation":{"chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>.","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. 2015;242(6):2-24. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24."},"day":"11","publication_status":"published","_id":"524","department":[{"_id":"KrCh"}],"publist_id":"7295","scopus_import":"1","issue":"6","doi":"10.1016/j.ic.2015.03.009","abstract":[{"lang":"eng","text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Qualitative analysis of concurrent mean payoff games","month":"10","type":"journal_article","external_id":{"arxiv":["1409.5306"],"isi":["000355664900002"]},"year":"2015"},{"volume":163,"article_processing_charge":"No","citation":{"mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>.","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. 2015;163(3):670-683. doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>","ieee":"W. Li <i>et al.</i>, “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” <i>Cell</i>, vol. 163, no. 3. Cell Press, pp. 670–683, 2015."},"day":"22","publication_status":"published","date_published":"2015-10-22T00:00:00Z","intvolume":"       163","quality_controlled":"1","date_updated":"2025-09-23T08:40:43Z","isi":1,"author":[{"last_name":"Li","full_name":"Li, Wenyang","first_name":"Wenyang"},{"last_name":"Ma","full_name":"Ma, Mengdi","first_name":"Mengdi"},{"first_name":"Ying","full_name":"Feng, Ying","last_name":"Feng"},{"first_name":"Hongjiang","full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660","last_name":"Li"},{"first_name":"Yichuan","full_name":"Wang, Yichuan","last_name":"Wang"},{"last_name":"Ma","first_name":"Yutong","full_name":"Ma, Yutong"},{"last_name":"Li","first_name":"Mingzhe","full_name":"Li, Mingzhe"},{"last_name":"An","first_name":"Fengying","full_name":"An, Fengying"},{"last_name":"Guo","full_name":"Guo, Hongwei","first_name":"Hongwei"}],"status":"public","publication":"Cell","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:47:00Z","publisher":"Cell Press","oa_version":"None","page":"670 - 683","abstract":[{"lang":"eng","text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","external_id":{"isi":["000364828900020"]},"year":"2015","month":"10","type":"journal_article","_id":"532","department":[{"_id":"JiFr"}],"publist_id":"7285","scopus_import":"1","doi":"10.1016/j.cell.2015.09.037","issue":"3"},{"has_accepted_license":"1","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been 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.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem 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.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"ddc":["004"],"publication_status":"published","year":"2015","day":"12","pubrep_id":"318","citation":{"ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015."},"date_published":"2015-01-12T00:00:00Z","type":"technical_report","month":"01","_id":"5429","department":[{"_id":"KrCh"}],"date_updated":"2025-09-29T11:00:42Z","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Komarkova","full_name":"Komarkova, Zuzana","first_name":"Zuzana"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"file":[{"creator":"system","relation":"main_file","date_updated":"2020-07-14T12:46:52Z","content_type":"application/pdf","file_size":689863,"access_level":"open_access","date_created":"2018-12-12T11:54:11Z","file_name":"IST-2015-318-v1+1_main.pdf","checksum":"e4869a584567c506349abda9c8ec7db3","file_id":"5533"}],"status":"public","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:39:17Z","publisher":"IST Austria","doi":"10.15479/AT:IST-2015-318-v1-1","page":"41","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"status":"public","id":"5435","relation":"later_version"},{"relation":"later_version","status":"public","id":"466"},{"relation":"later_version","status":"public","id":"1657"}]},"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"publisher":"IST Austria","date_created":"2018-12-12T11:39:17Z","file_date_updated":"2020-07-14T12:46:52Z","related_material":{"record":[{"id":"5437","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"1607"}]},"oa_version":"Published Version","doi":"10.15479/AT:IST-2015-319-v1-1","publication_identifier":{"issn":["2664-1690"]},"page":"31","_id":"5430","date_updated":"2025-09-23T08:47:23Z","department":[{"_id":"KrCh"}],"file":[{"file_name":"IST-2015-319-v1+1_long.pdf","checksum":"62c6ea01e342553dcafb88a070fb1ad5","file_id":"5482","access_level":"open_access","date_created":"2018-12-12T11:53:21Z","content_type":"application/pdf","file_size":1089651,"relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:52Z"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"oa":1,"status":"public","alternative_title":["IST Austria Technical Report"],"citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015."},"publication_status":"published","year":"2015","pubrep_id":"319","day":"10","ddc":["000"],"month":"02","date_published":"2015-02-10T00:00:00Z","type":"technical_report","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Faster algorithms for quantitative verification in constant treewidth graphs"},{"publisher":"IST Austria","date_created":"2018-12-12T11:39:17Z","file_date_updated":"2020-07-14T12:46:53Z","language":[{"iso":"eng"}],"oa_version":"Published Version","page":"25","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2015-322-v1-1","date_updated":"2021-01-12T08:02:13Z","department":[{"_id":"KrCh"}],"_id":"5431","status":"public","file":[{"access_level":"open_access","date_created":"2018-12-12T11:53:31Z","file_name":"IST-2015-322-v1+1_safetygames.pdf","checksum":"bfb858262c30445b8e472c40069178a2","file_id":"5491","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:46:53Z","file_size":661015,"content_type":"application/pdf"}],"oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"first_name":"Kristoffer","full_name":"Hansen, Kristoffer","last_name":"Hansen"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","mla":"Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria, 2015."},"year":"2015","publication_status":"published","ddc":["005","519"],"day":"19","pubrep_id":"322","alternative_title":["IST Austria Technical Report"],"month":"02","date_published":"2015-02-19T00:00:00Z","type":"technical_report","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The patience of concurrent stochastic games with safety and reachability objectives","abstract":[{"text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential.","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n"}],"title":"The complexity of evolutionary games on graphs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","type":"technical_report","date_published":"2015-02-19T00:00:00Z","month":"02","alternative_title":["IST Austria Technical Report"],"day":"19","ddc":["005","576"],"pubrep_id":"323","publication_status":"published","year":"2015","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>."},"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"oa":1,"file":[{"date_created":"2018-12-12T11:53:57Z","access_level":"open_access","file_id":"5519","checksum":"546c1b291d545e7b24aaaf4199dac671","file_name":"IST-2015-323-v1+1_main.pdf","date_updated":"2020-07-14T12:46:53Z","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":576347}],"status":"public","_id":"5432","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:26:33Z","page":"29","doi":"10.15479/AT:IST-2015-323-v1-1","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"id":"5421","status":"public","relation":"earlier_version"},{"relation":"later_version","id":"5440","status":"public"}]},"oa_version":"Published Version","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:39:18Z","publisher":"IST Austria"},{"_id":"5434","date_updated":"2020-07-14T23:04:59Z","oa":1,"author":[{"last_name":"Anonymous","first_name":"1","full_name":"Anonymous, 1"},{"last_name":"Anonymous","full_name":"Anonymous, 2","first_name":"2"}],"file":[{"date_updated":"2020-07-14T12:46:53Z","creator":"system","relation":"main_file","file_size":378162,"content_type":"application/pdf","date_created":"2018-12-12T11:53:14Z","access_level":"open_access","file_id":"5475","file_name":"IST-2015-326-v1+1_main.pdf","checksum":"8542fd0b10aed7811cd41077b8ccb632"},{"date_created":"2019-04-16T13:00:33Z","access_level":"closed","file_id":"6317","checksum":"84c31c537bdaf7a91909f18d25d640ab","file_name":"IST-2015-326-v1+2_authors.txt","date_updated":"2020-07-14T12:46:53Z","relation":"main_file","creator":"dernst","file_size":64,"content_type":"text/plain"}],"status":"public","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:39:18Z","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"page":"16","oa_version":"Published Version","has_accepted_license":"1","abstract":[{"text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results.","lang":"eng"}],"title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"pubrep_id":"326","ddc":["000"],"year":"2015","day":"19","publication_status":"published","citation":{"chicago":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","ieee":"1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria, 2015.","apa":"Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria.","mla":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria; 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015."},"date_published":"2015-02-19T00:00:00Z","type":"technical_report","month":"02"},{"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been 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.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe 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. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>"},"year":"2015","ddc":["004"],"day":"23","publication_status":"published","pubrep_id":"327","alternative_title":["IST Austria Technical Report"],"month":"02","date_published":"2015-02-23T00:00:00Z","type":"technical_report","date_updated":"2025-09-29T11:00:42Z","department":[{"_id":"KrCh"}],"_id":"5435","status":"public","file":[{"content_type":"application/pdf","file_size":717630,"creator":"system","relation":"main_file","date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-318-v2+1_main.pdf","checksum":"75284adec80baabdfe71ff9ebbc27445","file_id":"5525","access_level":"open_access","date_created":"2018-12-12T11:54:03Z"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Komarkova","first_name":"Zuzana","full_name":"Komarkova, Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"oa":1,"publisher":"IST Austria","date_created":"2018-12-12T11:39:19Z","file_date_updated":"2020-07-14T12:46:53Z","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5429"},{"id":"466","status":"public","relation":"later_version"},{"status":"public","id":"1657","relation":"later_version"}]},"oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"page":"51","doi":"10.15479/AT:IST-2015-318-v2-1"},{"alternative_title":["IST Austria Technical Report"],"publication_status":"published","pubrep_id":"331","year":"2015","ddc":["000"],"day":"24","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>"},"date_published":"2015-04-24T00:00:00Z","type":"technical_report","month":"04","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"title":"Nested weighted automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:54Z","publisher":"IST Austria","date_created":"2018-12-12T11:39:19Z","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2015-170-v2-2","page":"29","oa_version":"Published Version","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5415"},{"id":"467","status":"public","relation":"later_version"},{"id":"1656","status":"public","relation":"later_version"}]},"_id":"5436","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2025-09-23T09:39:58Z","oa":1,"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"file":[{"date_created":"2018-12-12T11:54:19Z","access_level":"open_access","file_id":"5541","file_name":"IST-2015-170-v2+2_report.pdf","checksum":"3c402f47d3669c28d04d1af405a08e3f","date_updated":"2020-07-14T12:46:54Z","creator":"system","relation":"main_file","content_type":"application/pdf","file_size":569991}],"status":"public"},{"type":"technical_report","date_published":"2015-04-27T00:00:00Z","month":"04","ddc":["000"],"pubrep_id":"333","publication_status":"published","day":"27","year":"2015","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>."},"alternative_title":["IST Austria Technical Report"],"title":"Faster algorithms for quantitative verification in constant treewidth graphs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. "}],"has_accepted_license":"1","doi":"10.15479/AT:IST-2015-330-v2-1","page":"27","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","related_material":{"record":[{"id":"5430","status":"public","relation":"earlier_version"},{"status":"public","id":"1607","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:46:54Z","publisher":"IST Austria","date_created":"2018-12-12T11:39:19Z","language":[{"iso":"eng"}],"status":"public","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"file":[{"file_id":"5473","checksum":"f5917c20f84018b362d385c000a2e123","file_name":"IST-2015-330-v2+1_main.pdf","date_created":"2018-12-12T11:53:12Z","access_level":"open_access","content_type":"application/pdf","file_size":1072137,"date_updated":"2020-07-14T12:46:54Z","relation":"main_file","creator":"system"}],"department":[{"_id":"KrCh"}],"date_updated":"2025-09-23T08:47:23Z","_id":"5437"}]