[{"has_accepted_license":"1","ec_funded":1,"alternative_title":["LIPIcs"],"corr_author":"1","citation":{"apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373."},"das_tickbox":"1","pubrep_id":"805","language":[{"iso":"eng"}],"page":"362 - 373","oa_version":"Published Version","ddc":["004"],"intvolume":"        18","scopus_import":"1","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","publication_status":"published","department":[{"_id":"ToHe"}],"author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2012-12-17","location":"Hyderabad, India","start_date":"2012-12-15"},"month":"12","volume":18,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1.","lang":"eng"}],"quality_controlled":"1","title":"Approximate determinization of quantitative automata","file":[{"file_size":559069,"creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:10:37Z","file_name":"IST-2017-805-v1+1_34.pdf","date_updated":"2020-07-14T12:45:52Z","file_id":"4826","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","content_type":"application/pdf"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"}],"date_updated":"2026-07-28T09:20:59Z","status":"public","doi":"10.4230/LIPIcs.FSTTCS.2012.362","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"oa":1,"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","date_created":"2018-12-11T12:00:10Z","date_published":"2012-12-01T00:00:00Z","_id":"2891","year":"2012","publist_id":"3867","file_date_updated":"2020-07-14T12:45:52Z","article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication":"Leibniz International Proceedings in Informatics"},{"abstract":[{"lang":"eng","text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool."}],"title":"HSF(C): A software verifier based on Horn clauses","quality_controlled":"1","publisher":"Springer","publication_identifier":{"eisbn":["9783642287565"],"eissn":["1611-3349"],"isbn":["9783642287558"],"issn":["0302-9743"]},"series_title":"LNCS","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-642-28756-5_46"}],"doi":"10.1007/978-3-642-28756-5_46","status":"public","date_updated":"2026-07-28T09:23:52Z","oa":1,"date_created":"2022-03-21T08:03:30Z","_id":"10906","date_published":"2012-04-01T00:00:00Z","year":"2012","day":"01","article_processing_charge":"No","place":"Berlin, Heidelberg","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication":"Tools and Algorithms for the Construction and Analysis of Systems","alternative_title":["LNCS"],"citation":{"ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551."},"corr_author":"1","OA_type":"free access","das_tickbox":"1","editor":[{"full_name":"Flanagan, Cormac","last_name":"Flanagan","first_name":"Cormac"},{"full_name":"König, Barbara","last_name":"König","first_name":"Barbara"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","page":"549-551","scopus_import":"1","intvolume":"      7214","ddc":["000"],"author":[{"full_name":"Grebenshchikov, Sergey","last_name":"Grebenshchikov","first_name":"Sergey"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"first_name":"Nuno P.","last_name":"Lopes","full_name":"Lopes, Nuno P."},{"first_name":"Corneliu","last_name":"Popeea","full_name":"Popeea, Corneliu"},{"last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey","first_name":"Andrey"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia"},"department":[{"_id":"ToHe"}],"publication_status":"published","volume":7214,"month":"04"},{"article_type":"original","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (3.0)"},"oa":1,"date_updated":"2026-07-28T09:22:21Z","status":"public","doi":"10.1083/jcb.201204039","quality_controlled":"1","title":"Cell migration: Fibroblasts find a new way to get ahead","publisher":"Rockefeller University Press","file":[{"file_name":"2012_CellBiology_Sixt.pdf","date_created":"2019-02-12T09:03:09Z","relation":"main_file","creator":"kschuh","access_level":"open_access","file_size":986566,"content_type":"application/pdf","file_id":"5957","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","date_updated":"2020-07-14T12:46:36Z"}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Cell Biology","day":"30","article_processing_charge":"No","publist_id":"7314","year":"2012","file_date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-11T11:46:51Z","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","external_id":{"isi":["000303467800004"]},"_id":"506","date_published":"2012-04-30T00:00:00Z","das_tickbox":"1","citation":{"short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. 2012;197(3):347-349. doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>.","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>."},"corr_author":"1","issue":"3","has_accepted_license":"1","department":[{"_id":"MiSi"}],"author":[{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K"}],"isi":1,"publication_status":"published","volume":197,"month":"04","scopus_import":"1","ddc":["570"],"intvolume":"       197","language":[{"iso":"eng"}],"oa_version":"Published Version","page":"347 - 349"},{"OA_place":"repository","OA_type":"green","citation":{"apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>.","ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131."},"corr_author":"1","related_material":{"record":[{"relation":"later_version","id":"2716","status":"public"}]},"alternative_title":["LNCS"],"ec_funded":1,"volume":7454,"month":"09","conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Newcastle upon Tyne, United Kingdom","start_date":"2012-09-04","end_date":"2012-09-07"},"department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","full_name":"Raskin, Jean-François","first_name":"Jean-François"}],"publication_status":"published","acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","scopus_import":"1","intvolume":"      7454","oa_version":"Preprint","page":"115-131","language":[{"iso":"eng"}],"editor":[{"last_name":"Koutny","full_name":"Koutny, Maciej","first_name":"Maciej"},{"full_name":"Ulidowski, Irek","last_name":"Ulidowski","first_name":"Irek"}],"oa":1,"status":"public","date_updated":"2026-07-28T11:24:51Z","doi":"10.1007/978-3-642-32940-1_10","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"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"}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.5073","open_access":"1"}],"publication_identifier":{"isbn":["9783642329395"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783642329401"]},"quality_controlled":"1","title":"Strategy synthesis for multi-dimensional quantitative objectives","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"publisher":"Springer","publication":"CONCUR 2012 - Concurrency Theory","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Berlin, Heidelberg","day":"15","article_processing_charge":"No","year":"2012","_id":"10904","external_id":{"arxiv":["1201.5073"]},"date_published":"2012-09-15T00:00:00Z","date_created":"2022-03-21T08:00:21Z"},{"date_created":"2018-12-11T12:02:13Z","_id":"3243","date_published":"2012-03-01T00:00:00Z","publist_id":"3433","year":"2012","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publication":"Büchereiperspektiven","title":"Zwischen Technologie und Kommunikation","abstract":[{"text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. ","lang":"eng"}],"publisher":"Büchereiverband Österreichs","publication_identifier":{"issn":["1607-7172"]},"main_file_link":[{"url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf","open_access":"1"}],"date_updated":"2026-07-28T09:15:13Z","status":"public","article_type":"comment","oa":1,"language":[{"iso":"ger"}],"oa_version":"Published Version","page":"11","intvolume":"      2012","ddc":["020"],"department":[{"_id":"E-Lib"}],"author":[{"orcid":"0000-0002-6026-4409","last_name":"Danowski","full_name":"Danowski, Patrick","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","month":"03","volume":2012,"popular_science":"1","citation":{"mla":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","ieee":"P. Danowski, “Zwischen Technologie und Kommunikation,” <i>Büchereiperspektiven</i>, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.","ista":"Danowski P. 2012. Zwischen Technologie und Kommunikation. Büchereiperspektiven. 2012(1), 11.","apa":"Danowski, P. (2012). Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","ama":"Danowski P. Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11."},"corr_author":"1","OA_type":"free access","issue":"1","das_tickbox":"1"},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1403"}]},"citation":{"ista":"Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation. Science. 338(6104), 257–260.","ieee":"M. Behrndt <i>et al.</i>, “Forces driving epithelial spreading in zebrafish gastrulation,” <i>Science</i>, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 257–260, 2012.","chicago":"Behrndt, Martin, Guillaume Salbreux, Pedro Campinho, Robert Hauschild, Felix Oswald, Julia Roensch, Stephan Grill, and Carl-Philipp J Heisenberg. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224143\">https://doi.org/10.1126/science.1224143</a>.","mla":"Behrndt, Martin, et al. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” <i>Science</i>, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 257–60, doi:<a href=\"https://doi.org/10.1126/science.1224143\">10.1126/science.1224143</a>.","short":"M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch, S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.","ama":"Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. 2012;338(6104):257-260. doi:<a href=\"https://doi.org/10.1126/science.1224143\">10.1126/science.1224143</a>","apa":"Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch, J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224143\">https://doi.org/10.1126/science.1224143</a>"},"corr_author":"1","OA_type":"closed access","issue":"6104","language":[{"iso":"eng"}],"oa_version":"None","page":"257 - 260","scopus_import":"1","intvolume":"       338","acknowledgement":"We are grateful to M. Sixt, T. Bollenbach, and E. Martin-Blanco for advice and the service facilities of the IST Austria and MPI-CBG for continuous help. M.B., G.S., S.W.G., and C.-P.H. synergistically and equally developed the presented ideas and the experimental and theoretical approaches. M.B. and P.C. performed the experiments; G.S. developed the theory; and R.H., F.O., and J.R. contributed to the experimental work. This work was supported by a grant from the Fonds zur Förderung der wissenschaftlichen Forschung (FWF) and the Deutsche Forschungsgemeinschaft (DFG) (I930-B20) to C.-P.H., S.W.G., and G.S.","author":[{"id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Behrndt","full_name":"Behrndt, Martin"},{"first_name":"Guillaume","last_name":"Salbreux","full_name":"Salbreux, Guillaume"},{"full_name":"Campinho, Pedro","last_name":"Campinho","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro"},{"orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"first_name":"Felix","last_name":"Oswald","full_name":"Oswald, Felix"},{"full_name":"Roensch, Julia","last_name":"Roensch","first_name":"Julia","id":"4220E59C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Grill, Stephan","last_name":"Grill","first_name":"Stephan"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"department":[{"_id":"CaHe"},{"_id":"Bio"}],"isi":1,"publication_status":"published","month":"10","volume":338,"quality_controlled":"1","title":"Forces driving epithelial spreading in zebrafish gastrulation","abstract":[{"text":"Contractile actomyosin rings drive various fundamental morphogenetic processes ranging from cytokinesis to wound healing. Actomyosin rings are generally thought to function by circumferential contraction. Here, we show that the spreading of the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation is driven by a contractile actomyosin ring. In contrast to previous suggestions, we find that this ring functions not only by circumferential contraction but also by a flow-friction mechanism. This generates a pulling force through resistance against retrograde actomyosin flow. EVL spreading proceeds normally in situations where circumferential contraction is unproductive, indicating that the flow-friction mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis through a combination of cable-constriction and flow-friction mechanisms.","lang":"eng"}],"publisher":"American Association for the Advancement of Science","doi":"10.1126/science.1224143","date_updated":"2026-07-29T10:07:18Z","status":"public","project":[{"call_identifier":"FWF","_id":"252ABD0A-B435-11E9-9278-68D0E5697425","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","grant_number":"I930-B20"}],"article_type":"original","date_created":"2018-12-11T12:00:30Z","pmid":1,"external_id":{"pmid":["23066079"],"isi":["000309712300046"]},"_id":"2950","acknowledged_ssus":[{"_id":"SSU"}],"date_published":"2012-10-12T00:00:00Z","publist_id":"3778","year":"2012","day":"12","article_processing_charge":"No","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Science"},{"scopus_import":"1","intvolume":"       486","volume":486,"month":"06","department":[{"_id":"KrCh"}],"author":[{"first_name":"Luis","last_name":"Diaz Jr","full_name":"Diaz Jr, Luis"},{"last_name":"Williams","full_name":"Williams, Richard","first_name":"Richard"},{"last_name":"Wu","full_name":"Wu, Jian","first_name":"Jian"},{"first_name":"Isaac","full_name":"Kinde, Isaac","last_name":"Kinde"},{"full_name":"Hecht, Joel","last_name":"Hecht","first_name":"Joel"},{"first_name":"Jordan","full_name":"Berlin, Jordan","last_name":"Berlin"},{"full_name":"Allen, Benjamin","last_name":"Allen","first_name":"Benjamin"},{"first_name":"Ivana","last_name":"Božić","full_name":"Božić, Ivana"},{"orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"first_name":"Kenneth","last_name":"Kinzler","full_name":"Kinzler, Kenneth"},{"first_name":"Kelly","last_name":"Oliner","full_name":"Oliner, Kelly"},{"first_name":"Bert","full_name":"Vogelstein, Bert","last_name":"Vogelstein"}],"isi":1,"publication_status":"published","oa_version":"Submitted Version","page":"537 - 540","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"issue":"7404","citation":{"apa":"Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>","ama":"Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. 2012;486(7404):537-540. doi:<a href=\"https://doi.org/10.1038/nature11219\">10.1038/nature11219</a>","short":"L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen, I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486 (2012) 537–540.","mla":"Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” <i>Nature</i>, vol. 486, no. 7404, Nature Publishing Group, 2012, pp. 537–40, doi:<a href=\"https://doi.org/10.1038/nature11219\">10.1038/nature11219</a>.","chicago":"Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” <i>Nature</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>.","ieee":"L. Diaz Jr <i>et al.</i>, “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” <i>Nature</i>, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.","ista":"Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540."},"day":"28","article_processing_charge":"No","publication":"Nature","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","_id":"3157","external_id":{"isi":["000305760600044"],"pmid":["22722843"]},"date_published":"2012-06-28T00:00:00Z","pmid":1,"date_created":"2018-12-11T12:01:43Z","publist_id":"3537","year":"2012","date_updated":"2026-07-29T10:15:25Z","doi":"10.1038/nature11219","status":"public","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"quality_controlled":"1","abstract":[{"text":"Colorectal tumours that are wild type for KRAS are often sensitive to EGFR blockade, but almost always develop resistance within several months of initiating therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies are largely unknown. This situation is in marked contrast to that of small-molecule targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations in the genes encoding the protein targets render the tumours resistant to the effects of the drugs. The simplest hypothesis to account for the development of resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis would seem readily testable, there is no evidence in pre-clinical models to support it, nor is there data from patients. To test this hypothesis, we determined whether mutant KRAS DNA could be detected in the circulation of 28 patients receiving monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that 9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed detectable mutations in KRAS in their sera, three of which developed multiple different KRAS mutations. The appearance of these mutations was very consistent, generally occurring between 5 and 6months following treatment. Mathematical modelling indicated that the mutations were present in expanded subclones before the initiation of panitumumab treatment. These results suggest that the emergence of KRAS mutations is a mediator of acquired resistance to EGFR blockade and that these mutations can be detected in a non-invasive manner. They explain why solid tumours develop resistance to targeted therapies in a highly reproducible fashion.","lang":"eng"}],"title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","publisher":"Nature Publishing Group","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/","open_access":"1"}]},{"doi":"10.1016/j.tpb.2011.11.003","status":"public","date_updated":"2026-07-29T10:15:25Z","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"title":"Evolutionary dynamics of biological auctions","quality_controlled":"1","abstract":[{"lang":"eng","text":"Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n"}],"publisher":"Academic Press","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ "}],"day":"01","article_processing_charge":"No","publication":"Theoretical Population Biology","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","external_id":{"pmid":["22120126"],"isi":["000298938200006"]},"_id":"3260","date_published":"2012-02-01T00:00:00Z","date_created":"2018-12-11T12:02:19Z","pmid":1,"publist_id":"3388","year":"2012","related_material":{"record":[{"relation":"dissertation_contains","id":"1400","status":"public"}]},"ec_funded":1,"issue":"1","citation":{"ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>.","chicago":"Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>.","ieee":"K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” <i>Theoretical Population Biology</i>, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.","apa":"Chatterjee, K., Reiter, J., &#38; Nowak, M. (2012). Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>","ama":"Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. 2012;81(1):69-80. doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>"},"corr_author":"1","scopus_import":"1","intvolume":"        81","volume":81,"month":"02","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","last_name":"Reiter","full_name":"Reiter, Johannes"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"publication_status":"published","isi":1,"oa_version":"Submitted Version","page":"69 - 80","language":[{"iso":"eng"}]},{"intvolume":"         1","ddc":["576"],"scopus_import":"1","isi":1,"publication_status":"published","department":[{"_id":"SiHi"}],"author":[{"first_name":"Huixuan","last_name":"Liang","full_name":"Liang, Huixuan"},{"orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ghashghaei, H.","last_name":"Ghashghaei","first_name":"H."}],"volume":1,"month":"12","pubrep_id":"387","language":[{"iso":"eng"}],"page":"1200 - 1203","oa_version":"Published Version","has_accepted_license":"1","citation":{"ama":"Liang H, Hippenmeyer S, Ghashghaei H. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. 2012;1(12):1200-1203. doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>","apa":"Liang, H., Hippenmeyer, S., &#38; Ghashghaei, H. (2012). A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>","short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203.","chicago":"Liang, Huixuan, Simon Hippenmeyer, and H. Ghashghaei. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>. Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>.","ieee":"H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” <i>Biology Open</i>, vol. 1, no. 12. Company of Biologists, pp. 1200–1203, 2012.","mla":"Liang, Huixuan, et al. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>, vol. 1, no. 12, Company of Biologists, 2012, pp. 1200–03, doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>.","ista":"Liang H, Hippenmeyer S, Ghashghaei H. 2012. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology Open. 1(12), 1200–1203."},"issue":"12","article_processing_charge":"No","day":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publication":"Biology Open","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","date_created":"2018-12-11T11:56:38Z","date_published":"2012-12-15T00:00:00Z","external_id":{"isi":["000209205700005"]},"_id":"2263","year":"2012","publist_id":"4682","file_date_updated":"2020-07-14T12:45:35Z","doi":"10.1242/bio.20122287","status":"public","date_updated":"2026-08-12T09:32:12Z","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"oa":1,"publisher":"Company of Biologists","abstract":[{"lang":"eng","text":"Nestin-cre transgenic mice have been widely used to direct recombination to neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs). Here we report that a readily utilized, and the only commercially available, Nestin-cre line is insufficient for directing recombination in early embryonic NSCs and NPCs. Analysis of recombination efficiency in multiple cre-dependent reporters and a genetic mosaic line revealed consistent temporal and spatial patterns of recombination in NSCs and NPCs. For comparison we utilized a knock-in Emx1cre line and found robust recombination in NSCs and NPCs in ventricular and subventricular zones of the cerebral cortices as early as embryonic day 12.5. In addition we found that the rate of Nestin-cre driven recombination only reaches sufficiently high levels in NSCs and NPCs during late embryonic and early postnatal periods. These findings are important when commercially available cre lines are considered for directing recombination to embryonic NSCs and NPCs."}],"quality_controlled":"1","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","file":[{"file_id":"4990","checksum":"605a1800b81227848c361fd6ba7d22ba","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2015-387-v1+1_1200.full.pdf","relation":"main_file","date_created":"2018-12-12T10:13:09Z","access_level":"open_access","creator":"system","file_size":726695}]},{"popular_science":"1","has_accepted_license":"1","issue":"2","citation":{"short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 65 (2012) 200–212.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare.","ama":"Danowski P. Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2012;65(2):200-212.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 65(2), 200–212.","mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 65, no. 2, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2012, pp. 200–12.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2012.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 65, no. 2. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 200–212, 2012."},"corr_author":"1","das_tickbox":"1","pubrep_id":"95","oa_version":"Published Version","page":"200 - 212","language":[{"iso":"ger"}],"scopus_import":"1","intvolume":"        65","ddc":["020"],"month":"09","volume":65,"author":[{"first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409"}],"department":[{"_id":"E-Lib"}],"publication_status":"published","file":[{"file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","access_level":"open_access","creator":"system","file_size":503345,"date_created":"2018-12-12T10:08:42Z","relation":"main_file","content_type":"application/pdf","file_id":"4703","checksum":"162eea47d9d840c26b496ba6ae4d1c09","date_updated":"2020-07-14T12:45:57Z"}],"title":"Kontext Open Access: Creative Commons","abstract":[{"lang":"eng","text":"Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND)."}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","main_file_link":[{"url":" http://hdl.handle.net/10760/17625","open_access":"1"}],"status":"public","date_updated":"2026-08-12T14:15:14Z","oa":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"2965","date_published":"2012-09-01T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","date_created":"2018-12-11T12:00:35Z","file_date_updated":"2020-07-14T12:45:57Z","publist_id":"3754","year":"2012","day":"01","article_processing_charge":"No","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article"},{"main_file_link":[{"url":"http://arxiv.org/abs/1112.5026","open_access":"1"}],"publisher":"American Physical Society","quality_controlled":"1","abstract":[{"lang":"eng","text":"Living cells must control the reading out or &quot;expression&quot; of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point."}],"title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","oa":1,"doi":"10.1103/PhysRevE.85.041903","status":"public","date_updated":"2026-08-12T14:29:02Z","arxiv":1,"year":"2012","publist_id":"3386","date_published":"2012-04-01T00:00:00Z","external_id":{"arxiv":["1112.5026"],"isi":["000302410200006"]},"_id":"3262","date_created":"2018-12-11T12:02:20Z","publication":"Physical Review E","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"No","day":"01","issue":"4","article_number":"041903","corr_author":"1","citation":{"ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E. 85(4), 041903.","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” <i>Physical Review E</i>, vol. 85, no. 4. American Physical Society, 2012.","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>.","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>, vol. 85, no. 4, 041903, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>.","short":"G. Tkačik, A. Walczak, W. Bialek, Physical Review E 85 (2012).","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. 2012;85(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>","apa":"Tkačik, G., Walczak, A., &#38; Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>"},"das_tickbox":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"month":"04","volume":85,"publication_status":"published","isi":1,"author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455"},{"last_name":"Walczak","full_name":"Walczak, Aleksandra","first_name":"Aleksandra"},{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"}],"department":[{"_id":"GaTk"}],"acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","intvolume":"        85","scopus_import":"1"},{"day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication":"Proceedings of the 10th ACM international conference on Embedded software","date_created":"2018-12-11T12:00:26Z","_id":"2936","external_id":{"arxiv":["1207.7019"]},"date_published":"2012-10-01T00:00:00Z","publist_id":"3799","year":"2012","arxiv":1,"status":"public","doi":"10.1145/2380356.2380370","date_updated":"2026-08-12T14:34:15Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa":1,"quality_controlled":"1","abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"title":"Finite automata with time delay blocks","publisher":"ACM","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7019"}],"scopus_import":"1","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"conference":{"start_date":"2012-10-07","location":"Tampere, Finland","end_date":"2012-10-12","name":"EMSOFT: Embedded Software "},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","month":"10","language":[{"iso":"eng"}],"oa_version":"Preprint","page":"43 - 52","ec_funded":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>Proceedings of the 10th ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. Proceedings of the 10th ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>Proceedings of the 10th ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52."}},{"intvolume":"      6658","scopus_import":"1","acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","publication_status":"published","conference":{"location":"Münster, Germany","start_date":"2011-05-18","end_date":"2011-05-20","name":"GbRPR: Graph-based Representations in Pattern Recognition"},"author":[{"first_name":"Nicole M.","full_name":"Artner, Nicole M.","last_name":"Artner"},{"full_name":"Ion, Adrian","last_name":"Ion","id":"29F89302-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"last_name":"Kropatsch","full_name":"Kropatsch, Walter G.","first_name":"Walter G."}],"department":[{"_id":"HeEd"}],"volume":6658,"month":"06","editor":[{"full_name":"Jiang, Xiaoyi","last_name":"Jiang","first_name":"Xiaoyi"},{"first_name":"Miquel","full_name":"Ferrer, Miquel","last_name":"Ferrer"},{"last_name":"Torsello","full_name":"Torsello, Andrea","first_name":"Andrea"}],"language":[{"iso":"eng"}],"page":"215-224","oa_version":"None","alternative_title":["LNCS"],"corr_author":"1","citation":{"apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>","short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>.","chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>.","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224."},"article_processing_charge":"No","day":"01","place":"Berlin, Heidelberg","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","publication":"Graph-Based Representations in Pattern Recognition","date_created":"2022-03-21T08:08:35Z","date_published":"2011-06-01T00:00:00Z","_id":"10907","year":"2011","status":"public","doi":"10.1007/978-3-642-20844-7_22","date_updated":"2024-10-09T21:02:32Z","publisher":"Springer","quality_controlled":"1","title":"Spatio-temporal extraction of articulated models in a graph pyramid","abstract":[{"text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts.","lang":"eng"}],"publication_identifier":{"eisbn":["9783642208447"],"issn":["0302-9743"],"isbn":["9783642208430"],"eissn":["1611-3349"]},"series_title":"LNIP"},{"status":"public","date_updated":"2025-09-30T09:25:10Z","doi":"10.1523/JNEUROSCI.6398-10.2011","oa":1,"abstract":[{"lang":"eng","text":"Spontaneous release of glutamate is important for maintaining synaptic strength and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report that external Ca2+ triggers spontaneous glutamate release more weakly than evoked release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement of spontaneous release by extracellular calcium is insensitive to chelation of intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR), a G-protein-coupled receptor present in nerve terminals, by several specific agonists increased spontaneous glutamate release. The frequency of spontaneous synaptic transmission was decreased in CaSR mutant neurons. The concentration-effect relationship for extracellular calcium regulation of spontaneous release was well described by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these results indicate that extracellular Ca2+ does not trigger spontaneous glutamate release by simply increasing calcium influx but stimulates CaSR and thereby promotes resting spontaneous glutamate release. "}],"title":"Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor","quality_controlled":"1","publisher":"Wiley-Blackwell","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/"}],"day":"23","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publication":"European Journal of Neuroscience","date_created":"2018-12-11T11:46:39Z","external_id":{"isi":["000288750700025"]},"_id":"469","date_published":"2011-03-23T00:00:00Z","publist_id":"7353","year":"2011","citation":{"mla":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>.","chicago":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>.","ieee":"N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor,” <i>European Journal of Neuroscience</i>, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.","ista":"Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. European Journal of Neuroscience. 31(12), 4593–4606.","apa":"Vyleta, N., &#38; Smith, S. (2011). Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>","ama":"Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. 2011;31(12):4593-4606. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>","short":"N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606."},"issue":"12","scopus_import":"1","intvolume":"        31","author":[{"last_name":"Vyleta","full_name":"Vyleta, Nicholas","first_name":"Nicholas","id":"36C4978E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Smith, Stephen","last_name":"Smith","first_name":"Stephen"}],"department":[{"_id":"PeJo"}],"publication_status":"published","isi":1,"month":"03","volume":31,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","page":"4593 - 4606"},{"date_updated":"2025-09-30T09:24:43Z","doi":"10.1155/2011/935364","status":"public","oa":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file":[{"file_id":"4642","checksum":"8263bbf255171f2054f43f3db5f53b6e","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf","date_created":"2018-12-12T10:07:44Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":2863551}],"publisher":"Hindawi Publishing Corporation","abstract":[{"text":"BioSig is an open source software library for biomedical signal processing. The aim of the BioSig project is to foster research in biomedical signal processing by providing free and open source software tools for many different application areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research. Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram (ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG), or respiration signals is a very relevant element of the BioSig project. Specifically, BioSig provides solutions for data acquisition, artifact processing, quality control, feature extraction, classification, modeling, and data visualization, to name a few. In this paper, we highlight several methods to help students and researchers to work more efficiently with biomedical signals. ","lang":"eng"}],"quality_controlled":"1","title":"BioSig: The free and open source software library for biomedical signal processing","article_processing_charge":"No","day":"01","publication":"Computational Intelligence and Neuroscience","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","date_published":"2011-01-01T00:00:00Z","_id":"490","external_id":{"isi":["000208906100033"]},"date_created":"2018-12-11T11:46:45Z","file_date_updated":"2020-07-14T12:46:35Z","year":"2011","publist_id":"7330","has_accepted_license":"1","corr_author":"1","article_number":"935364","citation":{"ama":"Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. 2011;2011. doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>","apa":"Schlögl, A., Vidaurre, C., &#38; Sander, T. (2011). BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>","short":"A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience 2011 (2011).","chicago":"Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation, 2011. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>.","ieee":"A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source software library for biomedical signal processing,” <i>Computational Intelligence and Neuroscience</i>, vol. 2011. Hindawi Publishing Corporation, 2011.","mla":"Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>, vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>.","ista":"Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software library for biomedical signal processing. Computational Intelligence and Neuroscience. 2011, 935364."},"intvolume":"      2011","ddc":["005"],"scopus_import":"1","volume":2011,"month":"01","isi":1,"publication_status":"published","author":[{"last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vidaurre, Carmen","last_name":"Vidaurre","first_name":"Carmen"},{"first_name":"Tilmann","last_name":"Sander","full_name":"Sander, Tilmann"}],"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"pubrep_id":"947","oa_version":"Published Version","language":[{"iso":"eng"}]},{"oa_version":"None","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"         4","volume":4,"month":"11","department":[{"_id":"MiSi"}],"author":[{"first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","last_name":"Eichner","full_name":"Eichner, Alexander"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt"}],"publication_status":"published","isi":1,"issue":"198","citation":{"ista":"Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes. Science Signaling. 4(198), pe43.","ieee":"A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,” <i>Science Signaling</i>, vol. 4, no. 198. American Association for the Advancement of Science, 2011.","chicago":"Eichner, Alexander, and Michael K Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>.","mla":"Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>, vol. 4, no. 198, pe43, American Association for the Advancement of Science, 2011, doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>.","short":"A. Eichner, M.K. Sixt, Science Signaling 4 (2011).","ama":"Eichner A, Sixt MK. Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. 2011;4(198). doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>","apa":"Eichner, A., &#38; Sixt, M. K. (2011). Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>"},"corr_author":"1","article_number":"pe43","_id":"491","external_id":{"isi":["000296800500002"]},"date_published":"2011-11-08T00:00:00Z","date_created":"2018-12-11T11:46:46Z","publist_id":"7329","year":"2011","day":"08","article_processing_charge":"No","publication":"Science Signaling","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","abstract":[{"text":"In their search for antigens, lymphocytes continuously shuttle among blood vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization, a process that decreases their signaling output after previous exposure to high ligand concentration. Such desensitization can explain why lymphocytes do not take an intermediate position between two signals but rather oscillate between them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase 2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high vascular S1P concentrations, thereby reducing responsiveness to the chemokine signal and trapping the cells in the vascular compartment. The desensitization kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature and lymphatic tissue, although the positional information in both compartments is static.","lang":"eng"}],"title":"Setting the clock for recirculating lymphocytes","quality_controlled":"1","publisher":"American Association for the Advancement of Science","doi":"10.1126/scisignal.2002617","status":"public","date_updated":"2025-09-30T09:24:17Z"},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/","open_access":"1"}],"title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells","abstract":[{"lang":"eng","text":"Cancer stem cells or cancer initiating cells are believed to contribute to cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with fundamental roles in gene regulation. The role of miRNAs in cancer stem cells is only poorly understood. Here, we report miRNA expression profiles of glioblastoma stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore, inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is a putative transcription factor, which induces the expression of the anti-proliferative cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9 * and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival. Our findings could provide a basis for novel strategies of glioblastoma therapy."}],"quality_controlled":"1","publisher":"Wiley-Blackwell","oa":1,"article_type":"original","doi":"10.1038/emboj.2011.301","status":"public","date_updated":"2025-09-30T09:23:51Z","publist_id":"7301","year":"2011","external_id":{"isi":["000296715800018"],"pmid":["21857646"]},"_id":"518","date_published":"2011-10-19T00:00:00Z","pmid":1,"date_created":"2018-12-11T11:46:55Z","publication":"EMBO Journal","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","day":"19","article_processing_charge":"No","issue":"20","citation":{"ista":"Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M, Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322.","mla":"Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>, vol. 30, no. 20, Wiley-Blackwell, 2011, pp. 4309–22, doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>.","ieee":"D. Schraivogel <i>et al.</i>, “CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells,” <i>EMBO Journal</i>, vol. 30, no. 20. Wiley-Blackwell, pp. 4309–4322, 2011.","chicago":"Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai, Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>.","short":"D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu, M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.","apa":"Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu, J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>","ama":"Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. 2011;30(20):4309-4322. doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>"},"oa_version":"Submitted Version","page":"4309 - 4322","language":[{"iso":"eng"}],"month":"10","volume":30,"author":[{"first_name":"Daniel","full_name":"Schraivogel, Daniel","last_name":"Schraivogel"},{"full_name":"Weinmann, Lasse","last_name":"Weinmann","first_name":"Lasse"},{"last_name":"Beier","full_name":"Beier, Dagmar","first_name":"Dagmar"},{"first_name":"Ghazaleh","full_name":"Tabatabai, Ghazaleh","last_name":"Tabatabai"},{"last_name":"Eichner","full_name":"Eichner, Alexander","first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zhu, Jia","last_name":"Zhu","first_name":"Jia"},{"last_name":"Anton","full_name":"Anton, Martina","first_name":"Martina"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K"},{"full_name":"Weller, Michael","last_name":"Weller","first_name":"Michael"},{"last_name":"Beier","full_name":"Beier, Christoph","first_name":"Christoph"},{"full_name":"Meister, Gunter","last_name":"Meister","first_name":"Gunter"}],"department":[{"_id":"MiSi"}],"isi":1,"publication_status":"published","scopus_import":"1","intvolume":"        30"},{"corr_author":"1","citation":{"ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. 2011;39(3):297-331. doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2011). Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” <i>Formal Methods in System Design</i>, vol. 39, no. 3. Springer, pp. 297–331, 2011.","mla":"Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331."},"issue":"3","language":[{"iso":"eng"}],"page":"297 - 331","oa_version":"Published Version","isi":1,"publication_status":"published","department":[{"_id":"ToHe"}],"author":[{"last_name":"Guerraoui","full_name":"Guerraoui, Rachid","first_name":"Rachid"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Singh","full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"volume":39,"month":"12","ddc":["000"],"intvolume":"        39","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf"}],"publisher":"Springer","abstract":[{"text":"Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models.","lang":"eng"}],"title":"Verification of STM on relaxed memory models","quality_controlled":"1","article_type":"original","oa":1,"status":"public","date_updated":"2025-09-30T09:23:08Z","doi":"10.1007/s10703-011-0131-3","year":"2011","publist_id":"7288","date_created":"2018-12-11T11:47:00Z","date_published":"2011-12-01T00:00:00Z","_id":"531","external_id":{"isi":["000297596900004"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publication":"Formal Methods in System Design","article_processing_charge":"No","day":"01"},{"citation":{"short":"K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.","apa":"Chatterjee, K., &#38; Henzinger, M. (2011). <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>","ama":"Chatterjee K, Henzinger M. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>","ista":"Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.","mla":"Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>.","chicago":"Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>.","ieee":"K. Chatterjee and M. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011."},"related_material":{"record":[{"status":"public","id":"3165","relation":"later_version"}]},"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","month":"07","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"}],"department":[{"_id":"KrCh"}],"publication_status":"published","ddc":["000","004"],"oa_version":"Published Version","page":"20","language":[{"iso":"eng"}],"pubrep_id":"15","oa":1,"doi":"10.15479/AT:IST-2011-0009","date_updated":"2025-07-10T11:52:28Z","status":"public","publication_identifier":{"issn":["2664-1690"]},"file":[{"file_name":"IST-2011-0009_IST-2011-0009.pdf","date_created":"2018-12-12T11:53:43Z","relation":"main_file","creator":"system","access_level":"open_access","file_size":388665,"checksum":"0b354264229045d982332fd2cb5b9a26","file_id":"5504","content_type":"application/pdf","date_updated":"2020-07-14T12:46:39Z"}],"abstract":[{"lang":"eng","text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem."}],"title":"An O(n2) time algorithm for alternating Büchi games","publisher":"IST Austria","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:39Z","year":"2011","_id":"5379","date_published":"2011-07-11T00:00:00Z","date_created":"2018-12-12T11:38:59Z"},{"citation":{"ama":"Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>","apa":"Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","chicago":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>.","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p."},"publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","has_accepted_license":"1","abstract":[{"text":"We consider 2-player games played on a finite state space for an infinite number of rounds.  The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives.  We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies.  In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision;  and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.","lang":"eng"}],"title":"Bounded rationality in concurrent parity games","alternative_title":["IST Austria Technical Report"],"file":[{"content_type":"application/pdf","file_id":"5544","checksum":"0fd38186409be819a911c4990fa79d1f","date_updated":"2020-07-14T12:46:39Z","file_name":"IST-2011-0008_IST-2011-0008.pdf","relation":"main_file","date_created":"2018-12-12T11:54:22Z","file_size":500399,"access_level":"open_access","creator":"system"}],"related_material":{"record":[{"status":"public","id":"3338","relation":"later_version"}]},"oa":1,"doi":"10.15479/AT:IST-2011-0008","date_updated":"2025-06-26T09:28:52Z","status":"public","year":"2011","language":[{"iso":"eng"}],"page":"53","file_date_updated":"2020-07-14T12:46:39Z","oa_version":"Published Version","date_created":"2018-12-12T11:39:00Z","date_published":"2011-07-11T00:00:00Z","_id":"5380","pubrep_id":"16","type":"technical_report","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"}],"month":"07","ddc":["000"],"day":"11"}]