[{"issue":"1","date_created":"2026-06-19T07:57:09Z","publication":"Discrete and Continuous Dynamical Systems","extern":"1","scopus_import":"1","doi":"10.3934/dcds.2012.32.191","oa":1,"arxiv":1,"day":"01","page":"191-221","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.0907.5412"}],"abstract":[{"text":"We consider the mass-critical generalized Korteweg{de Vries equation (∂t + ∂xxx)u = ±∂ x(u 5) for real-valued functions u(t; x). We prove that if the global well-posedness and scattering conjecture for this equation failed, then, conditional on a positive answer to the global well-posedness and scattering conjecture for the masscritical nonlinear Schrffodinger equation (-i∂ t + ∂xx)u = ±(|u| 4u), there exists a minimal-mass blowup solution to the mass-critical generalized KdV equation which is almost periodic modulo the symmetries of the equation. Moreover, we can guarantee that this minimal-mass blowup solution is either a self-similar solution, a soliton-like solution, or a double high-to-low frequency cascade solution.","lang":"eng"}],"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","type":"journal_article","mathsc":["35Q53"],"citation":{"ista":"Killip R, Kwon S, Shao S, Vişan M. 2012. On the mass-critical generalized KdV equation. Discrete and Continuous Dynamical Systems. 32(1), 191–221.","ama":"Killip R, Kwon S, Shao S, Vişan M. On the mass-critical generalized KdV equation. <i>Discrete and Continuous Dynamical Systems</i>. 2012;32(1):191-221. doi:<a href=\"https://doi.org/10.3934/dcds.2012.32.191\">10.3934/dcds.2012.32.191</a>","short":"R. Killip, S. Kwon, S. Shao, M. Vişan, Discrete and Continuous Dynamical Systems 32 (2012) 191–221.","mla":"Killip, Rowan, et al. “On the Mass-Critical Generalized KdV Equation.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 32, no. 1, American Institute of Mathematical Sciences, 2012, pp. 191–221, doi:<a href=\"https://doi.org/10.3934/dcds.2012.32.191\">10.3934/dcds.2012.32.191</a>.","ieee":"R. Killip, S. Kwon, S. Shao, and M. Vişan, “On the mass-critical generalized KdV equation,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 32, no. 1. American Institute of Mathematical Sciences, pp. 191–221, 2012.","chicago":"Killip, Rowan, Soonsik Kwon, Shuanglin Shao, and Monica Vişan. “On the Mass-Critical Generalized KdV Equation.” <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences, 2012. <a href=\"https://doi.org/10.3934/dcds.2012.32.191\">https://doi.org/10.3934/dcds.2012.32.191</a>.","apa":"Killip, R., Kwon, S., Shao, S., &#38; Vişan, M. (2012). On the mass-critical generalized KdV equation. <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/dcds.2012.32.191\">https://doi.org/10.3934/dcds.2012.32.191</a>"},"volume":32,"month":"01","quality_controlled":"1","status":"public","publication_status":"published","date_updated":"2026-06-29T09:59:46Z","external_id":{"arxiv":["0907.5412"]},"oa_version":"Preprint","date_published":"2012-01-01T00:00:00Z","publication_identifier":{"issn":["1078-0947"],"eissn":["1553-5231"]},"article_processing_charge":"No","title":"On the mass-critical generalized KdV equation","publisher":"American Institute of Mathematical Sciences","intvolume":"        32","author":[{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"first_name":"Soonsik","full_name":"Kwon, Soonsik","last_name":"Kwon"},{"first_name":"Shuanglin","full_name":"Shao, Shuanglin","last_name":"Shao"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","full_name":"Visan, Monica","first_name":"Monica"}],"das_tickbox":"1","_id":"22056","OA_type":"green","article_type":"original","language":[{"iso":"eng"}]},{"das_tickbox":"1","_id":"22075","intvolume":"      2012","author":[{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"article_type":"original","OA_type":"green","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","volume":2012,"month":"05","article_processing_charge":"No","publisher":"Oxford University Press","title":"Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions","publication_status":"published","date_updated":"2026-06-30T11:21:51Z","external_id":{"arxiv":["1011.1526"]},"oa_version":"Preprint","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"date_published":"2012-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","citation":{"apa":"Vişan, M. (2012). Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnr051\">https://doi.org/10.1093/imrn/rnr051</a>","chicago":"Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing Cubic Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2012. <a href=\"https://doi.org/10.1093/imrn/rnr051\">https://doi.org/10.1093/imrn/rnr051</a>.","ieee":"M. Vişan, “Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions,” <i>International Mathematics Research Notices</i>, vol. 2012, no. 5. Oxford University Press, pp. 1037–1067, 2012.","mla":"Vişan, Monica. “Global Well-Posedness and Scattering for the Defocusing Cubic Nonlinear Schrödinger Equation in Four Dimensions.” <i>International Mathematics Research Notices</i>, vol. 2012, no. 5, Oxford University Press, 2012, pp. 1037–67, doi:<a href=\"https://doi.org/10.1093/imrn/rnr051\">10.1093/imrn/rnr051</a>.","ista":"Vişan M. 2012. Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. International Mathematics Research Notices. 2012(5), 1037–1067.","short":"M. Vişan, International Mathematics Research Notices 2012 (2012) 1037–1067.","ama":"Vişan M. Global well-posedness and scattering for the defocusing cubic nonlinear Schrödinger equation in four dimensions. <i>International Mathematics Research Notices</i>. 2012;2012(5):1037-1067. doi:<a href=\"https://doi.org/10.1093/imrn/rnr051\">10.1093/imrn/rnr051</a>"},"year":"2012","type":"journal_article","extern":"1","publication":"International Mathematics Research Notices","issue":"5","date_created":"2026-06-19T08:23:13Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1011.1526"}],"abstract":[{"text":"In this short note, we present a new proof of the global well-posedness and scattering result for the defocusing energy-critical nonlinear Schrödinger equation (NLS) in four space dimensions obtained previously by Ryckman and Visan [“Global well-posedness and scattering for the defocusing energycritical nonlinear Schrödinger equation in R^1+4⁠.” American Journal of Mathematics 129 (2007): 1–60. MR2288737]. The argument is inspired by the recent work of Dodson [“Global well-posedness and scattering for the defocusing, L2-critical, nonlinear Schrödinger equation when d≥3.” (2009): preprint arXiv:0912.2467.] on the mass-critical NLS.","lang":"eng"}],"doi":"10.1093/imrn/rnr051","scopus_import":"1","oa":1,"arxiv":1,"page":"1037-1067","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>, vol. 2, no. 3, EMS Press, 2012, pp. 321–28, doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>.","ieee":"R. Seiringer, “Absence of bound states implies non-negativity of the scattering length,” <i>Journal of Spectral Theory</i>, vol. 2, no. 3. EMS Press, pp. 321–328, 2012.","chicago":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>. EMS Press, 2012. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>.","apa":"Seiringer, R. (2012). Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. EMS Press. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>","ama":"Seiringer R. Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. 2012;2(3):321-328. doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>","short":"R. Seiringer, Journal of Spectral Theory 2 (2012) 321–328.","ista":"Seiringer R. 2012. Absence of bound states implies non-negativity of the scattering length. Journal of Spectral Theory. 2(3), 321–328."},"type":"journal_article","year":"2012","corr_author":"1","publication":"Journal of Spectral Theory","issue":"3","date_created":"2018-12-11T11:56:58Z","abstract":[{"lang":"eng","text":"We show that bosons interacting via pair potentials with negative scattering length form bound states for a suitable number of particles. In other words, the absence of many-particle bound states of any kind implies the non-negativity of the scattering length of the interaction potential. "}],"main_file_link":[{"url":"http://arxiv.org/abs/1204.0435","open_access":"1"}],"isi":1,"page":"321-328","day":"24","arxiv":1,"oa":1,"doi":"10.4171/JST/31","_id":"2318","das_tickbox":"1","author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert"}],"intvolume":"         2","language":[{"iso":"eng"}],"acknowledgement":"Partial financial support by NSERC ","status":"public","quality_controlled":"1","month":"06","volume":2,"publisher":"EMS Press","title":"Absence of bound states implies non-negativity of the scattering length","publist_id":"4609","article_processing_charge":"No","department":[{"_id":"RoSe"}],"date_published":"2012-06-24T00:00:00Z","oa_version":"Preprint","external_id":{"isi":["000209021900004"],"arxiv":["1204.0435"]},"date_updated":"2026-07-06T11:57:04Z","publication_status":"published"},{"title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","publisher":"Biophysical Society","article_processing_charge":"No","publist_id":"3774","oa_version":"Submitted Version","date_published":"2012-10-03T00:00:00Z","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"publication_status":"published","date_updated":"2026-07-06T12:32:51Z","external_id":{"isi":["000309571400005"],"pmid":["23062335"]},"acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","quality_controlled":"1","status":"public","month":"10","volume":103,"language":[{"iso":"eng"}],"_id":"2954","das_tickbox":"1","author":[{"full_name":"Pernia-Andrade, Alejandro","first_name":"Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","last_name":"Goswami","first_name":"Sarit","full_name":"Goswami, Sarit"},{"full_name":"Stickler, Yvonne","first_name":"Yvonne","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1","last_name":"Stickler"},{"last_name":"Fröbe","first_name":"Ulrich","full_name":"Fröbe, Ulrich"},{"last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100"},{"first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       103","pmid":1,"project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/"}],"abstract":[{"text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.","lang":"eng"}],"isi":1,"page":"1429 - 1439","day":"03","scopus_import":"1","doi":"10.1016/j.bpj.2012.08.039","oa":1,"publication":"Biophysical Journal","date_created":"2018-12-11T12:00:32Z","issue":"7","citation":{"ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical Journal</i>, vol. 103, no. 7. Biophysical Society, pp. 1429–1439, 2012.","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical Society, 2012, pp. 1429–39, doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38; Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>","chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>. Biophysical Society, 2012. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>.","ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439.","ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439. doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439."},"corr_author":"1","year":"2012","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2012","corr_author":"1","type":"journal_article","citation":{"short":"P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058.","ama":"Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. 2012;11(11):2055-2058. doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.","mla":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>, vol. 11, no. 11, Taylor &#38; Francis, 2012, pp. 2055–58, doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>.","ieee":"P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” <i>Cell Cycle</i>, vol. 11, no. 11. Taylor &#38; Francis, pp. 2055–2058, 2012.","chicago":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>.","apa":"Pantazis, P., &#38; Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"day":"01","page":"2055 - 2058","scopus_import":"1","doi":"10.4161/cc.20118","abstract":[{"text":"There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation.","lang":"eng"}],"issue":"11","date_created":"2018-12-11T12:01:44Z","publication":"Cell Cycle","language":[{"iso":"eng"}],"author":[{"last_name":"Pantazis","full_name":"Pantazis, Periklis","first_name":"Periklis"},{"full_name":"Bollenbach, Tobias","first_name":"Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        11","_id":"3160","das_tickbox":"1","oa_version":"None","date_published":"2012-06-01T00:00:00Z","department":[{"_id":"ToBo"}],"publication_status":"published","date_updated":"2026-07-07T05:34:50Z","external_id":{"isi":["000304770100011"]},"publisher":"Taylor & Francis","title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo","article_processing_charge":"No","publist_id":"3531","month":"06","volume":11,"quality_controlled":"1","status":"public"},{"month":"09","volume":7428,"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","quality_controlled":"1","status":"public","oa_version":"Preprint","ec_funded":1,"department":[{"_id":"KrPi"}],"date_published":"2012-09-01T00:00:00Z","publication_status":"published","date_updated":"2026-07-07T13:05:30Z","publisher":"Springer","title":"Practical leakage-resilient symmetric cryptography","publist_id":"5003","article_processing_charge":"No","author":[{"first_name":"Sebastian","full_name":"Faust, Sebastian","last_name":"Faust"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"id":"7BE863D4-E9CF-11E9-9EDB-90527418172C","last_name":"Schipper","first_name":"Joachim","full_name":"Schipper, Joachim"}],"intvolume":"      7428","_id":"2048","das_tickbox":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:55:25Z","publication":"Conference proceedings CHES 2012","page":"213 - 232","day":"01","scopus_import":"1","doi":"10.1007/978-3-642-33027-8_13","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Leuven, Belgium","start_date":"2012-09-09","name":"CHES: Cryptographic Hardware and Embedded Systems","end_date":"2012-09-12"},"alternative_title":["LNCS"],"year":"2012","type":"conference","citation":{"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>","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>.","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.","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>.","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.","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","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>"}},{"publication_status":"published","date_updated":"2026-07-07T13:06:19Z","oa_version":"Preprint","ec_funded":1,"department":[{"_id":"KrPi"}],"date_published":"2012-03-01T00:00:00Z","publist_id":"5002","article_processing_charge":"No","publisher":"Springer","title":"Lapin: An efficient authentication protocol based on ring-LPN","volume":7549,"month":"03","quality_controlled":"1","status":"public","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. ","language":[{"iso":"eng"}],"intvolume":"      7549","author":[{"full_name":"Heyse, Stefan","first_name":"Stefan","last_name":"Heyse"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"},{"last_name":"Lyubashevsky","full_name":"Lyubashevsky, Vadim","first_name":"Vadim"},{"first_name":"Christof","full_name":"Paar, Christof","last_name":"Paar"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"}],"das_tickbox":"1","_id":"2049","doi":"10.1007/978-3-642-34047-5_20","scopus_import":"1","oa":1,"page":"346 - 365","day":"01","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"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"}],"date_created":"2018-12-11T11:55:25Z","publication":"Conference proceedings FSE 2012","alternative_title":["LNCS"],"year":"2012","type":"conference","citation":{"short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","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>","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>.","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.","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>.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2012-03-21","start_date":"2012-03-19","name":"FSE: Fast Software Encryption","location":"Washington, DC, USA"}},{"language":[{"iso":"eng"}],"intvolume":"      7539","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"}],"das_tickbox":"1","_id":"2942","publication_status":"published","date_updated":"2026-07-07T13:08:58Z","oa_version":"None","ec_funded":1,"department":[{"_id":"ToHe"}],"date_published":"2012-09-16T00:00:00Z","publist_id":"3791","article_processing_charge":"No","title":"Independent implementability of viewpoints","publisher":"Springer","volume":7539,"month":"09","quality_controlled":"1","status":"public","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","year":"2012","alternative_title":["LNCS"],"type":"conference","citation":{"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>","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>.","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>.","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.","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>","short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395."},"conference":{"name":"Monterey Workshop 2012","start_date":"2012-03-19","end_date":"2012-03-21","location":"Oxford, UK"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1007/978-3-642-34059-8_20","day":"16","page":"380 - 395","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"abstract":[{"lang":"eng","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."}],"date_created":"2018-12-11T12:00:28Z","publication":"Conference proceedings Monterey Workshop 2012"},{"language":[{"iso":"eng"}],"intvolume":"        36","author":[{"last_name":"Rieckh","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","full_name":"Rieckh, Georg","first_name":"Georg"},{"last_name":"Kreuzer","first_name":"Wolfgang","full_name":"Kreuzer, Wolfgang"},{"full_name":"Waubke, Holger","first_name":"Holger","last_name":"Waubke"},{"full_name":"Balazs, Peter","first_name":"Peter","last_name":"Balazs"}],"das_tickbox":"1","_id":"3274","date_updated":"2026-07-07T13:10:10Z","external_id":{"isi":["000301691600005"]},"publication_status":"published","department":[{"_id":"GaTk"}],"date_published":"2012-06-01T00:00:00Z","oa_version":"None","publist_id":"3372","article_processing_charge":"No","title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","publisher":"Elsevier","volume":36,"month":"06","status":"public","quality_controlled":"1","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.","type":"journal_article","corr_author":"1","year":"2012","citation":{"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>.","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>","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.","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>.","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","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>","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1016/j.enganabound.2011.12.014","day":"01","isi":1,"page":"960 - 967","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."}],"issue":"6","date_created":"2018-12-11T12:02:24Z","publication":"Engineering Analysis with Boundary Elements"},{"quality_controlled":"1","status":"public","month":"03","volume":47,"title":"A worst case bound for topology computation of algebraic curves","publisher":"Elsevier","publist_id":"3303","article_processing_charge":"No","oa_version":"Preprint","department":[{"_id":"HeEd"}],"date_published":"2012-03-01T00:00:00Z","publication_status":"published","external_id":{"arxiv":["1104.1510"],"isi":["000300115300002"]},"date_updated":"2026-07-07T13:11:38Z","_id":"3331","das_tickbox":"1","author":[{"last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299"},{"last_name":"Sagraloff","first_name":"Michael","full_name":"Sagraloff, Michael"}],"intvolume":"        47","language":[{"iso":"eng"}],"publication":"Journal of Symbolic Computation","date_created":"2018-12-11T12:02:43Z","issue":"3","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"abstract":[{"lang":"eng","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."}],"arxiv":1,"isi":1,"page":"239 - 258","day":"01","scopus_import":"1","doi":"10.1016/j.jsc.2011.11.001","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.","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>","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>.","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>.","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."},"year":"2012","corr_author":"1","type":"journal_article"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"_id":"2955","language":[{"iso":"eng"}],"month":"08","quality_controlled":"1","status":"public","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.","publication_status":"published","date_updated":"2026-07-07T14:01:25Z","external_id":{"arxiv":["1107.2141"],"isi":["000309059900023"]},"oa_version":"Preprint","department":[{"_id":"KrCh"}],"ec_funded":1,"date_published":"2012-08-23T00:00:00Z","publist_id":"3771","article_processing_charge":"No","publisher":"IEEE","title":"Partial-observation stochastic games: How to win when belief fails","conference":{"location":"Dubrovnik, Croatia","start_date":"2012-06-25","name":"LICS: Logic in Computer Science","end_date":"2012-06-28"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2012","type":"conference","article_number":"6280436","related_material":{"record":[{"id":"5381","status":"public","relation":"earlier_version"},{"id":"2211","relation":"later_version","status":"public"}]},"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>.","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.","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>.","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>","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 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>","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."},"date_created":"2018-12-11T12:00:32Z","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1109/LICS.2012.28","scopus_import":"1","oa":1,"arxiv":1,"isi":1,"day":"23","main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"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"}]},{"language":[{"iso":"eng"}],"_id":"2967","das_tickbox":"1","author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Weinstein, Scott","first_name":"Scott","last_name":"Weinstein"}],"intvolume":"        13","publisher":"ACM","title":"Algorithmic analysis of array-accessing programs","article_processing_charge":"No","publist_id":"3748","date_published":"2012-08-01T00:00:00Z","ec_funded":1,"department":[{"_id":"ToHe"}],"oa_version":"None","external_id":{"isi":["000308370100009"]},"date_updated":"2026-07-07T14:01:59Z","publication_status":"published","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.","status":"public","quality_controlled":"1","month":"08","volume":13,"citation":{"ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic. 13(3), 27.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic 13 (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>","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.","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>.","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>","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>."},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"4403"}]},"article_number":"27","type":"journal_article","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"}],"isi":1,"day":"01","doi":"10.1145/2287718.2287727","scopus_import":"1","publication":"ACM Transactions on Computational Logic","date_created":"2018-12-11T12:00:36Z","issue":"3"},{"language":[{"iso":"eng"}],"_id":"494","das_tickbox":"1","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"intvolume":"        13","publisher":"ACM","title":"Translating to Co-Büchi made tight, unified, and useful","article_processing_charge":"No","publist_id":"7326","date_published":"2012-10-01T00:00:00Z","department":[{"_id":"ToHe"}],"oa_version":"None","date_updated":"2026-07-07T14:02:16Z","external_id":{"isi":["000310163600002"]},"publication_status":"published","status":"public","quality_controlled":"1","month":"10","volume":13,"citation":{"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>","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>.","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.","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>.","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>"},"article_number":"29","type":"journal_article","year":"2012","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"isi":1,"day":"01","doi":"10.1145/2362355.2362357","scopus_import":"1","publication":"ACM Transactions on Computational Logic","issue":"4","date_created":"2018-12-11T11:46:47Z"},{"_id":"10905","das_tickbox":"1","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"intvolume":"      7501","language":[{"iso":"eng"}],"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","quality_controlled":"1","status":"public","month":"10","volume":7501,"title":"Polynomial-time algorithms for energy games with special weight structures","publisher":"Springer","article_processing_charge":"No","oa_version":"Preprint","date_published":"2012-10-01T00:00:00Z","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642330896"],"eisbn":["9783642330902"],"eissn":["1611-3349"]},"department":[{"_id":"KrCh"}],"ec_funded":1,"publication_status":"published","date_updated":"2026-07-08T05:50:39Z","external_id":{"arxiv":["1604.08234"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Ljubljana, Slovenia","name":"ESA: European Symposium on Algorithms","start_date":"2012-09-10","end_date":"2012-09-12"},"related_material":{"record":[{"id":"535","status":"public","relation":"later_version"}]},"citation":{"apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>20th Annual European Symposium on Algorithms </i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>20th Annual European Symposium on Algorithms </i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","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.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>20th Annual European Symposium on Algorithms </i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, 20th Annual European Symposium on Algorithms , Springer, 2012, pp. 301–312.","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>","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."},"year":"2012","alternative_title":["LNCS"],"corr_author":"1","type":"conference","publication":"20th Annual European Symposium on Algorithms ","date_created":"2022-03-21T08:01:45Z","main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help.","lang":"eng"}],"arxiv":1,"page":"301-312","day":"01","doi":"10.1007/978-3-642-33090-2_27","scopus_import":"1","oa":1},{"conference":{"location":"Hyderabad, India","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2012-12-15","end_date":"2012-12-17"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","type":"conference","year":"2012","corr_author":"1","alternative_title":["LIPIcs"],"citation":{"short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, 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>","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.","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.","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>.","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>","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>."},"date_created":"2018-12-11T12:00:10Z","ddc":["004"],"file":[{"checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_size":559069,"date_created":"2018-12-12T10:10:37Z","creator":"system","access_level":"open_access","relation":"main_file","file_name":"IST-2017-805-v1+1_34.pdf","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","file_id":"4826"}],"publication":"Leibniz International Proceedings in Informatics","oa":1,"scopus_import":"1","doi":"10.4230/LIPIcs.FSTTCS.2012.362","page":"362 - 373","day":"01","abstract":[{"lang":"eng","text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1."}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"file_date_updated":"2020-07-14T12:45:52Z","intvolume":"        18","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"das_tickbox":"1","_id":"2891","pubrep_id":"805","tmp":{"short":"CC BY-NC-ND (3.0)","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)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"volume":18,"month":"12","status":"public","quality_controlled":"1","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","date_updated":"2026-07-28T09:20:59Z","publication_status":"published","department":[{"_id":"ToHe"}],"date_published":"2012-12-01T00:00:00Z","ec_funded":1,"oa_version":"Published Version","article_processing_charge":"No","publist_id":"3867","title":"Approximate determinization of quantitative automata","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"series_title":"LNCS","date_created":"2022-03-21T08:03:30Z","ddc":["000"],"publication":"Tools and Algorithms for the Construction and Analysis of Systems","oa":1,"doi":"10.1007/978-3-642-28756-5_46","scopus_import":"1","day":"01","page":"549-551","abstract":[{"text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"editor":[{"last_name":"Flanagan","first_name":"Cormac","full_name":"Flanagan, Cormac"},{"last_name":"König","full_name":"König, Barbara","first_name":"Barbara"}],"place":"Berlin, Heidelberg","conference":{"end_date":"2012-04-01","start_date":"2012-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Tallinn, Estonia"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","year":"2012","corr_author":"1","alternative_title":["LNCS"],"citation":{"ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","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.","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>"},"volume":7214,"month":"04","status":"public","quality_controlled":"1","date_updated":"2026-07-28T09:23:52Z","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642287558"],"eisbn":["9783642287565"]},"date_published":"2012-04-01T00:00:00Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","article_processing_charge":"No","title":"HSF(C): A software verifier based on Horn clauses","publisher":"Springer","intvolume":"      7214","author":[{"last_name":"Grebenshchikov","first_name":"Sergey","full_name":"Grebenshchikov, Sergey"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh"},{"first_name":"Nuno P.","full_name":"Lopes, Nuno P.","last_name":"Lopes"},{"full_name":"Popeea, Corneliu","first_name":"Corneliu","last_name":"Popeea"},{"first_name":"Andrey","full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko"}],"das_tickbox":"1","_id":"10906","OA_type":"free access","language":[{"iso":"eng"}]},{"publist_id":"7314","article_processing_charge":"No","publisher":"Rockefeller University Press","title":"Cell migration: Fibroblasts find a new way to get ahead","publication_status":"published","date_updated":"2026-07-28T09:22:21Z","external_id":{"isi":["000303467800004"]},"oa_version":"Published Version","department":[{"_id":"MiSi"}],"date_published":"2012-04-30T00:00:00Z","quality_controlled":"1","status":"public","volume":197,"month":"04","tmp":{"short":"CC BY-NC-SA (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)"},"article_type":"original","language":[{"iso":"eng"}],"das_tickbox":"1","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","_id":"506","intvolume":"       197","file_date_updated":"2020-07-14T12:46:36Z","author":[{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"}],"scopus_import":"1","doi":"10.1083/jcb.201204039","oa":1,"page":"347 - 349","day":"30","isi":1,"file":[{"checksum":"45c02be33ebd99fc3077d60b9c90bdfa","file_size":986566,"date_created":"2019-02-12T09:03:09Z","creator":"kschuh","access_level":"open_access","relation":"main_file","file_name":"2012_CellBiology_Sixt.pdf","date_updated":"2020-07-14T12:46:36Z","file_id":"5957","content_type":"application/pdf"}],"publication":"Journal of Cell Biology","issue":"3","date_created":"2018-12-11T11:46:51Z","ddc":["570"],"citation":{"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.","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>.","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","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>","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349."},"corr_author":"1","year":"2012","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1"},{"editor":[{"full_name":"Koutny, Maciej","first_name":"Maciej","last_name":"Koutny"},{"first_name":"Irek","full_name":"Ulidowski, Irek","last_name":"Ulidowski"}],"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.5073","open_access":"1"}],"abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"arxiv":1,"page":"115-131","day":"15","doi":"10.1007/978-3-642-32940-1_10","scopus_import":"1","oa":1,"publication":"CONCUR 2012 - Concurrency Theory","date_created":"2022-03-21T08:00:21Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"2716"}]},"citation":{"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.","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.","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>","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.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>.","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>"},"corr_author":"1","year":"2012","alternative_title":["LNCS"],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Newcastle upon Tyne, United Kingdom","end_date":"2012-09-07","start_date":"2012-09-04","name":"CONCUR: Conference on Concurrency Theory"},"place":"Berlin, Heidelberg","OA_place":"repository","publisher":"Springer","title":"Strategy synthesis for multi-dimensional quantitative objectives","article_processing_charge":"No","oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642329401"],"isbn":["9783642329395"],"eissn":["1611-3349"]},"ec_funded":1,"department":[{"_id":"KrCh"}],"date_published":"2012-09-15T00:00:00Z","publication_status":"published","date_updated":"2026-07-28T11:24:51Z","external_id":{"arxiv":["1201.5073"]},"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.","quality_controlled":"1","status":"public","month":"09","volume":7454,"language":[{"iso":"eng"}],"OA_type":"green","_id":"10904","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Mickael","full_name":"Randour, Mickael","last_name":"Randour"},{"last_name":"Raskin","full_name":"Raskin, Jean-François","first_name":"Jean-François"}],"intvolume":"      7454"},{"author":[{"orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski"}],"intvolume":"      2012","_id":"3243","das_tickbox":"1","language":[{"iso":"ger"}],"OA_type":"free access","article_type":"comment","month":"03","volume":2012,"status":"public","oa_version":"Published Version","date_published":"2012-03-01T00:00:00Z","publication_identifier":{"issn":["1607-7172"]},"department":[{"_id":"E-Lib"}],"publication_status":"published","date_updated":"2026-07-28T09:15:13Z","publisher":"Büchereiverband Österreichs","title":"Zwischen Technologie und Kommunikation","article_processing_charge":"No","publist_id":"3433","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","corr_author":"1","popular_science":"1","type":"journal_article","citation":{"chicago":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","apa":"Danowski, P. (2012). Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","mla":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 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.","ama":"Danowski P. Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","ista":"Danowski P. 2012. Zwischen Technologie und Kommunikation. Büchereiperspektiven. 2012(1), 11."},"ddc":["020"],"issue":"1","date_created":"2018-12-11T12:02:13Z","publication":"Büchereiperspektiven","day":"01","page":"11","oa":1,"main_file_link":[{"url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf","open_access":"1"}],"abstract":[{"text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. ","lang":"eng"}]},{"publication":"Science","issue":"6104","date_created":"2018-12-11T12:00:30Z","pmid":1,"project":[{"grant_number":"I930-B20","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","_id":"252ABD0A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"abstract":[{"text":"Contractile actomyosin rings drive various fundamental morphogenetic processes ranging from cytokinesis to wound healing. Actomyosin rings are generally thought to function by circumferential contraction. Here, we show that the spreading of the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation is driven by a contractile actomyosin ring. In contrast to previous suggestions, we find that this ring functions not only by circumferential contraction but also by a flow-friction mechanism. This generates a pulling force through resistance against retrograde actomyosin flow. EVL spreading proceeds normally in situations where circumferential contraction is unproductive, indicating that the flow-friction mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis through a combination of cable-constriction and flow-friction mechanisms.","lang":"eng"}],"isi":1,"day":"12","page":"257 - 260","scopus_import":"1","doi":"10.1126/science.1224143","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"1403","relation":"dissertation_contains","status":"public"}]},"citation":{"ista":"Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation. Science. 338(6104), 257–260.","short":"M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch, S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.","ama":"Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. 2012;338(6104):257-260. doi:<a href=\"https://doi.org/10.1126/science.1224143\">10.1126/science.1224143</a>","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.","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>.","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>.","apa":"Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch, J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224143\">https://doi.org/10.1126/science.1224143</a>"},"corr_author":"1","year":"2012","type":"journal_article","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.","quality_controlled":"1","status":"public","month":"10","volume":338,"title":"Forces driving epithelial spreading in zebrafish gastrulation","publisher":"American Association for the Advancement of Science","publist_id":"3778","article_processing_charge":"No","oa_version":"None","department":[{"_id":"CaHe"},{"_id":"Bio"}],"date_published":"2012-10-12T00:00:00Z","acknowledged_ssus":[{"_id":"SSU"}],"publication_status":"published","date_updated":"2026-07-29T10:07:18Z","external_id":{"pmid":["23066079"],"isi":["000309712300046"]},"_id":"2950","author":[{"last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Behrndt, Martin"},{"last_name":"Salbreux","first_name":"Guillaume","full_name":"Salbreux, Guillaume"},{"orcid":"0000-0002-8526-5416","first_name":"Pedro","full_name":"Campinho, Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","last_name":"Campinho"},{"orcid":"0000-0001-9843-3522","first_name":"Robert","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild"},{"last_name":"Oswald","full_name":"Oswald, Felix","first_name":"Felix"},{"first_name":"Julia","full_name":"Roensch, Julia","last_name":"Roensch","id":"4220E59C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stephan","full_name":"Grill, Stephan","last_name":"Grill"},{"first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       338","language":[{"iso":"eng"}],"article_type":"original","OA_type":"closed access"}]