[{"volume":2016,"quality_controlled":"1","department":[{"_id":"PeJo"}],"date_published":"2016-01-01T00:00:00Z","publisher":"Hindawi Publishing Corporation","abstract":[{"text":"ATP released from neurons and astrocytes during neuronal activity or under pathophysiological circumstances is able to influence information flow in neuronal circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent modulation of cellular excitability, synaptic strength, and plasticity. In the present paper we review cellular and network effects of P2Y receptors in the brain. We show that P2Y receptors inhibit the release of neurotransmitters, modulate voltage- and ligand-gated ion channels, and differentially influence the induction of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum. The findings discussed here may explain how P2Y1 receptor activation during brain injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to an impairment of cognitive processes. Hence, it is suggested that the blockade of P2Y1 receptors may have therapeutic potential against cognitive disturbances in these states.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"publication_status":"published","doi":"10.1155/2016/1207393","_id":"1435","file_date_updated":"2020-07-14T12:44:54Z","article_number":"1207393","publist_id":"5762","citation":{"apa":"Guzmán, J., &#38; Gerevich, Z. (2016). P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>","chicago":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>. Hindawi Publishing Corporation, 2016. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>.","mla":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>, vol. 2016, 1207393, Hindawi Publishing Corporation, 2016, doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>.","ista":"Guzmán J, Gerevich Z. 2016. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016, 1207393.","short":"J. Guzmán, Z. Gerevich, Neural Plasticity 2016 (2016).","ama":"Guzmán J, Gerevich Z. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. 2016;2016. doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>","ieee":"J. Guzmán and Z. Gerevich, “P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction,” <i>Neural Plasticity</i>, vol. 2016. Hindawi Publishing Corporation, 2016."},"date_created":"2018-12-11T11:52:00Z","year":"2016","type":"journal_article","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":1395180,"creator":"system","date_created":"2018-12-12T10:09:17Z","date_updated":"2020-07-14T12:44:54Z","file_name":"IST-2016-580-v1+1_1207393.pdf","checksum":"8dc5c2f3d44d4775a6e7e3edb0d7a0da","file_id":"4740"}],"oa_version":"Published Version","day":"01","month":"01","author":[{"full_name":"Guzmán, José","first_name":"José","last_name":"Guzmán","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gerevich","first_name":"Zoltan","full_name":"Gerevich, Zoltan"}],"publication":"Neural Plasticity","language":[{"iso":"eng"}],"scopus_import":1,"intvolume":"      2016","has_accepted_license":"1","title":"P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction","oa":1,"pubrep_id":"580","date_updated":"2021-01-12T06:50:43Z"},{"publication":"Journal de Mathématiques Pures et Appliquées","language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":1,"intvolume":"       105","issue":"1","oa":1,"date_updated":"2021-01-12T06:50:43Z","pubrep_id":"581","title":"Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction","status":"public","type":"journal_article","month":"01","file":[{"date_created":"2018-12-12T10:10:36Z","date_updated":"2020-07-14T12:44:54Z","checksum":"c5afe1f6935bc7f2b546adbde1d31a35","file_id":"4825","file_name":"IST-2016-581-v1+1_1-s2.0-S0021782415001191-main.pdf","access_level":"open_access","relation":"main_file","file_size":658491,"content_type":"application/pdf","creator":"system"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"01","author":[{"full_name":"Bach, Volker","first_name":"Volker","last_name":"Bach"},{"full_name":"Breteaux, Sébastien","first_name":"Sébastien","last_name":"Breteaux"},{"full_name":"Petrat, Sören P","first_name":"Sören P","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrat","orcid":"0000-0002-9166-5889"},{"first_name":"Peter","full_name":"Pickl, Peter","last_name":"Pickl"},{"full_name":"Tzaneteas, Tim","first_name":"Tim","last_name":"Tzaneteas"}],"doi":"10.1016/j.matpur.2015.09.003","_id":"1436","file_date_updated":"2020-07-14T12:44:54Z","ec_funded":1,"year":"2016","publist_id":"5763","citation":{"apa":"Bach, V., Breteaux, S., Petrat, S. P., Pickl, P., &#38; Tzaneteas, T. (2016). Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>","mla":"Bach, Volker, et al. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1, Elsevier, 2016, pp. 1–30, doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>.","ista":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. 2016. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. Journal de Mathématiques Pures et Appliquées. 105(1), 1–30.","chicago":"Bach, Volker, Sébastien Breteaux, Sören P Petrat, Peter Pickl, and Tim Tzaneteas. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>.","short":"V. Bach, S. Breteaux, S.P. Petrat, P. Pickl, T. Tzaneteas, Journal de Mathématiques Pures et Appliquées 105 (2016) 1–30.","ieee":"V. Bach, S. Breteaux, S. P. Petrat, P. Pickl, and T. Tzaneteas, “Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction,” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1. Elsevier, pp. 1–30, 2016.","ama":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. 2016;105(1):1-30. doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>"},"date_created":"2018-12-11T11:52:00Z","date_published":"2016-01-01T00:00:00Z","publisher":"Elsevier","quality_controlled":"1","volume":105,"department":[{"_id":"RoSe"}],"page":"1 - 30","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"ddc":["510","530"],"abstract":[{"text":"We study the time evolution of a system of N spinless fermions in R3 which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system.","lang":"eng"}],"publication_status":"published"},{"abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"external_id":{"arxiv":["1510.07565"]},"publication_status":"published","date_published":"2016-01-11T00:00:00Z","publisher":"ACM","quality_controlled":"1","volume":"20-22","page":"733 - 747","department":[{"_id":"KrCh"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"related_material":{"record":[{"id":"5441","relation":"earlier_version","status":"public"},{"status":"public","id":"5442","relation":"earlier_version"},{"status":"public","relation":"dissertation_contains","id":"821"},{"status":"public","relation":"later_version","id":"6009"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"ec_funded":1,"year":"2016","publist_id":"5761","date_created":"2018-12-11T11:52:01Z","citation":{"ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. Vol. 20–22, ACM, 2016, pp. 733–47, doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>.","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>"},"doi":"10.1145/2837614.2837624","_id":"1437","month":"01","conference":{"start_date":"2016-01-20","name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.07565"}],"arxiv":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady"},{"first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","status":"public","alternative_title":["POPL"],"scopus_import":1,"oa":1,"date_updated":"2024-03-25T23:30:18Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","language":[{"iso":"eng"}]},{"quality_controlled":"1","volume":"20-22","department":[{"_id":"KrCh"}],"page":"327 - 342","date_published":"2016-01-11T00:00:00Z","publisher":"ACM","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism."}],"external_id":{"arxiv":["1510.08517"]},"publication_status":"published","doi":"10.1145/2837614.2837639","_id":"1438","related_material":{"record":[{"status":"public","id":"5993","relation":"later_version"}]},"ec_funded":1,"publist_id":"5760","date_created":"2018-12-11T11:52:01Z","citation":{"ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>.","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs</i>. Vol. 20–22, ACM, 2016, pp. 327–42, doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>"},"year":"2016","acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","type":"conference","status":"public","alternative_title":["POPL"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.08517"}],"day":"11","oa_version":"Preprint","month":"01","conference":{"location":"St. Petersburg, FL, USA","end_date":"2016-01-22","name":"POPL: Principles of Programming Languages","start_date":"2016-01-20"},"arxiv":1,"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu"},{"last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","first_name":"Petr"},{"last_name":"Hasheminezhad","full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh"}],"language":[{"iso":"eng"}],"scopus_import":1,"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","oa":1,"date_updated":"2023-09-19T14:38:41Z"},{"abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.","lang":"eng"}],"publication_status":"published","page":"400 - 415","department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":"20-22","publisher":"ACM","date_published":"2016-01-11T00:00:00Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"ec_funded":1,"date_created":"2018-12-11T11:52:01Z","citation":{"apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2016). PSYNC: A partially synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp. 400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>","ama":"Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous language for fault-tolerant distributed algorithms,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.","ista":"Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>.","mla":"Dragoi, Cezara, et al. <i>PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms</i>. Vol. 20–22, ACM, 2016, pp. 400–15, doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>."},"publist_id":"5759","acknowledgement":"Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192 and FA8650-15-C-7564) and NSF (Grant CCF-1138967). ","year":"2016","doi":"10.1145/2837614.2837650","_id":"1439","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/hal-01251199/"}],"day":"11","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2016-01-20","name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA"},"month":"01","author":[{"last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","full_name":"Zufferey, Damien"}],"alternative_title":["ACM SIGPLAN Notices"],"type":"conference","status":"public","scopus_import":1,"title":"PSYNC: A partially synchronous language for fault-tolerant distributed algorithms","date_updated":"2021-01-12T06:50:45Z","oa":1,"language":[{"iso":"eng"}]},{"date_created":"2018-12-11T11:52:02Z","citation":{"apa":"Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>","ama":"Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. 2016;24(2):213-215. doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>","ieee":"H. L. Janovjak, “Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain,” <i>Structure</i>, vol. 24, no. 2. Cell Press, pp. 213–215, 2016.","short":"H.L. Janovjak, Structure 24 (2016) 213–215.","mla":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>, vol. 24, no. 2, Cell Press, 2016, pp. 213–15, doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>.","chicago":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>.","ista":"Janovjak HL. 2016. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. Structure. 24(2), 213–215."},"publist_id":"5756","title":"Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain","acknowledgement":"The author thanks Banerjee et al. (2016) for providing coordinates prior to public release and apologizes to colleagues whose work was not cited or discussed due to the limited space available. The author is supported by grants from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).","date_updated":"2021-01-12T06:50:46Z","year":"2016","issue":"2","ec_funded":1,"intvolume":"        24","scopus_import":1,"_id":"1440","language":[{"iso":"eng"}],"doi":"10.1016/j.str.2016.01.002","publication":"Structure","author":[{"full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315"}],"publication_status":"published","oa_version":"None","day":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","project":[{"name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","_id":"255BFFFA-B435-11E9-9278-68D0E5697425","grant_number":"RGY0084/2012"},{"_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"page":"213 - 215","department":[{"_id":"HaJa"}],"quality_controlled":"1","volume":24,"publisher":"Cell Press","type":"journal_article","date_published":"2016-02-02T00:00:00Z","status":"public"},{"_id":"1441","file_date_updated":"2020-07-14T12:44:55Z","doi":"10.1002/anie.201601736","year":"2016","acknowledgement":"A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and a FemTech fellowship (Austrian Research Promotion Agency: 3580812).","publist_id":"5755","date_created":"2018-12-11T11:52:02Z","citation":{"ieee":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H. L. Janovjak, “A phytochrome sensory domain permits receptor activation by red light,” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21. Wiley, pp. 6339–6342, 2016.","ama":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. 2016;55(21):6339-6342. doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>","short":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L. Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342.","chicago":"Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy, Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>.","ista":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. 2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte Chemie - International Edition. 55(21), 6339–6342.","mla":"Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21, Wiley, 2016, pp. 6339–42, doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>.","apa":"Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &#38; Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>"},"related_material":{"record":[{"status":"public","id":"418","relation":"dissertation_contains"}]},"ec_funded":1,"project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Molecular Drug Targets","_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24"}],"date_published":"2016-05-17T00:00:00Z","publisher":"Wiley","volume":55,"quality_controlled":"1","page":"6339 - 6342","department":[{"_id":"HaJa"}],"publication_status":"published","ddc":["571","576"],"abstract":[{"lang":"eng","text":"Optogenetics and photopharmacology enable the spatio-temporal control of cell and animal behavior by light. Although red light offers deep-tissue penetration and minimal phototoxicity, very few red-light-sensitive optogenetic methods are currently available. We have now developed a red-light-induced homodimerization domain. We first showed that an optimized sensory domain of the cyanobacterial phytochrome 1 can be expressed robustly and without cytotoxicity in human cells. We then applied this domain to induce the dimerization of two receptor tyrosine kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway non-invasively in mammalian tissue and in multicolor cell-signaling experiments. The light-controlled dimerizer and red-light-activated receptor tyrosine kinases will prove useful to regulate a variety of cellular processes with light. Go deep with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was repurposed to induce the homodimerization of proteins in living cells by red light. By using this domain, light-activated protein kinases were engineered that can be activated orthogonally from many fluorescent proteins and through mammalian tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1."}],"language":[{"iso":"eng"}],"publication":"Angewandte Chemie - International Edition","issue":"21","date_updated":"2023-09-07T12:49:08Z","oa":1,"pubrep_id":"840","title":"A phytochrome sensory domain permits receptor activation by red light","scopus_import":1,"intvolume":"        55","has_accepted_license":"1","type":"journal_article","status":"public","author":[{"id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","orcid":"0000-0002-7218-7738","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva"},{"full_name":"Inglés Prieto, Álvaro","first_name":"Álvaro","orcid":"0000-0002-5409-8571","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","last_name":"Inglés Prieto"},{"id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","last_name":"Tichy","full_name":"Tichy, Alexandra-Madelaine","first_name":"Alexandra-Madelaine"},{"id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","last_name":"Mckenzie","first_name":"Catherine","full_name":"Mckenzie, Catherine"},{"full_name":"Janovjak, Harald L","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","orcid":"0000-0002-8023-9315"}],"month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:17:03Z","date_updated":"2020-07-14T12:44:55Z","file_id":"5255","checksum":"26da07960e57ac4750b54179197ce57f","file_name":"IST-2017-840-v1+1_reichhart.pdf","content_type":"application/pdf","file_size":1268662,"relation":"main_file","access_level":"open_access","creator":"system"}],"day":"17","oa_version":"Submitted Version"},{"scopus_import":"1","has_accepted_license":"1","intvolume":"       107","oa":1,"date_updated":"2021-11-16T08:29:11Z","pubrep_id":"530","issue":"1","article_processing_charge":"No","title":"On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data","publication":"Scientometrics","language":[{"iso":"eng"}],"month":"04","day":"01","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_name":"IST-2016-530-v1+1_s11192-016-1842-4.pdf","file_id":"4848","checksum":"32d46268588b87d9b686492018e6a2b2","date_updated":"2020-07-14T12:44:55Z","date_created":"2018-12-12T10:10:56Z","creator":"system","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":806035}],"author":[{"full_name":"Calatrava Moreno, Maria","first_name":"Maria","last_name":"Calatrava Moreno"},{"first_name":"Thomas","full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Werthner, Hannes","first_name":"Hannes","last_name":"Werthner"}],"status":"public","type":"journal_article","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11192-016-1902-9"}]},"year":"2016","citation":{"apa":"Calatrava Moreno, M., Auzinger, T., &#38; Werthner, H. (2016). On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. Springer. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>","ama":"Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. 2016;107(1):213-232. doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>","ieee":"M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data,” <i>Scientometrics</i>, vol. 107, no. 1. Springer, pp. 213–232, 2016.","short":"M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016) 213–232.","ista":"Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.","chicago":"Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>.","mla":"Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>, vol. 107, no. 1, Springer, 2016, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>."},"publist_id":"5750","date_created":"2018-12-11T11:52:04Z","doi":"10.1007/s11192-016-1842-4","file_date_updated":"2020-07-14T12:44:55Z","_id":"1446","ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index."}],"publication_status":"published","publisher":"Springer","date_published":"2016-04-01T00:00:00Z","department":[{"_id":"BeBi"}],"page":"213 - 232","quality_controlled":"1","volume":107},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.00562"}],"oa_version":"Preprint","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"06","author":[{"last_name":"Fathi","full_name":"Fathi, Max","first_name":"Max"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan"}],"status":"public","type":"journal_article","intvolume":"        26","scopus_import":1,"title":"Entropic Ricci curvature bounds for discrete interacting systems","oa":1,"date_updated":"2021-01-12T06:50:49Z","issue":"3","publication":"The Annals of Applied Probability","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities."}],"publication_status":"published","page":"1774 - 1806","department":[{"_id":"JaMa"}],"volume":26,"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","date_published":"2016-06-01T00:00:00Z","date_created":"2018-12-11T11:52:05Z","citation":{"ista":"Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting systems. The Annals of Applied Probability. 26(3), 1774–1806.","mla":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>, vol. 26, no. 3, Institute of Mathematical Statistics, 2016, pp. 1774–806, doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>.","chicago":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>.","ieee":"M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting systems,” <i>The Annals of Applied Probability</i>, vol. 26, no. 3. Institute of Mathematical Statistics, pp. 1774–1806, 2016.","ama":"Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. 2016;26(3):1774-1806. doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>","short":"M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.","apa":"Fathi, M., &#38; Maas, J. (2016). Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>"},"publist_id":"5748","acknowledgement":"Supported by the German Research Foundation through the Collaborative Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center for Mathematics. Part of this work has been done while M. Fathi visited J. Maas at the University of Bonn in July 2014.We would like to thank the referees for their careful reading of the manuscript. ","year":"2016","doi":"10.1214/15-AAP1133","_id":"1448"},{"publist_id":"5721","date_created":"2018-12-11T11:52:14Z","citation":{"ama":"Toshima J, Furuya E, Nagano M, et al. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>eLife</i>. 2016;5(February 2016). doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>","ieee":"J. Toshima <i>et al.</i>, “Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton,” <i>eLife</i>, vol. 5, no. February 2016. eLife Sciences Publications, 2016.","short":"J. Toshima, E. Furuya, M. Nagano, C. Kanno, Y. Sakamoto, M. Ebihara, D.E. Siekhaus, J. Toshima, ELife 5 (2016).","chicago":"Toshima, Junko, Eri Furuya, Makoto Nagano, Chisa Kanno, Yuta Sakamoto, Masashi Ebihara, Daria E Siekhaus, and Jiro Toshima. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>.","mla":"Toshima, Junko, et al. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>, vol. 5, no. February 2016, e10276, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>.","ista":"Toshima J, Furuya E, Nagano M, Kanno C, Sakamoto Y, Ebihara M, Siekhaus DE, Toshima J. 2016. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. eLife. 5(February 2016), e10276.","apa":"Toshima, J., Furuya, E., Nagano, M., Kanno, C., Sakamoto, Y., Ebihara, M., … Toshima, J. (2016). Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>"},"year":"2016","article_number":"e10276","ec_funded":1,"_id":"1475","file_date_updated":"2020-07-14T12:44:56Z","doi":"10.7554/eLife.10276","publication_status":"published","abstract":[{"lang":"eng","text":"The actin cytoskeleton plays important roles in the formation and internalization of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes along actin cables, however, the molecular machinery regulating interaction between endocytic vesicles and actin cables is poorly understood. The Eps15-like protein Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several endocytic compartments. Early endosomes were highly localized in the actin concentrations and displayed movement along actin cables. The dephosphorylated form of Pan1p also caused stable associations between endocytic vesicles and actin cables, and between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of a novel mechanism that regulates endocytic compartment interactions with each other and with actin cables."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"project":[{"name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7","grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","volume":5,"department":[{"_id":"DaSi"}],"date_published":"2016-02-25T00:00:00Z","publisher":"eLife Sciences Publications","title":"Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton","issue":"February 2016","date_updated":"2021-01-12T06:50:59Z","oa":1,"pubrep_id":"529","scopus_import":1,"intvolume":"         5","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"eLife","author":[{"first_name":"Junko","full_name":"Toshima, Junko","last_name":"Toshima"},{"last_name":"Furuya","full_name":"Furuya, Eri","first_name":"Eri"},{"full_name":"Nagano, Makoto","first_name":"Makoto","last_name":"Nagano"},{"first_name":"Chisa","full_name":"Kanno, Chisa","last_name":"Kanno"},{"last_name":"Sakamoto","full_name":"Sakamoto, Yuta","first_name":"Yuta"},{"last_name":"Ebihara","first_name":"Masashi","full_name":"Ebihara, Masashi"},{"first_name":"Daria E","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus"},{"full_name":"Toshima, Jiro","first_name":"Jiro","last_name":"Toshima"}],"file":[{"file_name":"IST-2016-529-v1+1_elife-10276-v1.pdf","file_id":"4793","checksum":"d1cc44870580756ba8badd8e41adfdb5","date_updated":"2020-07-14T12:44:56Z","date_created":"2018-12-12T10:10:08Z","creator":"system","content_type":"application/pdf","file_size":5198001,"relation":"main_file","access_level":"open_access"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"25","month":"02","type":"journal_article","status":"public"},{"type":"journal_article","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","content_type":"application/pdf","file_size":7176912,"relation":"main_file","access_level":"open_access","checksum":"2da0a09149a9ed956cdf79a95c17f08a","file_name":"IST-2017-767-v1+1_367.full.pdf","file_id":"4861","date_created":"2018-12-12T10:11:08Z","date_updated":"2020-07-14T12:44:56Z"}],"day":"15","oa_version":"Published Version","month":"01","author":[{"last_name":"Toshima","full_name":"Toshima, Junko","first_name":"Junko"},{"last_name":"Horikomi","first_name":"Chika","full_name":"Horikomi, Chika"},{"first_name":"Asuka","full_name":"Okada, Asuka","last_name":"Okada"},{"full_name":"Hatori, Makiko","first_name":"Makiko","last_name":"Hatori"},{"full_name":"Nagano, Makoto","first_name":"Makoto","last_name":"Nagano"},{"first_name":"Atsushi","full_name":"Masuda, Atsushi","last_name":"Masuda"},{"full_name":"Yamamoto, Wataru","first_name":"Wataru","last_name":"Yamamoto"},{"full_name":"Siekhaus, Daria E","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","orcid":"0000-0001-8323-8353"},{"last_name":"Toshima","full_name":"Toshima, Jiro","first_name":"Jiro"}],"publication":"Journal of Cell Science","language":[{"iso":"eng"}],"scopus_import":1,"has_accepted_license":"1","intvolume":"       129","title":"Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis","issue":"2","oa":1,"date_updated":"2021-01-12T06:51:00Z","pubrep_id":"767","quality_controlled":"1","volume":129,"department":[{"_id":"DaSi"}],"page":"367 - 379","date_published":"2016-01-15T00:00:00Z","publisher":"Company of Biologists","project":[{"call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"The dynamic assembly and disassembly of actin filaments is essential for the formation and transport of vesicles during endocytosis. In yeast, two types of actin structures, namely cortical patches and cytoplasmic cables, play a direct role in endocytosis, but how their interaction is regulated remains unclear. Here, we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required for efficient endocytosis owing to its role in the formation of the actin patches that aid initial vesicle invagination and of the actin cables that these move along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented actin cables that frequently moved past actin patches, the sites of endocytosis. We find that the C-terminal CARP domain of Srv2p is vitally important for the proper assembly of actin patches and cables; we also demonstrate that the N-terminal helical folded domain of Srv2 is required for its localization to actin patches, specifically to the ADP-actin rich region through an interaction with cofilin. These results demonstrate the in vivo roles of Srv2p in the regulation of the actin cytoskeleton during clathrin-mediated endocytosis"}],"ddc":["570","576"],"publication_status":"published","doi":"10.1242/jcs.176651","_id":"1476","file_date_updated":"2020-07-14T12:44:56Z","ec_funded":1,"citation":{"short":"J. Toshima, C. Horikomi, A. Okada, M. Hatori, M. Nagano, A. Masuda, W. Yamamoto, D.E. Siekhaus, J. Toshima, Journal of Cell Science 129 (2016) 367–379.","ama":"Toshima J, Horikomi C, Okada A, et al. Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. <i>Journal of Cell Science</i>. 2016;129(2):367-379. doi:<a href=\"https://doi.org/10.1242/jcs.176651\">10.1242/jcs.176651</a>","ieee":"J. Toshima <i>et al.</i>, “Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis,” <i>Journal of Cell Science</i>, vol. 129, no. 2. Company of Biologists, pp. 367–379, 2016.","mla":"Toshima, Junko, et al. “Srv2/CAP Is Required for Polarized Actin Cable Assembly and Patch Internalization during Clathrin-Mediated Endocytosis.” <i>Journal of Cell Science</i>, vol. 129, no. 2, Company of Biologists, 2016, pp. 367–79, doi:<a href=\"https://doi.org/10.1242/jcs.176651\">10.1242/jcs.176651</a>.","ista":"Toshima J, Horikomi C, Okada A, Hatori M, Nagano M, Masuda A, Yamamoto W, Siekhaus DE, Toshima J. 2016. Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. Journal of Cell Science. 129(2), 367–379.","chicago":"Toshima, Junko, Chika Horikomi, Asuka Okada, Makiko Hatori, Makoto Nagano, Atsushi Masuda, Wataru Yamamoto, Daria E Siekhaus, and Jiro Toshima. “Srv2/CAP Is Required for Polarized Actin Cable Assembly and Patch Internalization during Clathrin-Mediated Endocytosis.” <i>Journal of Cell Science</i>. Company of Biologists, 2016. <a href=\"https://doi.org/10.1242/jcs.176651\">https://doi.org/10.1242/jcs.176651</a>.","apa":"Toshima, J., Horikomi, C., Okada, A., Hatori, M., Nagano, M., Masuda, A., … Toshima, J. (2016). Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.176651\">https://doi.org/10.1242/jcs.176651</a>"},"publist_id":"5720","date_created":"2018-12-11T11:52:14Z","year":"2016","acknowledgement":"We are grateful to Anthony Bretscher (Cornell University, NY) for providing the bni1-12 bnr1Δ (Y4135) strain. J.Y.T. was supported by a Japan Society for the Promotion of Science (JSPS) KAKENHI grant [grant number 26440067]; the Takeda Science Foundation; and the Novartis Foundation (Japan). J.T. was supported by a JSPS KAKENHI grant [grant number 25440054]; the Takeda Science Foundation; and the Kurata Memorial Hitachi Science and Technology Foundation. D.E.S. was supported by the European Union [grant number PCIG12-GA-2012-334077]."},{"publication_status":"published","external_id":{"arxiv":["1309.2802"]},"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages provides a robust specification language to express properties in verification, and parity objectives are canonical forms to express them. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are undecidable even for special cases of parity objectives, we establish decidability (with optimal complexity) for POMDPs with all parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. We also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of POMDP examples.","lang":"eng"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"878 - 911","department":[{"_id":"KrCh"}],"volume":82,"quality_controlled":"1","publisher":"Elsevier","date_published":"2016-08-01T00:00:00Z","date_created":"2018-12-11T11:52:15Z","citation":{"ista":"Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">https://doi.org/10.1016/j.jcss.2016.02.009</a>.","mla":"Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” <i>Journal of Computer and System Sciences</i>, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">10.1016/j.jcss.2016.02.009</a>.","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives. <i>Journal of Computer and System Sciences</i>. 2016;82(5):878-911. doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">10.1016/j.jcss.2016.02.009</a>","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” <i>Journal of Computer and System Sciences</i>, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.","short":"K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">https://doi.org/10.1016/j.jcss.2016.02.009</a>"},"publist_id":"5718","year":"2016","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"2295","status":"public"},{"status":"public","relation":"earlier_version","id":"5400"}]},"_id":"1477","doi":"10.1016/j.jcss.2016.02.009","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"full_name":"Tracol, Mathieu","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol"}],"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1309.2802","open_access":"1"}],"oa_version":"Preprint","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","status":"public","type":"journal_article","title":"What is decidable about partially observable Markov decision processes with ω-regular objectives","date_updated":"2023-02-23T12:24:38Z","oa":1,"issue":"5","scopus_import":1,"intvolume":"        82","language":[{"iso":"eng"}],"publication":"Journal of Computer and System Sciences"},{"type":"journal_article","status":"public","author":[{"first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Warzel, Simone","first_name":"Simone","last_name":"Warzel"}],"month":"02","file":[{"access_level":"open_access","relation":"main_file","file_size":965607,"content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:56Z","date_created":"2018-12-12T10:17:22Z","file_id":"5276","checksum":"4f959eabc19d2a2f518318a450a4d424","file_name":"IST-2016-579-v1+1_njp_18_3_035002.pdf"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"29","language":[{"iso":"eng"}],"publication":"New Journal of Physics","issue":"3","pubrep_id":"579","date_updated":"2021-01-12T06:51:01Z","oa":1,"title":"Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas","has_accepted_license":"1","scopus_import":1,"intvolume":"        18","project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"date_published":"2016-02-29T00:00:00Z","publisher":"IOP Publishing Ltd.","quality_controlled":"1","volume":18,"department":[{"_id":"RoSe"}],"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510","530"],"abstract":[{"text":"We consider the Tonks-Girardeau gas subject to a random external potential. If the disorder is such that the underlying one-particle Hamiltonian displays localization (which is known to be generically the case), we show that there is exponential decay of correlations in the many-body eigenstates. Moreover, there is no Bose-Einstein condensation and no superfluidity, even at zero temperature.","lang":"eng"}],"_id":"1478","file_date_updated":"2020-07-14T12:44:56Z","doi":"10.1088/1367-2630/18/3/035002","year":"2016","citation":{"apa":"Seiringer, R., &#38; Warzel, S. (2016). Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. <i>New Journal of Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">https://doi.org/10.1088/1367-2630/18/3/035002</a>","mla":"Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of Superfluidity in the Disordered Tonks-Girardeau Gas.” <i>New Journal of Physics</i>, vol. 18, no. 3, 035002, IOP Publishing Ltd., 2016, doi:<a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">10.1088/1367-2630/18/3/035002</a>.","chicago":"Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of Superfluidity in the Disordered Tonks-Girardeau Gas.” <i>New Journal of Physics</i>. IOP Publishing Ltd., 2016. <a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">https://doi.org/10.1088/1367-2630/18/3/035002</a>.","ista":"Seiringer R, Warzel S. 2016. Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. New Journal of Physics. 18(3), 035002.","ieee":"R. Seiringer and S. Warzel, “Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas,” <i>New Journal of Physics</i>, vol. 18, no. 3. IOP Publishing Ltd., 2016.","ama":"Seiringer R, Warzel S. Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. <i>New Journal of Physics</i>. 2016;18(3). doi:<a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">10.1088/1367-2630/18/3/035002</a>","short":"R. Seiringer, S. Warzel, New Journal of Physics 18 (2016)."},"date_created":"2018-12-11T11:52:15Z","publist_id":"5716","article_number":"035002"},{"day":"31","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5513","file_name":"IST-2016-523-v1+1_main.pdf","checksum":"cef516fa091925b5868813e355268fb4","date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:53:52Z","creator":"system","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":1012204}],"abstract":[{"lang":"eng","text":"We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs. "}],"ddc":["005"],"publication_identifier":{"issn":["2664-1690"]},"month":"03","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"publication_status":"published","department":[{"_id":"KrCh"}],"page":"33","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"date_published":"2016-03-31T00:00:00Z","status":"public","type":"technical_report","related_material":{"record":[{"id":"1604","relation":"later_version","status":"public"}]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:22Z","citation":{"ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Interprocedural Analysis</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">10.15479/AT:IST-2016-523-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. <i>Quantitative Interprocedural Analysis</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">https://doi.org/10.15479/AT:IST-2016-523-v1-1</a>.","ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, <i>Quantitative interprocedural analysis</i>. IST Austria, 2016.","ama":"Chatterjee K, Pavlogiannis A, Velner Y. <i>Quantitative Interprocedural Analysis</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">10.15479/AT:IST-2016-523-v1-1</a>","short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.","apa":"Chatterjee, K., Pavlogiannis, A., &#38; Velner, Y. (2016). <i>Quantitative interprocedural analysis</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">https://doi.org/10.15479/AT:IST-2016-523-v1-1</a>"},"title":"Quantitative interprocedural analysis","pubrep_id":"523","oa":1,"date_updated":"2023-02-23T10:06:22Z","year":"2016","doi":"10.15479/AT:IST-2016-523-v1-1","file_date_updated":"2020-07-14T12:46:58Z","language":[{"iso":"eng"}],"_id":"5445"},{"has_accepted_license":"1","date_updated":"2020-07-14T23:05:05Z","pubrep_id":"618","oa":1,"year":"2016","citation":{"ista":"Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis of recursive programs, IST Austria, 26p.","chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria, 2016.","mla":"Anonymous, 1, et al. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria, 2016.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis of Recursive Programs, IST Austria, 2016.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria; 2016.","ieee":"1 Anonymous, 2 Anonymous, and 3 Anonymous, <i>Termination and worst-case analysis of recursive programs</i>. IST Austria, 2016.","apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (2016). <i>Termination and worst-case analysis of recursive programs</i>. IST Austria."},"title":"Termination and worst-case analysis of recursive programs","date_created":"2018-12-12T11:39:23Z","file_date_updated":"2020-07-14T12:46:58Z","_id":"5446","language":[{"iso":"eng"}],"ddc":["000"],"month":"07","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","day":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2019-05-10T13:27:24Z","date_updated":"2020-07-14T12:46:58Z","file_name":"popl2017a.pdf","checksum":"689069a7abbb34b21516164cbee9e0df","file_id":"6403","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":686241,"creator":"dernst"},{"creator":"dernst","content_type":"text/plain","file_size":258,"access_level":"closed","relation":"main_file","checksum":"fc08022bfbaac07bac047a9407c0bbb3","file_name":"author_names.txt","file_id":"6404","date_created":"2019-05-10T13:27:31Z","date_updated":"2020-07-14T12:46:58Z"}],"abstract":[{"text":"We study the problem of developing efficient approaches for proving termination of recursive programs with one-dimensional arrays. Ranking functions serve as a sound and complete approach for proving termination of non-recursive programs without array operations. First, we generalize ranking functions to the notion of measure functions, and prove that measure functions (i) provide a sound method to prove termination of recursive programs (with one-dimensional arrays), and (ii) is both sound and complete over recursive programs without array operations. Our second contribution is the synthesis of measure functions of specific forms in polynomial time. More precisely, we prove that (i) polynomial measure functions over recursive programs can be synthesized in polynomial time through Farkas’ Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm and exponentiation can be synthesized in polynomial time through abstraction of logarithmic or exponential terms and Handelman’s Theorem. A key application of our method is the worst-case analysis of recursive programs. While previous methods obtain worst-case polynomial bounds of the form O(n^k), where k is an integer, our polynomial time methods can synthesize bounds of the form O(n log n), as well as O(n^x), where x is not an integer. We show the applicability of our automated technique to obtain worst-case complexity of classical recursive algorithms such as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem, where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for polynomial multiplication and Strassen’s algorithm for matrix multiplication, where we obtain O(n^x) bound, where x is not an integer and close to the best-known bounds for the respective algorithms. Finally, we present experimental results to demonstrate the\r\neffectiveness of our approach.","lang":"eng"}],"author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"full_name":"Anonymous, 2","first_name":"2","last_name":"Anonymous"},{"first_name":"3","full_name":"Anonymous, 3","last_name":"Anonymous"}],"publication_status":"published","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","status":"public","type":"technical_report","date_published":"2016-07-15T00:00:00Z","page":"26"},{"language":[{"iso":"eng"}],"_id":"5447","file_date_updated":"2020-07-14T12:46:58Z","has_accepted_license":"1","title":"Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds","date_created":"2018-12-12T11:39:23Z","citation":{"chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria, 2016.","mla":"Anonymous, 1, et al. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria, 2016.","ista":"Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.","ieee":"1 Anonymous, 2 Anonymous, and 3 Anonymous, <i>Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds</i>. IST Austria, 2016.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria; 2016.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.","apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (2016). <i>Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds</i>. IST Austria."},"year":"2016","oa":1,"pubrep_id":"619","date_updated":"2020-07-14T23:05:06Z","page":"20","type":"technical_report","status":"public","date_published":"2016-07-15T00:00:00Z","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"We consider the problem of developing automated techniques to aid the average-case complexity analysis of programs. Several classical textbook algorithms have quite efficient average-case complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR). Since the main focus of average-case analysis is to obtain efficient bounds, we consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input). Our main contribution is a sound approach for deriving such average-case bounds for randomized recursive programs. Our approach is efficient (a simple linear-time algorithm), and it is based on (a) the analysis of recurrence relations induced by randomized algorithms, and (b) a guess-and-check technique. Our approach can infer the asymptotically optimal average-case bounds for classical randomized algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR, where the worstcase\r\nbounds are either inefficient (such as linear as compared to logarithmic of average-case, or quadratic as compared to linear or almost-linear of average-case), or ineffective. We have implemented our approach, and the experimental results show that we obtain the bounds efficiently for various classical algorithms."}],"file":[{"creator":"dernst","access_level":"closed","content_type":"text/plain","relation":"main_file","file_size":281,"checksum":"cf53cdb6d092e68db0b4a0a1506ef8fb","file_name":"listofauthors.txt","file_id":"6406","date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:32:16Z"},{"access_level":"open_access","content_type":"application/pdf","file_size":563642,"relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:32:16Z","file_name":"popl2017b.pdf","file_id":"6407","checksum":"7bdd94ba13aa0dec9c46887fcf13870b"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","oa_version":"Published Version","month":"07","publication_identifier":{"issn":["2664-1690"]},"ddc":["000"],"publication_status":"published","author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"full_name":"Anonymous, 2","first_name":"2","last_name":"Anonymous"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"}]},{"page":"20","date_published":"2016-07-15T00:00:00Z","status":"public","type":"technical_report","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","file":[{"creator":"system","access_level":"open_access","file_size":538881,"relation":"main_file","content_type":"application/pdf","file_name":"IST-2016-620-v1+1_main.pdf","checksum":"1d69252d66bcdf782615ddfb911d2957","file_id":"5506","date_created":"2018-12-12T11:53:45Z","date_updated":"2020-07-14T12:46:58Z"},{"checksum":"deabb0eb8f237cae4f9542b28b0b6eb2","file_name":"authornames.txt","file_id":"6405","date_created":"2019-05-10T13:30:40Z","date_updated":"2020-07-14T12:46:58Z","creator":"dernst","relation":"main_file","file_size":121,"access_level":"closed","content_type":"text/plain"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.","lang":"eng"}],"external_id":{"arxiv":["1610.01188"]},"oa_version":"Published Version","day":"15","publication_identifier":{"issn":["2664-1690"]},"month":"07","ddc":["000"],"arxiv":1,"author":[{"last_name":"Anonymous","first_name":"1","full_name":"Anonymous, 1"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"},{"first_name":"3","full_name":"Anonymous, 3","last_name":"Anonymous"},{"first_name":"4","full_name":"Anonymous, 4","last_name":"Anonymous"}],"publication_status":"published","language":[{"iso":"eng"}],"_id":"5448","file_date_updated":"2020-07-14T12:46:58Z","has_accepted_license":"1","related_material":{"record":[{"id":"10417","relation":"later_version","status":"public"},{"status":"public","id":"5456","relation":"later_version"}]},"title":"Data-centric dynamic partial order reduction","date_created":"2018-12-12T11:39:23Z","citation":{"short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2016.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, <i>Data-centric dynamic partial order reduction</i>. IST Austria, 2016.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria; 2016.","mla":"Anonymous, 1, et al. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic partial order reduction, IST Austria, 20p.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, &#38; Anonymous, 4. (2016). <i>Data-centric dynamic partial order reduction</i>. IST Austria."},"year":"2016","oa":1,"pubrep_id":"620","date_updated":"2023-02-23T12:27:16Z"},{"department":[{"_id":"KrCh"}],"page":"22","date_published":"2016-11-09T00:00:00Z","type":"technical_report","status":"public","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"author":[{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publication_status":"published","file":[{"date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:54:07Z","file_name":"IST-2016-648-v1+1_tr.pdf","checksum":"8345a8c1e7d7f0cd92516d182b7fc59e","file_id":"5529","relation":"main_file","file_size":1264221,"access_level":"open_access","content_type":"application/pdf","creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population.\r\nThe fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure.\r\nAmplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade.\r\nIn this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.","lang":"eng"}],"oa_version":"Updated Version","day":"09","publication_identifier":{"issn":["2664-1690"]},"month":"11","ddc":["519"],"language":[{"iso":"eng"}],"_id":"5449","file_date_updated":"2020-07-14T12:46:58Z","doi":"10.15479/AT:IST-2016-648-v1-1","title":"Amplification on undirected population structures: Comets beat stars","citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Amplification on undirected population structures: Comets beat stars</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">https://doi.org/10.15479/AT:IST-2016-648-v1-1</a>","mla":"Pavlogiannis, Andreas, et al. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">10.15479/AT:IST-2016-648-v1-1</a>.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">https://doi.org/10.15479/AT:IST-2016-648-v1-1</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">10.15479/AT:IST-2016-648-v1-1</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Amplification on undirected population structures: Comets beat stars</i>. IST Austria, 2016."},"date_created":"2018-12-12T11:39:24Z","year":"2016","pubrep_id":"648","oa":1,"date_updated":"2023-02-23T12:22:21Z","related_material":{"record":[{"id":"512","relation":"later_version","status":"public"}]},"has_accepted_license":"1"},{"date_created":"2018-12-12T11:39:24Z","citation":{"ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Strong Amplifiers of Natural Selection</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">10.15479/AT:IST-2016-728-v1-1</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Strong amplifiers of natural selection</i>. IST Austria, 2016.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.","mla":"Pavlogiannis, Andreas, et al. <i>Strong Amplifiers of Natural Selection</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">10.15479/AT:IST-2016-728-v1-1</a>.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Strong Amplifiers of Natural Selection</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">https://doi.org/10.15479/AT:IST-2016-728-v1-1</a>.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Strong amplifiers of natural selection</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">https://doi.org/10.15479/AT:IST-2016-728-v1-1</a>"},"title":"Strong amplifiers of natural selection","year":"2016","oa":1,"date_updated":"2023-02-23T12:27:05Z","pubrep_id":"728","has_accepted_license":"1","_id":"5451","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:59Z","doi":"10.15479/AT:IST-2016-728-v1-1","publication_status":"published","author":[{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","first_name":"Josef","full_name":"Tkadlec, Josef"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"file":[{"date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:04Z","checksum":"7b8bb17c322c0556acba6ac169fa71c1","file_name":"IST-2016-728-v1+1_main.pdf","file_id":"5465","file_size":1014732,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"30","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"month":"12","ddc":["000"],"department":[{"_id":"KrCh"}],"page":"34","status":"public","type":"technical_report","date_published":"2016-12-30T00:00:00Z","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria"},{"alternative_title":["IST Austria Technical Report"],"status":"public","type":"technical_report","author":[{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"publication_identifier":{"issn":["2664-1690"]},"month":"12","day":"30","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:52:59Z","file_name":"IST-2017-728-v2+1_main.pdf","file_id":"5460","checksum":"58e895f26c82f560c0f0989bf8b08599","file_size":811558,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system"}],"language":[{"iso":"eng"}],"oa":1,"pubrep_id":"750","date_updated":"2024-02-21T13:48:42Z","article_processing_charge":"No","title":"Arbitrarily strong amplifiers of natural selection","has_accepted_license":"1","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"publisher":"IST Austria","date_published":"2016-12-30T00:00:00Z","page":"32","department":[{"_id":"KrCh"}],"publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:46:59Z","_id":"5452","doi":"10.15479/AT:IST-2017-728-v2-1","year":"2016","date_created":"2018-12-12T11:39:25Z","citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">https://doi.org/10.15479/AT:IST-2017-728-v2-1</a>","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">https://doi.org/10.15479/AT:IST-2017-728-v2-1</a>.","mla":"Pavlogiannis, Andreas, et al. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">10.15479/AT:IST-2017-728-v2-1</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">10.15479/AT:IST-2017-728-v2-1</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria, 2016."},"ec_funded":1,"related_material":{"record":[{"id":"5453","relation":"later_version","status":"public"},{"relation":"popular_science","id":"5559","status":"public"}]}}]