[{"department":[{"_id":"KrPi"}],"publication":"Conference proceedings CHES 2012","page":"213 - 232","citation":{"short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i>Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>.","ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i>Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i>Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i>Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i>Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232."},"scopus_import":"1","das_tickbox":"1","status":"public","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"CHES: Cryptographic Hardware and Embedded Systems","location":"Leuven, Belgium","end_date":"2012-09-12","start_date":"2012-09-09"},"quality_controlled":"1","article_processing_charge":"No","title":"Practical leakage-resilient symmetric cryptography","date_updated":"2026-07-07T13:05:30Z","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","month":"09","ec_funded":1,"oa_version":"Preprint","day":"01","publist_id":"5003","publication_status":"published","abstract":[{"text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively.","lang":"eng"}],"alternative_title":["LNCS"],"year":"2012","oa":1,"volume":7428,"date_published":"2012-09-01T00:00:00Z","_id":"2048","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf"}],"publisher":"Springer","intvolume":"      7428","type":"conference","date_created":"2018-12-11T11:55:25Z","author":[{"last_name":"Faust","first_name":"Sebastian","full_name":"Faust, Sebastian"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Schipper, Joachim","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C","last_name":"Schipper","first_name":"Joachim"}],"doi":"10.1007/978-3-642-33027-8_13","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}]},{"title":"Lapin: An efficient authentication protocol based on ring-LPN","date_updated":"2026-07-07T13:06:19Z","acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"FSE: Fast Software Encryption","end_date":"2012-03-21","location":"Washington, DC, USA","start_date":"2012-03-19"},"language":[{"iso":"eng"}],"quality_controlled":"1","das_tickbox":"1","status":"public","publication":"Conference proceedings FSE 2012","page":"346 - 365","citation":{"short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365.","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i>Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i>Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i>Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.","apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i>Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i>Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>"},"scopus_import":"1","department":[{"_id":"KrPi"}],"author":[{"full_name":"Heyse, Stefan","last_name":"Heyse","first_name":"Stefan"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Lyubashevsky, Vadim","first_name":"Vadim","last_name":"Lyubashevsky"},{"last_name":"Paar","first_name":"Christof","full_name":"Paar, Christof"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"date_created":"2018-12-11T11:55:25Z","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"doi":"10.1007/978-3-642-34047-5_20","type":"conference","intvolume":"      7549","_id":"2049","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf"}],"publisher":"Springer","alternative_title":["LNCS"],"year":"2012","oa":1,"date_published":"2012-03-01T00:00:00Z","volume":7549,"publist_id":"5002","publication_status":"published","abstract":[{"text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n","lang":"eng"}],"ec_funded":1,"oa_version":"Preprint","day":"01","month":"03"},{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2012-03-19","location":"Oxford, UK","end_date":"2012-03-21","name":"Monterey Workshop 2012"},"language":[{"iso":"eng"}],"date_updated":"2026-07-07T13:08:58Z","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","title":"Independent implementability of viewpoints","article_processing_charge":"No","department":[{"_id":"ToHe"}],"status":"public","das_tickbox":"1","scopus_import":"1","publication":"Conference proceedings Monterey Workshop 2012","page":"380 - 395","citation":{"ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in <i>Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol. 7539, pp. 380–395.","apa":"Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability of viewpoints. In <i>Conference proceedings Monterey Workshop 2012</i> (Vol. 7539, pp. 380–395). Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>","ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: <i>Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” <i>Conference Proceedings Monterey Workshop 2012</i>, vol. 7539, Springer, 2012, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>.","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In <i>Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>.","short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395."},"publisher":"Springer","_id":"2942","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"doi":"10.1007/978-3-642-34059-8_20","date_created":"2018-12-11T12:00:28Z","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","intvolume":"      7539","day":"16","ec_funded":1,"oa_version":"None","month":"09","year":"2012","date_published":"2012-09-16T00:00:00Z","volume":7539,"alternative_title":["LNCS"],"publication_status":"published","abstract":[{"text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example.","lang":"eng"}],"publist_id":"3791"},{"external_id":{"isi":["000301691600005"]},"oa_version":"None","day":"01","month":"06","year":"2012","volume":36,"date_published":"2012-06-01T00:00:00Z","publist_id":"3372","publication_status":"published","abstract":[{"lang":"eng","text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations."}],"_id":"3274","publisher":"Elsevier","date_created":"2018-12-11T12:02:24Z","author":[{"last_name":"Rieckh","first_name":"Georg","full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kreuzer, Wolfgang","last_name":"Kreuzer","first_name":"Wolfgang"},{"first_name":"Holger","last_name":"Waubke","full_name":"Waubke, Holger"},{"full_name":"Balazs, Peter","last_name":"Balazs","first_name":"Peter"}],"doi":"10.1016/j.enganabound.2011.12.014","intvolume":"        36","type":"journal_article","issue":"6","corr_author":"1","department":[{"_id":"GaTk"}],"das_tickbox":"1","status":"public","publication":"Engineering Analysis with Boundary Elements","citation":{"ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","apa":"Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>","ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 36(6), 960–967.","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>.","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>."},"page":"960 - 967","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","date_updated":"2026-07-07T13:10:10Z","article_processing_charge":"No"},{"das_tickbox":"1","status":"public","publication":"Journal of Symbolic Computation","citation":{"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.","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>","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>","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.","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>.","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>.","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258."},"page":"239 - 258","scopus_import":"1","isi":1,"issue":"3","corr_author":"1","department":[{"_id":"HeEd"}],"title":"A worst case bound for topology computation of algebraic curves","date_updated":"2026-07-07T13:11:38Z","article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"year":"2012","oa":1,"volume":47,"date_published":"2012-03-01T00:00:00Z","publist_id":"3303","publication_status":"published","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"}],"external_id":{"arxiv":["1104.1510"],"isi":["000300115300002"]},"oa_version":"Preprint","day":"01","month":"03","author":[{"full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}],"date_created":"2018-12-11T12:02:43Z","doi":"10.1016/j.jsc.2011.11.001","intvolume":"        47","type":"journal_article","_id":"3331","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"publisher":"Elsevier"},{"arxiv":1,"oa":1,"year":"2012","date_published":"2012-08-23T00:00:00Z","related_material":{"record":[{"id":"5381","status":"public","relation":"earlier_version"},{"relation":"later_version","status":"public","id":"2211"}]},"publist_id":"3771","publication_status":"published","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"}],"external_id":{"isi":["000309059900023"],"arxiv":["1107.2141"]},"ec_funded":1,"oa_version":"Preprint","day":"23","month":"08","date_created":"2018-12-11T12:00:32Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1109/LICS.2012.28","type":"conference","_id":"2955","publisher":"IEEE","main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"status":"public","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","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>.","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.","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>.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","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.","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>","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>"},"scopus_import":"1","isi":1,"department":[{"_id":"KrCh"}],"title":"Partial-observation stochastic games: How to win when belief fails","date_updated":"2026-07-07T14:01:25Z","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.","article_processing_charge":"No","article_number":"6280436","conference":{"start_date":"2012-06-25","name":"LICS: Logic in Computer Science","location":"Dubrovnik, Croatia","end_date":"2012-06-28"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"quality_controlled":"1"},{"department":[{"_id":"ToHe"}],"issue":"3","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>.","ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic. 13(3), 27.","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>.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic 13 (2012).","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.","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>","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>"},"publication":"ACM Transactions on Computational Logic","isi":1,"scopus_import":"1","das_tickbox":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","article_number":"27","title":"Algorithmic analysis of array-accessing programs","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.","date_updated":"2026-07-07T14:01:59Z","month":"08","oa_version":"None","ec_funded":1,"external_id":{"isi":["000308370100009"]},"day":"01","related_material":{"record":[{"relation":"earlier_version","id":"4403","status":"public"}]},"publist_id":"3748","abstract":[{"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.","lang":"eng"}],"publication_status":"published","volume":13,"date_published":"2012-08-01T00:00:00Z","year":"2012","_id":"2967","publisher":"ACM","type":"journal_article","intvolume":"        13","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"full_name":"Weinstein, Scott","first_name":"Scott","last_name":"Weinstein"}],"date_created":"2018-12-11T12:00:36Z","doi":"10.1145/2287718.2287727","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}]},{"external_id":{"isi":["000310163600002"]},"oa_version":"None","day":"01","month":"10","year":"2012","volume":13,"date_published":"2012-10-01T00:00:00Z","publist_id":"7326","publication_status":"published","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"}],"_id":"494","publisher":"ACM","author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"date_created":"2018-12-11T11:46:47Z","doi":"10.1145/2362355.2362357","intvolume":"        13","type":"journal_article","issue":"4","corr_author":"1","department":[{"_id":"ToHe"}],"das_tickbox":"1","status":"public","publication":"ACM Transactions on Computational Logic","citation":{"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>.","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic. 13(4), 29.","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).","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>","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>","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."},"scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Translating to Co-Büchi made tight, unified, and useful","date_updated":"2026-07-07T14:02:16Z","article_processing_charge":"No","article_number":"29"},{"month":"10","day":"01","ec_funded":1,"external_id":{"arxiv":["1604.08234"]},"oa_version":"Preprint","publication_status":"published","abstract":[{"lang":"eng","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."}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"535"}]},"oa":1,"year":"2012","volume":7501,"date_published":"2012-10-01T00:00:00Z","arxiv":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"publisher":"Springer","_id":"10905","type":"conference","intvolume":"      7501","doi":"10.1007/978-3-642-33090-2_27","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"date_created":"2022-03-21T08:01:45Z","department":[{"_id":"KrCh"}],"corr_author":"1","scopus_import":"1","publication":"20th Annual European Symposium on Algorithms ","page":"301-312","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.","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>.","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>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, 20th Annual European Symposium on Algorithms , Springer, 2012, pp. 301–312.","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>","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>"},"status":"public","das_tickbox":"1","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2012-09-10","name":"ESA: European Symposium on Algorithms","end_date":"2012-09-12","location":"Ljubljana, Slovenia"},"article_processing_charge":"No","publication_identifier":{"isbn":["9783642330896"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642330902"]},"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","date_updated":"2026-07-08T05:50:39Z","title":"Polynomial-time algorithms for energy games with special weight structures"},{"day":"01","ec_funded":1,"oa_version":"Published Version","month":"12","has_accepted_license":"1","oa":1,"year":"2012","date_published":"2012-12-01T00:00:00Z","volume":18,"alternative_title":["LIPIcs"],"publication_status":"published","abstract":[{"text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","publist_id":"3867","file":[{"date_updated":"2020-07-14T12:45:52Z","creator":"system","file_name":"IST-2017-805-v1+1_34.pdf","date_created":"2018-12-12T10:10:37Z","relation":"main_file","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_id":"4826","content_type":"application/pdf","file_size":559069,"access_level":"open_access"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"2891","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"doi":"10.4230/LIPIcs.FSTTCS.2012.362","author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"date_created":"2018-12-11T12:00:10Z","intvolume":"        18","type":"conference","ddc":["004"],"corr_author":"1","department":[{"_id":"ToHe"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","status":"public","pubrep_id":"805","das_tickbox":"1","scopus_import":"1","publication":"Leibniz International Proceedings in Informatics","tmp":{"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","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"citation":{"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.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","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.","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>","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>"},"page":"362 - 373","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2012-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2012-12-17","location":"Hyderabad, India"},"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","date_updated":"2026-07-28T09:20:59Z","title":"Approximate determinization of quantitative automata","article_processing_charge":"No"},{"main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"publisher":"Springer","_id":"10906","type":"conference","intvolume":"      7214","doi":"10.1007/978-3-642-28756-5_46","editor":[{"first_name":"Cormac","last_name":"Flanagan","full_name":"Flanagan, Cormac"},{"full_name":"König, Barbara","first_name":"Barbara","last_name":"König"}],"date_created":"2022-03-21T08:03:30Z","author":[{"first_name":"Sergey","last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey"},{"first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lopes","first_name":"Nuno P.","full_name":"Lopes, Nuno P."},{"full_name":"Popeea, Corneliu","first_name":"Corneliu","last_name":"Popeea"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"month":"04","series_title":"LNCS","day":"01","place":"Berlin, Heidelberg","oa_version":"Published Version","publication_status":"published","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"}],"oa":1,"year":"2012","volume":7214,"date_published":"2012-04-01T00:00:00Z","alternative_title":["LNCS"],"OA_type":"free access","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2012-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2012-04-01","location":"Tallinn, Estonia"},"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642287558"],"eissn":["1611-3349"],"eisbn":["9783642287565"]},"date_updated":"2026-07-28T09:23:52Z","title":"HSF(C): A software verifier based on Horn clauses","department":[{"_id":"ToHe"}],"corr_author":"1","ddc":["000"],"scopus_import":"1","publication":"Tools and Algorithms for the Construction and Analysis of Systems","page":"549-551","citation":{"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>","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.","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","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."},"status":"public","das_tickbox":"1"},{"date_published":"2012-04-30T00:00:00Z","volume":197,"year":"2012","oa":1,"publist_id":"7314","file_date_updated":"2020-07-14T12:46:36Z","article_type":"original","publication_status":"published","oa_version":"Published Version","external_id":{"isi":["000303467800004"]},"day":"30","has_accepted_license":"1","month":"04","author":[{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"}],"date_created":"2018-12-11T11:46:51Z","doi":"10.1083/jcb.201204039","type":"journal_article","intvolume":"       197","file":[{"checksum":"45c02be33ebd99fc3077d60b9c90bdfa","relation":"main_file","file_id":"5957","content_type":"application/pdf","access_level":"open_access","file_size":986566,"date_updated":"2020-07-14T12:46:36Z","creator":"kschuh","date_created":"2019-02-12T09:03:09Z","file_name":"2012_CellBiology_Sixt.pdf"}],"_id":"506","publisher":"Rockefeller University Press","das_tickbox":"1","status":"public","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>","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>","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>.","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>.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349."},"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"},"page":"347 - 349","publication":"Journal of Cell Biology","isi":1,"scopus_import":"1","ddc":["570"],"corr_author":"1","issue":"3","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","department":[{"_id":"MiSi"}],"title":"Cell migration: Fibroblasts find a new way to get ahead","date_updated":"2026-07-28T09:22:21Z","article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"type":"conference","intvolume":"      7454","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1007/978-3-642-32940-1_10","editor":[{"first_name":"Maciej","last_name":"Koutny","full_name":"Koutny, Maciej"},{"full_name":"Ulidowski, Irek","first_name":"Irek","last_name":"Ulidowski"}],"date_created":"2022-03-21T08:00:21Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Mickael","last_name":"Randour","full_name":"Randour, Mickael"},{"last_name":"Raskin","first_name":"Jean-François","full_name":"Raskin, Jean-François"}],"publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1201.5073"}],"_id":"10904","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"publication_status":"published","related_material":{"record":[{"id":"2716","status":"public","relation":"later_version"}]},"date_published":"2012-09-15T00:00:00Z","volume":7454,"oa":1,"year":"2012","alternative_title":["LNCS"],"arxiv":1,"month":"09","day":"15","OA_place":"repository","oa_version":"Preprint","external_id":{"arxiv":["1201.5073"]},"ec_funded":1,"place":"Berlin, Heidelberg","article_processing_charge":"No","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.","date_updated":"2026-07-28T11:24:51Z","publication_identifier":{"eisbn":["9783642329401"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642329395"]},"title":"Strategy synthesis for multi-dimensional quantitative objectives","OA_type":"green","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2012-09-04","location":"Newcastle upon Tyne, United Kingdom","end_date":"2012-09-07","name":"CONCUR: Conference on Concurrency Theory"},"scopus_import":"1","page":"115-131","citation":{"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>.","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.","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>.","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.","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.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>"},"publication":"CONCUR 2012 - Concurrency Theory","status":"public","department":[{"_id":"KrCh"}],"corr_author":"1"},{"popular_science":"1","OA_type":"free access","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"ger"}],"article_processing_charge":"No","date_updated":"2026-07-28T09:15:13Z","publication_identifier":{"issn":["1607-7172"]},"title":"Zwischen Technologie und Kommunikation","department":[{"_id":"E-Lib"}],"corr_author":"1","ddc":["020"],"issue":"1","citation":{"apa":"Danowski, P. (2012). Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","ama":"Danowski P. Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","ieee":"P. Danowski, “Zwischen Technologie und Kommunikation,” <i>Büchereiperspektiven</i>, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","ista":"Danowski P. 2012. Zwischen Technologie und Kommunikation. Büchereiperspektiven. 2012(1), 11.","mla":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11."},"page":"11","publication":"Büchereiperspektiven","status":"public","das_tickbox":"1","publisher":"Büchereiverband Österreichs","main_file_link":[{"url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf","open_access":"1"}],"_id":"3243","intvolume":"      2012","type":"journal_article","date_created":"2018-12-11T12:02:13Z","author":[{"orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick"}],"month":"03","day":"01","oa_version":"Published Version","abstract":[{"text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. ","lang":"eng"}],"article_type":"comment","publication_status":"published","publist_id":"3433","date_published":"2012-03-01T00:00:00Z","volume":2012,"year":"2012","oa":1},{"OA_type":"closed access","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","article_processing_charge":"No","title":"Forces driving epithelial spreading in zebrafish gastrulation","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.","date_updated":"2026-07-29T10:07:18Z","pmid":1,"department":[{"_id":"CaHe"},{"_id":"Bio"}],"issue":"6104","corr_author":"1","publication":"Science","citation":{"short":"M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch, S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.","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>.","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.","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>.","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>","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>","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."},"page":"257 - 260","scopus_import":"1","isi":1,"status":"public","_id":"2950","publisher":"American Association for the Advancement of Science","intvolume":"       338","type":"journal_article","date_created":"2018-12-11T12:00:30Z","author":[{"full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Behrndt"},{"last_name":"Salbreux","first_name":"Guillaume","full_name":"Salbreux, Guillaume"},{"last_name":"Campinho","first_name":"Pedro","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","full_name":"Campinho, Pedro"},{"last_name":"Hauschild","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert"},{"full_name":"Oswald, Felix","first_name":"Felix","last_name":"Oswald"},{"first_name":"Julia","last_name":"Roensch","full_name":"Roensch, Julia","id":"4220E59C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Grill","first_name":"Stephan","full_name":"Grill, Stephan"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J"}],"doi":"10.1126/science.1224143","project":[{"grant_number":"I930-B20","_id":"252ABD0A-B435-11E9-9278-68D0E5697425","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","call_identifier":"FWF"}],"month":"10","external_id":{"pmid":["23066079"],"isi":["000309712300046"]},"oa_version":"None","day":"12","related_material":{"record":[{"relation":"dissertation_contains","id":"1403","status":"public"}]},"publist_id":"3778","article_type":"original","publication_status":"published","acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"lang":"eng","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."}],"year":"2012","volume":338,"date_published":"2012-10-12T00:00:00Z"},{"publication_status":"published","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."}],"publist_id":"3537","related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"oa":1,"year":"2012","volume":486,"date_published":"2012-06-28T00:00:00Z","month":"06","day":"28","external_id":{"isi":["000305760600044"],"pmid":["22722843"]},"ec_funded":1,"oa_version":"Submitted Version","intvolume":"       486","type":"journal_article","doi":"10.1038/nature11219","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Diaz Jr","first_name":"Luis","full_name":"Diaz Jr, Luis"},{"first_name":"Richard","last_name":"Williams","full_name":"Williams, Richard"},{"full_name":"Wu, Jian","first_name":"Jian","last_name":"Wu"},{"last_name":"Kinde","first_name":"Isaac","full_name":"Kinde, Isaac"},{"first_name":"Joel","last_name":"Hecht","full_name":"Hecht, Joel"},{"first_name":"Jordan","last_name":"Berlin","full_name":"Berlin, Jordan"},{"full_name":"Allen, Benjamin","first_name":"Benjamin","last_name":"Allen"},{"last_name":"Božić","first_name":"Ivana","full_name":"Božić, Ivana"},{"first_name":"Johannes","last_name":"Reiter","full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"},{"full_name":"Kinzler, Kenneth","last_name":"Kinzler","first_name":"Kenneth"},{"full_name":"Oliner, Kelly","first_name":"Kelly","last_name":"Oliner"},{"last_name":"Vogelstein","first_name":"Bert","full_name":"Vogelstein, Bert"}],"date_created":"2018-12-11T12:01:43Z","publisher":"Nature Publishing Group","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/","open_access":"1"}],"_id":"3157","scopus_import":"1","isi":1,"publication":"Nature","citation":{"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>.","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.","chicago":"Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” <i>Nature</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>.","ieee":"L. Diaz Jr <i>et al.</i>, “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” <i>Nature</i>, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.","apa":"Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>","ama":"Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. 2012;486(7404):537-540. doi:<a href=\"https://doi.org/10.1038/nature11219\">10.1038/nature11219</a>"},"page":"537 - 540","status":"public","department":[{"_id":"KrCh"}],"pmid":1,"issue":"7404","article_processing_charge":"No","date_updated":"2026-07-29T10:15:25Z","title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"oa":1,"year":"2012","volume":81,"date_published":"2012-02-01T00:00:00Z","related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"publist_id":"3388","publication_status":"published","abstract":[{"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","lang":"eng"}],"ec_funded":1,"external_id":{"isi":["000298938200006"],"pmid":["22120126"]},"oa_version":"Submitted Version","day":"01","month":"02","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"date_created":"2018-12-11T12:02:19Z","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.tpb.2011.11.003","type":"journal_article","intvolume":"        81","_id":"3260","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ "}],"publisher":"Academic Press","status":"public","publication":"Theoretical Population Biology","citation":{"short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.","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>.","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>.","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>","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>","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."},"page":"69 - 80","scopus_import":"1","isi":1,"issue":"1","corr_author":"1","department":[{"_id":"KrCh"}],"pmid":1,"title":"Evolutionary dynamics of biological auctions","date_updated":"2026-07-29T10:15:25Z","article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"An ecohydrological model Tethys‐Chloris (T&amp;C) described in the companion paper is applied to two semiarid systems characterized by different climate and vegetation cover conditions. The Lucky Hills watershed in Arizona represents a typical small, “unit‐source” catchment of a desert shrub system of the U.S. southwest. Two nested basins of the Reynolds Creek Experimental watershed (Idaho, U.S.A.), the Reynolds Creek Mountain East and Tollgate catchments, are representative of a semiarid cold climate with seasonal snow cover. Both exhibit a highly non‐uniform vegetation cover. A range of ecohydrological metrics of the long‐term model performance is presented to highlight the model capabilities in reproducing hydrological and vegetation dynamics both at the plot and the watershed scales. A diverse set of observations is used to confirm the simulated dynamics. Highly satisfactory results are obtained without significant (or any) calibration efforts despite the large phase‐space dimensionality of the model, the uncertainty of imposed boundary conditions, and limited data availability. It is argued that a significant investment into the model design based on the description of physical, biophysical, and ecological processes leads to such a consistent simulation skill. The simulated patterns mimic the outcome of hydrological and vegetation dynamics with high realism, as confirmed from spatially distributed remote sensing data. Further community efforts are warranted to address the issue of thorough quantitative assessment. The current lack of appropriate data hampers the development and testing of process‐based ecohydrological models. It is further argued that the mechanistic nature of the T&amp;C model can be valuable for designing virtual experiments and developing questions of scientific inquiry at a range of spatiotemporal scales."}],"publication_status":"published","article_type":"original","DOAJ_listed":"1","date_published":"2012-05-30T00:00:00Z","volume":4,"year":"2012","month":"05","extern":"1","oa_version":"None","day":"30","type":"journal_article","intvolume":"         4","author":[{"first_name":"Simone","last_name":"Fatichi","full_name":"Fatichi, Simone","id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6"},{"full_name":"Ivanov, V. Y.","last_name":"Ivanov","first_name":"V. Y."},{"last_name":"Caporali","first_name":"E.","full_name":"Caporali, E."}],"date_created":"2026-07-27T12:30:23Z","doi":"10.1029/2011ms000087","_id":"22482","publisher":"American Geophysical Union","citation":{"short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Journal of Advances in Modeling Earth Systems 4 (2012).","chicago":"Fatichi, Simone, V. Y. Ivanov, and E. Caporali. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 2. Spatiotemporal Analyses.” <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2011ms000087\">https://doi.org/10.1029/2011ms000087</a>.","ista":"Fatichi S, Ivanov VY, Caporali E. 2012. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. Journal of Advances in Modeling Earth Systems. 4(2), 2011MS000087.","mla":"Fatichi, Simone, et al. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 2. Spatiotemporal Analyses.” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2, 2011MS000087, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2011ms000087\">10.1029/2011ms000087</a>.","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2012). A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011ms000087\">https://doi.org/10.1029/2011ms000087</a>","ama":"Fatichi S, Ivanov VY, Caporali E. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. <i>Journal of Advances in Modeling Earth Systems</i>. 2012;4(2). doi:<a href=\"https://doi.org/10.1029/2011ms000087\">10.1029/2011ms000087</a>","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses,” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2. American Geophysical Union, 2012."},"publication":"Journal of Advances in Modeling Earth Systems","scopus_import":"1","das_tickbox":"1","status":"public","issue":"2","article_processing_charge":"No","article_number":"2011MS000087","title":"A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses","date_updated":"2026-08-03T14:04:42Z","publication_identifier":{"eissn":["1942-2466"]},"OA_type":"closed access","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"quality_controlled":"1"},{"date_updated":"2026-08-06T09:54:05Z","publication_identifier":{"issn":["0894-8755"],"eissn":["1520-0442"]},"title":"Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality?","article_processing_charge":"No","quality_controlled":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"OA_type":"closed access","status":"public","das_tickbox":"1","scopus_import":"1","page":"5512-5523","citation":{"ama":"Fatichi S, Ivanov VY, Caporali E. Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? <i>Journal of Climate</i>. 2012;25(16):5512-5523. doi:<a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">10.1175/jcli-d-11-00356.1</a>","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2012). Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? <i>Journal of Climate</i>. American Meteorological Society. <a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">https://doi.org/10.1175/jcli-d-11-00356.1</a>","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality?,” <i>Journal of Climate</i>, vol. 25, no. 16. American Meteorological Society, pp. 5512–5523, 2012.","short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Journal of Climate 25 (2012) 5512–5523.","chicago":"Fatichi, Simone, V. Yu. Ivanov, and E. Caporali. “Investigating Interannual Variability of Precipitation at the Global Scale: Is There a Connection with Seasonality?” <i>Journal of Climate</i>. American Meteorological Society, 2012. <a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">https://doi.org/10.1175/jcli-d-11-00356.1</a>.","ista":"Fatichi S, Ivanov VY, Caporali E. 2012. Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? Journal of Climate. 25(16), 5512–5523.","mla":"Fatichi, Simone, et al. “Investigating Interannual Variability of Precipitation at the Global Scale: Is There a Connection with Seasonality?” <i>Journal of Climate</i>, vol. 25, no. 16, American Meteorological Society, 2012, pp. 5512–23, doi:<a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">10.1175/jcli-d-11-00356.1</a>."},"publication":"Journal of Climate","issue":"16","doi":"10.1175/jcli-d-11-00356.1","author":[{"full_name":"Fatichi, Simone","id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","last_name":"Fatichi","first_name":"Simone"},{"full_name":"Ivanov, V. Yu.","first_name":"V. Yu.","last_name":"Ivanov"},{"last_name":"Caporali","first_name":"E.","full_name":"Caporali, E."}],"date_created":"2026-07-27T12:30:24Z","intvolume":"        25","type":"journal_article","publisher":"American Meteorological Society","_id":"22518","volume":25,"date_published":"2012-08-15T00:00:00Z","year":"2012","abstract":[{"text":"Interannual variability of precipitation can directly or indirectly affect many hydrological, ecological, and biogeochemical processes that, in turn, influence climate. Despite the significant importance of the phenomenon, few studies have attempted to elucidate spatial patterns of this variability at the global scale. This study uses land gauge precipitation records of the Global Historical Climatology Network, version 2, as well as reanalysis data to provide an assessment of the spatial organization of characteristics of precipitation interannual variability. The coefficient of variation, skewness, and short- and long-range dependence of the precipitation variability are analyzed. Among the major inferences is that the coefficient of variation of annual precipitation shows a significant correlation with intra-annual seasonality. Specifically, subyearly precipitation anomalies occurring in locations with pronounced seasonality affect the total yearly amount, imposing a higher variability in the annual precipitation fluctuations. Furthermore, the study illustrates that a positive skewness of the distribution of annual precipitation is a robust property worldwide and its magnitude is related to the coefficient of variation. Additionally, annual precipitation exhibits very weak small-lag autocorrelation. Conversely, the intensity of long-memory–long-range dependence is significantly larger than zero, hinting that organized long-term variations are an important feature of the interannual variability of precipitation.\r\n\r\n","lang":"eng"}],"article_type":"original","publication_status":"published","day":"15","oa_version":"None","month":"08","extern":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","date_updated":"2026-08-12T09:32:12Z","article_processing_charge":"No","issue":"12","ddc":["576"],"department":[{"_id":"SiHi"}],"pubrep_id":"387","status":"public","publication":"Biology Open","tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"citation":{"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.","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>","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>","mla":"Liang, Huixuan, et al. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>, vol. 1, no. 12, Company of Biologists, 2012, pp. 1200–03, doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>.","ista":"Liang H, Hippenmeyer S, Ghashghaei H. 2012. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology Open. 1(12), 1200–1203.","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>.","short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203."},"page":"1200 - 1203","scopus_import":"1","isi":1,"file":[{"content_type":"application/pdf","access_level":"open_access","file_size":726695,"relation":"main_file","checksum":"605a1800b81227848c361fd6ba7d22ba","file_id":"4990","date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2015-387-v1+1_1200.full.pdf","date_created":"2018-12-12T10:13:09Z","creator":"system"}],"_id":"2263","publisher":"Company of Biologists","author":[{"first_name":"Huixuan","last_name":"Liang","full_name":"Liang, Huixuan"},{"orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"},{"first_name":"H.","last_name":"Ghashghaei","full_name":"Ghashghaei, H."}],"date_created":"2018-12-11T11:56:38Z","doi":"10.1242/bio.20122287","intvolume":"         1","type":"journal_article","external_id":{"isi":["000209205700005"]},"oa_version":"Published Version","day":"15","month":"12","has_accepted_license":"1","year":"2012","oa":1,"volume":1,"date_published":"2012-12-15T00:00:00Z","file_date_updated":"2020-07-14T12:45:35Z","publist_id":"4682","publication_status":"published","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."}]}]