[{"month":"03","page":"239 - 258","publication_status":"published","_id":"3331","issue":"3","main_file_link":[{"url":"http://arxiv.org/abs/1104.1510","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with  bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.","lang":"eng"}],"arxiv":1,"doi":"10.1016/j.jsc.2011.11.001","scopus_import":"1","volume":47,"title":"A worst case bound for topology computation of algebraic curves","publication":"Journal of Symbolic Computation","oa":1,"oa_version":"Preprint","isi":1,"year":"2012","intvolume":"        47","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2012-03-01T00:00:00Z","quality_controlled":"1","das_tickbox":"1","publist_id":"3303","citation":{"chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i>Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>.","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i>Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>.","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i>Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i>Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258."},"date_updated":"2026-07-07T13:11:38Z","corr_author":"1","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:02:43Z","article_processing_charge":"No","status":"public","day":"01","author":[{"first_name":"Michael","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}],"publisher":"Elsevier","external_id":{"arxiv":["1104.1510"],"isi":["000300115300002"]}},{"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","title":"Partial-observation stochastic games: How to win when belief fails","ec_funded":1,"year":"2012","isi":1,"oa":1,"oa_version":"Preprint","acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","month":"08","scopus_import":"1","doi":"10.1109/LICS.2012.28","abstract":[{"text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"2955","publication_status":"published","day":"23","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5381"},{"id":"2211","relation":"later_version","status":"public"}]},"article_number":"6280436","article_processing_charge":"No","status":"public","date_created":"2018-12-11T12:00:32Z","department":[{"_id":"KrCh"}],"external_id":{"isi":["000309059900023"],"arxiv":["1107.2141"]},"publisher":"IEEE","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"type":"conference","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"conference":{"start_date":"2012-06-25","end_date":"2012-06-28","location":"Dubrovnik, Croatia","name":"LICS: Logic in Computer Science"},"date_updated":"2026-07-07T14:01:25Z","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280436, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>.","ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia, 2012."},"quality_controlled":"1","publist_id":"3771","date_published":"2012-08-23T00:00:00Z"},{"oa_version":"None","isi":1,"year":"2012","ec_funded":1,"title":"Algorithmic analysis of array-accessing programs","volume":13,"publication":"ACM Transactions on Computational Logic","_id":"2967","issue":"3","publication_status":"published","abstract":[{"lang":"eng","text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1145/2287718.2287727","month":"08","acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Weinstein, Scott","first_name":"Scott","last_name":"Weinstein"}],"external_id":{"isi":["000308370100009"]},"publisher":"ACM","date_created":"2018-12-11T12:00:36Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","status":"public","day":"01","article_number":"27","related_material":{"record":[{"id":"4403","status":"public","relation":"earlier_version"}]},"date_published":"2012-08-01T00:00:00Z","quality_controlled":"1","das_tickbox":"1","publist_id":"3748","date_updated":"2026-07-07T14:01:59Z","citation":{"mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 3, 27, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic 13 (2012).","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>.","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic</i>. 2012;13(3). doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 3. ACM, 2012.","ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic. 13(3), 27."},"intvolume":"        13","language":[{"iso":"eng"}],"type":"journal_article","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"language":[{"iso":"eng"}],"type":"journal_article","intvolume":"        13","date_updated":"2026-07-07T14:02:16Z","citation":{"mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 4, 29, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>.","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic 13 (2012).","apa":"Boker, U., &#38; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>","chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>.","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic</i>. 2012;13(4). doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>","ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” <i>ACM Transactions on Computational Logic</i>, vol. 13, no. 4. ACM, 2012.","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic. 13(4), 29."},"date_published":"2012-10-01T00:00:00Z","publist_id":"7326","das_tickbox":"1","quality_controlled":"1","status":"public","article_processing_charge":"No","day":"01","article_number":"29","corr_author":"1","date_created":"2018-12-11T11:46:47Z","department":[{"_id":"ToHe"}],"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"external_id":{"isi":["000310163600002"]},"publisher":"ACM","month":"10","abstract":[{"text":"We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1145/2362355.2362357","issue":"4","_id":"494","publication_status":"published","publication":"ACM Transactions on Computational Logic","title":"Translating to Co-Büchi made tight, unified, and useful","volume":13,"year":"2012","oa_version":"None","isi":1},{"type":"conference","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"intvolume":"      7501","date_updated":"2026-07-08T05:50:39Z","conference":{"name":"ESA: European Symposium on Algorithms","location":"Ljubljana, Slovenia","end_date":"2012-09-12","start_date":"2012-09-10"},"citation":{"ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. 20th Annual European Symposium on Algorithms . ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>20th Annual European Symposium on Algorithms </i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>20th Annual European Symposium on Algorithms </i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>20th Annual European Symposium on Algorithms </i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>20th Annual European Symposium on Algorithms </i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>20th Annual European Symposium on Algorithms </i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, 20th Annual European Symposium on Algorithms , Springer, 2012, pp. 301–312."},"das_tickbox":"1","quality_controlled":"1","date_published":"2012-10-01T00:00:00Z","day":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"535"}]},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783642330902"],"isbn":["9783642330896"]},"article_processing_charge":"No","status":"public","date_created":"2022-03-21T08:01:45Z","department":[{"_id":"KrCh"}],"corr_author":"1","external_id":{"arxiv":["1604.08234"]},"publisher":"Springer","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"alternative_title":["LNCS"],"acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","month":"10","scopus_import":"1","doi":"10.1007/978-3-642-33090-2_27","abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help.","lang":"eng"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10905","page":"301-312","publication_status":"published","publication":"20th Annual European Symposium on Algorithms ","volume":7501,"title":"Polynomial-time algorithms for energy games with special weight structures","ec_funded":1,"year":"2012","oa_version":"Preprint","oa":1},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"day":"01","status":"public","article_processing_charge":"No","date_created":"2018-12-11T12:00:10Z","department":[{"_id":"ToHe"}],"corr_author":"1","date_updated":"2026-07-28T09:20:59Z","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Hyderabad, India","end_date":"2012-12-17","start_date":"2012-12-15"},"citation":{"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>.","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>","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>.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, 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.","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>","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."},"pubrep_id":"805","publist_id":"3867","file_date_updated":"2020-07-14T12:45:52Z","das_tickbox":"1","quality_controlled":"1","date_published":"2012-12-01T00:00:00Z","type":"conference","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"intvolume":"        18","ddc":["004"],"year":"2012","has_accepted_license":"1","file":[{"file_size":559069,"access_level":"open_access","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_name":"IST-2017-805-v1+1_34.pdf","date_created":"2018-12-12T10:10:37Z","relation":"main_file","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","creator":"system","file_id":"4826"}],"oa":1,"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"publication":"Leibniz International Proceedings in Informatics","volume":18,"title":"Approximate determinization of quantitative automata","ec_funded":1,"scopus_import":"1","doi":"10.4230/LIPIcs.FSTTCS.2012.362","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2891","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","publication_status":"published","page":"362 - 373","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","alternative_title":["LIPIcs"],"month":"12"},{"date_published":"2012-04-01T00:00:00Z","quality_controlled":"1","das_tickbox":"1","editor":[{"full_name":"Flanagan, Cormac","first_name":"Cormac","last_name":"Flanagan"},{"full_name":"König, Barbara","first_name":"Barbara","last_name":"König"}],"date_updated":"2026-07-28T09:23:52Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Tallinn, Estonia","end_date":"2012-04-01","start_date":"2012-03-24"},"citation":{"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.","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>.","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>","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>.","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>","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."},"intvolume":"      7214","series_title":"LNCS","language":[{"iso":"eng"}],"OA_type":"free access","type":"conference","author":[{"last_name":"Grebenshchikov","first_name":"Sergey","full_name":"Grebenshchikov, Sergey"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"last_name":"Lopes","first_name":"Nuno P.","full_name":"Lopes, Nuno P."},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"first_name":"Andrey","last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey"}],"publisher":"Springer","corr_author":"1","date_created":"2022-03-21T08:03:30Z","place":"Berlin, Heidelberg","department":[{"_id":"ToHe"}],"status":"public","article_processing_charge":"No","publication_identifier":{"eisbn":["9783642287565"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642287558"]},"day":"01","_id":"10906","publication_status":"published","page":"549-551","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"scopus_import":"1","doi":"10.1007/978-3-642-28756-5_46","month":"04","alternative_title":["LNCS"],"oa":1,"oa_version":"Published Version","ddc":["000"],"year":"2012","volume":7214,"title":"HSF(C): A software verifier based on Horn clauses","publication":"Tools and Algorithms for the Construction and Analysis of Systems"},{"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       197","citation":{"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>","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.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","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>.","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>","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 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>."},"date_updated":"2026-07-28T09:22:21Z","file_date_updated":"2020-07-14T12:46:36Z","publist_id":"7314","quality_controlled":"1","das_tickbox":"1","date_published":"2012-04-30T00:00:00Z","day":"30","status":"public","article_processing_charge":"No","department":[{"_id":"MiSi"}],"date_created":"2018-12-11T11:46:51Z","corr_author":"1","publisher":"Rockefeller University Press","article_type":"original","external_id":{"isi":["000303467800004"]},"author":[{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"}],"month":"04","doi":"10.1083/jcb.201204039","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","page":"347 - 349","_id":"506","issue":"3","publication":"Journal of Cell Biology","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (3.0)","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"},"volume":197,"title":"Cell migration: Fibroblasts find a new way to get ahead","year":"2012","ddc":["570"],"has_accepted_license":"1","isi":1,"file":[{"date_updated":"2020-07-14T12:46:36Z","relation":"main_file","file_id":"5957","creator":"kschuh","content_type":"application/pdf","access_level":"open_access","file_size":986566,"date_created":"2019-02-12T09:03:09Z","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","file_name":"2012_CellBiology_Sixt.pdf"}],"oa":1,"oa_version":"Published Version"},{"external_id":{"arxiv":["1201.5073"]},"publisher":"Springer","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","first_name":"Jean-François","full_name":"Raskin, Jean-François"}],"day":"15","related_material":{"record":[{"relation":"later_version","status":"public","id":"2716"}]},"article_processing_charge":"No","status":"public","publication_identifier":{"isbn":["9783642329395"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642329401"]},"place":"Berlin, Heidelberg","date_created":"2022-03-21T08:00:21Z","department":[{"_id":"KrCh"}],"corr_author":"1","date_updated":"2026-07-28T11:24:51Z","conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Newcastle upon Tyne, United Kingdom","end_date":"2012-09-07","start_date":"2012-09-04"},"citation":{"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>.","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>","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>.","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.","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.","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>"},"editor":[{"full_name":"Koutny, Maciej","last_name":"Koutny","first_name":"Maciej"},{"first_name":"Irek","last_name":"Ulidowski","full_name":"Ulidowski, Irek"}],"quality_controlled":"1","date_published":"2012-09-15T00:00:00Z","type":"conference","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"OA_type":"green","language":[{"iso":"eng"}],"intvolume":"      7454","year":"2012","oa_version":"Preprint","oa":1,"publication":"CONCUR 2012 - Concurrency Theory","volume":7454,"title":"Strategy synthesis for multi-dimensional quantitative objectives","ec_funded":1,"scopus_import":"1","doi":"10.1007/978-3-642-32940-1_10","abstract":[{"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.","lang":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.5073","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10904","page":"115-131","publication_status":"published","alternative_title":["LNCS"],"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.","month":"09","OA_place":"repository"},{"volume":338,"title":"Forces driving epithelial spreading in zebrafish gastrulation","publication":"Science","isi":1,"oa_version":"None","year":"2012","month":"10","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.","issue":"6104","_id":"2950","publication_status":"published","page":"257 - 260","pmid":1,"scopus_import":"1","doi":"10.1126/science.1224143","acknowledged_ssus":[{"_id":"SSU"}],"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"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:00:30Z","department":[{"_id":"CaHe"},{"_id":"Bio"}],"corr_author":"1","day":"12","related_material":{"record":[{"id":"1403","status":"public","relation":"dissertation_contains"}]},"article_processing_charge":"No","status":"public","external_id":{"isi":["000309712300046"],"pmid":["23066079"]},"publisher":"American Association for the Advancement of Science","article_type":"original","author":[{"first_name":"Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","full_name":"Behrndt, Martin"},{"last_name":"Salbreux","first_name":"Guillaume","full_name":"Salbreux, Guillaume"},{"full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","last_name":"Campinho","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"},{"first_name":"Julia","id":"4220E59C-F248-11E8-B48F-1D18A9856A87","last_name":"Roensch","full_name":"Roensch, Julia"},{"full_name":"Grill, Stephan","last_name":"Grill","first_name":"Stephan"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}],"intvolume":"       338","OA_type":"closed access","type":"journal_article","project":[{"name":"Control of Epithelial Cell Layer Spreading in Zebrafish","_id":"252ABD0A-B435-11E9-9278-68D0E5697425","grant_number":"I930-B20","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"publist_id":"3778","quality_controlled":"1","date_published":"2012-10-12T00:00:00Z","date_updated":"2026-07-29T10:07:18Z","citation":{"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.","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>","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>.","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.","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>","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."}},{"related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"day":"28","status":"public","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:01:43Z","publisher":"Nature Publishing Group","external_id":{"pmid":["22722843"],"isi":["000305760600044"]},"author":[{"last_name":"Diaz Jr","first_name":"Luis","full_name":"Diaz Jr, Luis"},{"last_name":"Williams","first_name":"Richard","full_name":"Williams, Richard"},{"first_name":"Jian","last_name":"Wu","full_name":"Wu, Jian"},{"full_name":"Kinde, Isaac","last_name":"Kinde","first_name":"Isaac"},{"last_name":"Hecht","first_name":"Joel","full_name":"Hecht, Joel"},{"full_name":"Berlin, Jordan","last_name":"Berlin","first_name":"Jordan"},{"full_name":"Allen, Benjamin","last_name":"Allen","first_name":"Benjamin"},{"first_name":"Ivana","last_name":"Božić","full_name":"Božić, Ivana"},{"full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","first_name":"Johannes"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"full_name":"Kinzler, Kenneth","last_name":"Kinzler","first_name":"Kenneth"},{"last_name":"Oliner","first_name":"Kelly","full_name":"Oliner, Kelly"},{"first_name":"Bert","last_name":"Vogelstein","full_name":"Vogelstein, Bert"}],"project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       486","citation":{"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.","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.","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>.","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>"},"date_updated":"2026-07-29T10:15:25Z","quality_controlled":"1","publist_id":"3537","date_published":"2012-06-28T00:00:00Z","publication":"Nature","volume":486,"title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","ec_funded":1,"year":"2012","isi":1,"oa_version":"Submitted Version","oa":1,"month":"06","doi":"10.1038/nature11219","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/"}],"abstract":[{"lang":"eng","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."}],"pmid":1,"publication_status":"published","page":"537 - 540","_id":"3157","issue":"7404"},{"intvolume":"        81","language":[{"iso":"eng"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","date_published":"2012-02-01T00:00:00Z","quality_controlled":"1","publist_id":"3388","citation":{"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>","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.","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 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>","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>.","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>.","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80."},"date_updated":"2026-07-29T10:15:25Z","corr_author":"1","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:02:19Z","article_processing_charge":"No","status":"public","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1400"}]},"day":"01","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"publisher":"Academic Press","external_id":{"pmid":["22120126"],"isi":["000298938200006"]},"month":"02","pmid":1,"publication_status":"published","page":"69 - 80","issue":"1","_id":"3260","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ ","open_access":"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"}],"doi":"10.1016/j.tpb.2011.11.003","scopus_import":"1","ec_funded":1,"title":"Evolutionary dynamics of biological auctions","volume":81,"publication":"Theoretical Population Biology","oa":1,"oa_version":"Submitted Version","isi":1,"year":"2012"},{"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:35Z","publist_id":"4682","date_published":"2012-12-15T00:00:00Z","citation":{"short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203.","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>.","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>","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>.","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.","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.","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>"},"date_updated":"2026-08-12T09:32:12Z","pubrep_id":"387","intvolume":"         1","type":"journal_article","language":[{"iso":"eng"}],"publisher":"Company of Biologists","external_id":{"isi":["000209205700005"]},"author":[{"first_name":"Huixuan","last_name":"Liang","full_name":"Liang, Huixuan"},{"first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"last_name":"Ghashghaei","first_name":"H.","full_name":"Ghashghaei, H."}],"department":[{"_id":"SiHi"}],"date_created":"2018-12-11T11:56:38Z","day":"15","status":"public","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","page":"1200 - 1203","publication_status":"published","_id":"2263","issue":"12","doi":"10.1242/bio.20122287","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"month":"12","isi":1,"file":[{"content_type":"application/pdf","creator":"system","file_id":"4990","relation":"main_file","date_updated":"2020-07-14T12:45:35Z","checksum":"605a1800b81227848c361fd6ba7d22ba","file_name":"IST-2015-387-v1+1_1200.full.pdf","date_created":"2018-12-12T10:13:09Z","access_level":"open_access","file_size":726695}],"oa":1,"oa_version":"Published Version","ddc":["576"],"year":"2012","has_accepted_license":"1","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","volume":1,"publication":"Biology Open","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"}},{"date_updated":"2026-08-12T14:29:02Z","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.","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>","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).","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>","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>."},"quality_controlled":"1","publist_id":"3386","das_tickbox":"1","date_published":"2012-04-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        85","external_id":{"isi":["000302410200006"],"arxiv":["1112.5026"]},"publisher":"American Physical Society","author":[{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455"},{"full_name":"Walczak, Aleksandra","last_name":"Walczak","first_name":"Aleksandra"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"day":"01","article_number":"041903","article_processing_charge":"No","status":"public","date_created":"2018-12-11T12:02:20Z","department":[{"_id":"GaTk"}],"corr_author":"1","scopus_import":"1","doi":"10.1103/PhysRevE.85.041903","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."}],"arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1112.5026","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3262","issue":"4","publication_status":"published","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.","month":"04","year":"2012","isi":1,"oa_version":"Preprint","oa":1,"publication":"Physical Review E","title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","volume":85},{"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).","month":"10","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7019"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"abstract":[{"lang":"eng","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."}],"doi":"10.1145/2380356.2380370","scopus_import":"1","publication_status":"published","page":"43 - 52","_id":"2936","publication":"Proceedings of the 10th ACM international conference on Embedded software","ec_funded":1,"title":"Finite automata with time delay blocks","year":"2012","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"type":"conference","citation":{"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>.","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>","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>.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","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>","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.","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."},"conference":{"start_date":"2012-10-07","end_date":"2012-10-12","location":"Tampere, Finland","name":"EMSOFT: Embedded Software "},"date_updated":"2026-08-12T14:34:15Z","date_published":"2012-10-01T00:00:00Z","quality_controlled":"1","publist_id":"3799","article_processing_charge":"No","status":"public","day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:26Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"publisher":"ACM","external_id":{"arxiv":["1207.7019"]}},{"_id":"10907","page":"215-224","publication_status":"published","scopus_import":"1","doi":"10.1007/978-3-642-20844-7_22","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"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"06","alternative_title":["LNCS"],"acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","oa_version":"None","year":"2011","title":"Spatio-temporal extraction of articulated models in a graph pyramid","volume":6658,"publication":"Graph-Based Representations in Pattern Recognition","quality_controlled":"1","date_published":"2011-06-01T00:00:00Z","conference":{"end_date":"2011-05-20","start_date":"2011-05-18","name":"GbRPR: Graph-based Representations in Pattern Recognition","location":"Münster, Germany"},"date_updated":"2024-10-09T21:02:32Z","citation":{"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>.","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>","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>.","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.","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>","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."},"editor":[{"first_name":"Xiaoyi","last_name":"Jiang","full_name":"Jiang, Xiaoyi"},{"full_name":"Ferrer, Miquel","last_name":"Ferrer","first_name":"Miquel"},{"full_name":"Torsello, Andrea","last_name":"Torsello","first_name":"Andrea"}],"series_title":"LNIP","intvolume":"      6658","type":"conference","language":[{"iso":"eng"}],"publisher":"Springer","author":[{"last_name":"Artner","first_name":"Nicole M.","full_name":"Artner, Nicole M."},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","first_name":"Adrian","full_name":"Ion, Adrian"},{"full_name":"Kropatsch, Walter G.","first_name":"Walter G.","last_name":"Kropatsch"}],"date_created":"2022-03-21T08:08:35Z","place":"Berlin, Heidelberg","department":[{"_id":"HeEd"}],"corr_author":"1","day":"01","publication_identifier":{"eisbn":["9783642208447"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642208430"]},"article_processing_charge":"No","status":"public"},{"publist_id":"7353","quality_controlled":"1","date_published":"2011-03-23T00:00:00Z","date_updated":"2025-09-30T09:25:10Z","citation":{"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>.","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>","short":"N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606.","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>.","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>","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.","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."},"intvolume":"        31","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"isi":["000288750700025"]},"publisher":"Wiley-Blackwell","author":[{"id":"36C4978E-F248-11E8-B48F-1D18A9856A87","last_name":"Vyleta","first_name":"Nicholas","full_name":"Vyleta, Nicholas"},{"last_name":"Smith","first_name":"Stephen","full_name":"Smith, Stephen"}],"date_created":"2018-12-11T11:46:39Z","department":[{"_id":"PeJo"}],"day":"23","status":"public","article_processing_charge":"No","issue":"12","_id":"469","page":"4593 - 4606","publication_status":"published","scopus_import":"1","doi":"10.1523/JNEUROSCI.6398-10.2011","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. "}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/"}],"month":"03","isi":1,"oa_version":"Submitted Version","oa":1,"year":"2011","volume":31,"title":"Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor","publication":"European Journal of Neuroscience"},{"status":"public","article_processing_charge":"No","article_number":"935364","day":"01","corr_author":"1","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"date_created":"2018-12-11T11:46:45Z","author":[{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"full_name":"Vidaurre, Carmen","first_name":"Carmen","last_name":"Vidaurre"},{"first_name":"Tilmann","last_name":"Sander","full_name":"Sander, Tilmann"}],"publisher":"Hindawi Publishing Corporation","external_id":{"isi":["000208906100033"]},"language":[{"iso":"eng"}],"type":"journal_article","intvolume":"      2011","pubrep_id":"947","citation":{"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>.","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>.","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>","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.","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>","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."},"date_updated":"2025-09-30T09:24:43Z","date_published":"2011-01-01T00:00:00Z","publist_id":"7330","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Computational Intelligence and Neuroscience","title":"BioSig: The free and open source software library for biomedical signal processing","volume":2011,"has_accepted_license":"1","year":"2011","ddc":["005"],"oa":1,"oa_version":"Published Version","isi":1,"file":[{"date_updated":"2020-07-14T12:46:35Z","relation":"main_file","file_id":"4642","content_type":"application/pdf","creator":"system","access_level":"open_access","file_size":2863551,"date_created":"2018-12-12T10:07:44Z","file_name":"IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf","checksum":"8263bbf255171f2054f43f3db5f53b6e"}],"month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","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. "}],"doi":"10.1155/2011/935364","scopus_import":"1","publication_status":"published","_id":"490"},{"date_published":"2011-11-08T00:00:00Z","quality_controlled":"1","publist_id":"7329","citation":{"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>","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>.","short":"A. Eichner, M.K. Sixt, Science Signaling 4 (2011).","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>.","ista":"Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes. Science Signaling. 4(198), pe43.","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>","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."},"date_updated":"2025-09-30T09:24:17Z","intvolume":"         4","language":[{"iso":"eng"}],"type":"journal_article","author":[{"full_name":"Eichner, Alexander","first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","last_name":"Eichner"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"publisher":"American Association for the Advancement of Science","external_id":{"isi":["000296800500002"]},"corr_author":"1","department":[{"_id":"MiSi"}],"date_created":"2018-12-11T11:46:46Z","article_processing_charge":"No","status":"public","article_number":"pe43","day":"08","publication_status":"published","issue":"198","_id":"491","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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"}],"doi":"10.1126/scisignal.2002617","scopus_import":"1","month":"11","oa_version":"None","isi":1,"year":"2011","title":"Setting the clock for recirculating lymphocytes","volume":4,"publication":"Science Signaling"},{"citation":{"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>.","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.","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>.","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>","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.","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."},"date_updated":"2025-09-30T09:23:51Z","publist_id":"7301","quality_controlled":"1","date_published":"2011-10-19T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        30","article_type":"original","publisher":"Wiley-Blackwell","external_id":{"pmid":["21857646"],"isi":["000296715800018"]},"author":[{"first_name":"Daniel","last_name":"Schraivogel","full_name":"Schraivogel, Daniel"},{"last_name":"Weinmann","first_name":"Lasse","full_name":"Weinmann, Lasse"},{"full_name":"Beier, Dagmar","first_name":"Dagmar","last_name":"Beier"},{"first_name":"Ghazaleh","last_name":"Tabatabai","full_name":"Tabatabai, Ghazaleh"},{"first_name":"Alexander","last_name":"Eichner","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander"},{"last_name":"Zhu","first_name":"Jia","full_name":"Zhu, Jia"},{"first_name":"Martina","last_name":"Anton","full_name":"Anton, Martina"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"},{"last_name":"Weller","first_name":"Michael","full_name":"Weller, Michael"},{"first_name":"Christoph","last_name":"Beier","full_name":"Beier, Christoph"},{"full_name":"Meister, Gunter","last_name":"Meister","first_name":"Gunter"}],"day":"19","status":"public","article_processing_charge":"No","department":[{"_id":"MiSi"}],"date_created":"2018-12-11T11:46:55Z","doi":"10.1038/emboj.2011.301","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/"}],"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."}],"publication_status":"published","page":"4309 - 4322","pmid":1,"_id":"518","issue":"20","month":"10","year":"2011","isi":1,"oa_version":"Submitted Version","oa":1,"publication":"EMBO Journal","volume":30,"title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells"}]