[{"doi":"10.4077/CJP.2017.BAF469","language":[{"iso":"eng"}],"external_id":{"pmid":["28847140"]},"quality_controlled":"1","publication_identifier":{"issn":["03044920"]},"month":"08","author":[{"full_name":"Sun, Wuping","last_name":"Sun","first_name":"Wuping"},{"first_name":"Ming-Zhu","last_name":"Zhai","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Zhai, Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"full_name":"Qian, Chengrui","last_name":"Qian","first_name":"Chengrui"},{"last_name":"Jiang","first_name":"Changyu","full_name":"Jiang, Changyu"}],"volume":60,"date_created":"2018-12-11T11:47:40Z","date_updated":"2021-01-12T08:07:28Z","pmid":1,"year":"2017","department":[{"_id":"RySh"}],"publisher":"Chinese Physiological Society","publication_status":"published","publist_id":"7142","date_published":"2017-08-31T00:00:00Z","citation":{"ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469","ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469."},"publication":"Chinese Journal of Physiology","page":"207 - 214","article_type":"original","article_processing_charge":"No","day":"31","scopus_import":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"643","intvolume":" 60","ddc":["570"],"status":"public","title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","issue":"4","abstract":[{"text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.","lang":"eng"}],"type":"journal_article"},{"type":"journal_article","abstract":[{"text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.","lang":"eng"}],"issue":"307","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"642","status":"public","title":"Localization errors in solving stochastic partial differential equations in the whole space","intvolume":" 86","oa_version":"Submitted Version","scopus_import":1,"day":"01","publication":"Mathematics of Computation","citation":{"mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201.","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","apa":"Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017."},"page":"2373 - 2397","date_published":"2017-01-01T00:00:00Z","publist_id":"7144","year":"2017","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"American Mathematical Society","author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser","full_name":"Gerencser, Mate"},{"full_name":"Gyöngy, István","first_name":"István","last_name":"Gyöngy"}],"date_created":"2018-12-11T11:47:40Z","date_updated":"2021-01-12T08:07:26Z","volume":86,"month":"01","publication_identifier":{"issn":["00255718"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1508.05535","open_access":"1"}],"quality_controlled":"1","doi":"10.1090/mcom/3201","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-331963386-2"]},"month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1705.02326","open_access":"1"}],"oa":1,"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","doi":"10.1007/978-3-319-63387-9_10","conference":{"name":"CAV: Computer Aided Verification","end_date":"2017-07-28","location":"Heidelberg, Germany","start_date":"2017-07-24"},"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"7135","year":"2017","editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"last_name":"Ashok","first_name":"Pranav","full_name":"Ashok, Pranav"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"}],"volume":10426,"date_created":"2018-12-11T11:47:41Z","date_updated":"2021-01-12T08:07:32Z","scopus_import":1,"day":"13","citation":{"ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","mla":"Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10."},"page":"201 - 221","date_published":"2017-07-13T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"645","intvolume":" 10426","status":"public","title":"Value iteration for long run average reward in markov decision processes","oa_version":"Submitted Version"},{"publist_id":"7138","ec_funded":1,"date_created":"2018-12-11T11:47:40Z","date_updated":"2023-02-23T10:07:49Z","volume":46,"author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Krokhin, Andrei","first_name":"Andrei","last_name":"Krokhin"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"related_material":{"record":[{"status":"public","relation":"other","id":"1637"}]},"publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"SIAM","year":"2017","month":"06","language":[{"iso":"eng"}],"doi":"10.1137/16M1091836","quality_controlled":"1","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1502.07327","open_access":"1"}],"abstract":[{"lang":"eng","text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"issue":"3","type":"journal_article","oa_version":"Preprint","status":"public","title":"The complexity of general-valued CSPs","intvolume":" 46","_id":"644","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","scopus_import":1,"date_published":"2017-06-29T00:00:00Z","page":"1087 - 1110","publication":"SIAM Journal on Computing","citation":{"ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836."}},{"abstract":[{"text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","title":"A novel convex relaxation for non binary discrete tomography","status":"public","intvolume":" 10302","_id":"646","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2017-06-01T00:00:00Z","page":"235 - 246","citation":{"chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.","mla":"Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","apa":"Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19"},"ec_funded":1,"publist_id":"7132","date_created":"2018-12-11T11:47:41Z","date_updated":"2021-01-12T08:07:34Z","volume":10302,"author":[{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"full_name":"Swoboda, Paul","first_name":"Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Petra, Stefanie","last_name":"Petra","first_name":"Stefanie"}],"publication_status":"published","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"first_name":"Yiqiu","last_name":"Dong","full_name":"Dong, Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","first_name":"Anders","last_name":"Bjorholm Dahl"}],"department":[{"_id":"VlKo"}],"publisher":"Springer","year":"2017","month":"06","publication_identifier":{"isbn":["978-331958770-7"]},"language":[{"iso":"eng"}],"conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","end_date":"2017-06-08","start_date":"2017-06-04","location":"Kolding, Denmark"},"doi":"10.1007/978-3-319-58771-4_19","quality_controlled":"1","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.03769"}],"oa":1},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}],"_id":"648","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 10185","title":"On the complexity of breaking pseudoentropy","status":"public","oa_version":"Submitted Version","scopus_import":1,"day":"01","citation":{"chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.","mla":"Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43","ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43"},"page":"600 - 613","date_published":"2017-04-01T00:00:00Z","publist_id":"7125","year":"2017","editor":[{"first_name":"Gerhard","last_name":"Jäger","full_name":"Jäger, Gerhard"},{"last_name":"Steila","first_name":"Silvia","full_name":"Steila, Silvia"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"volume":10185,"date_updated":"2021-01-12T08:07:39Z","date_created":"2018-12-11T11:47:42Z","publication_identifier":{"isbn":["978-331955910-0"]},"month":"04","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"oa":1,"quality_controlled":"1","doi":"10.1007/978-3-319-55911-7_43","conference":{"name":"TAMC: Theory and Applications of Models of Computation","end_date":"2017-04-22","start_date":"2017-04-20","location":"Bern, Switzerland"},"language":[{"iso":"eng"}]},{"series_title":"Lecture Notes in Mathematics","scopus_import":"1","day":"05","article_processing_charge":"No","page":"159 - 174","publication":"Modern Approaches to Discrete Curvature","citation":{"chicago":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5.","mla":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","ieee":"J. Maas, “Entropic Ricci curvature for discrete spaces,” in Modern Approaches to Discrete Curvature, vol. 2184, L. Najman and P. Romon, Eds. Springer, 2017, pp. 159–174.","apa":"Maas, J. (2017). Entropic Ricci curvature for discrete spaces. In L. Najman & P. Romon (Eds.), Modern Approaches to Discrete Curvature (Vol. 2184, pp. 159–174). Springer. https://doi.org/10.1007/978-3-319-58002-9_5","ama":"Maas J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5"},"date_published":"2017-10-05T00:00:00Z","type":"book_chapter","abstract":[{"text":"We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani.","lang":"eng"}],"status":"public","title":"Entropic Ricci curvature for discrete spaces","intvolume":" 2184","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"649","oa_version":"None","month":"10","publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-58002-9_5","publist_id":"7123","publication_status":"published","publisher":"Springer","department":[{"_id":"JaMa"}],"editor":[{"last_name":"Najman","first_name":"Laurent","full_name":"Najman, Laurent"},{"last_name":"Romon","first_name":"Pascal","full_name":"Romon, Pascal"}],"year":"2017","date_updated":"2022-05-24T07:01:33Z","date_created":"2018-12-11T11:47:42Z","volume":2184,"author":[{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}]},{"publist_id":"7119","volume":10185,"date_updated":"2021-01-12T08:07:46Z","date_created":"2018-12-11T11:47:42Z","author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski"}],"publisher":"Springer","editor":[{"last_name":"Jäger","first_name":"Gerhard","full_name":"Jäger, Gerhard"},{"first_name":"Silvia","last_name":"Steila","full_name":"Steila, Silvia"}],"department":[{"_id":"KrPi"}],"publication_status":"published","year":"2017","publication_identifier":{"issn":["03029743"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-55911-7_42","conference":{"end_date":"2017-04-22","location":"Bern, Switzerland","start_date":"2017-04-20","name":"TAMC: Theory and Applications of Models of Computation"},"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2016/965.pdf","open_access":"1"}],"abstract":[{"text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","intvolume":" 10185","status":"public","title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"650","day":"01","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","page":"586 - 599","citation":{"chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.","mla":"Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42"}},{"month":"08","language":[{"iso":"eng"}],"conference":{"name":"CSL: Conference on Computer Science Logic","end_date":"2017-08-24","start_date":"2017-08-20","location":"Stockholm, Sweden"},"doi":"10.4230/LIPICS.CSL.2017.18","quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"article_number":"18","date_created":"2019-06-04T12:42:43Z","date_updated":"2023-02-14T10:08:25Z","volume":82,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","year":"2017","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2017-08-01T00:00:00Z","citation":{"ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017."},"abstract":[{"lang":"eng","text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. "}],"type":"conference","file":[{"file_name":"2017_LIPIcs-Chatterjee.pdf","access_level":"open_access","file_size":710185,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"6520","date_created":"2019-06-04T12:56:52Z","date_updated":"2020-07-14T12:47:33Z","checksum":"7c2c9d09970af79026d7e37d9b632ef8"}],"oa_version":"Published Version","ddc":["004"],"status":"public","title":"Improved set-based symbolic algorithms for parity games","intvolume":" 82","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6519"},{"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34.","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34."},"date_published":"2017-12-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"intvolume":" 92","ddc":["510"],"title":"Embedding graphs into embedded graphs","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6517","oa_version":"Published Version","file":[{"checksum":"fc7a643e29621c8bbe49d36b39081f31","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:20:35Z","file_id":"6518","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":588982,"access_level":"open_access","file_name":"2017_LIPIcs-Fulek.pdf"}],"month":"12","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ISAAC.2017.34","conference":{"end_date":"2017-12-22","location":"Phuket, Thailand","start_date":"2017-12-09","name":"ISAAC: International Symposium on Algorithms and Computation"},"article_number":"34","ec_funded":1,"file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2017","volume":92,"date_created":"2019-06-04T12:11:52Z","date_updated":"2021-01-12T08:07:51Z","author":[{"full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek"}]}]