[{"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2016/875","open_access":"1"}],"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"quality_controlled":"1","doi":"10.1007/978-3-319-56617-7_1","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2017-04-30","location":"Paris, France","end_date":"2017-05-04"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331956616-0"]},"month":"04","year":"2017","editor":[{"last_name":"Coron","first_name":"Jean-Sébastien","full_name":"Coron, Jean-Sébastien"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"volume":10212,"date_created":"2018-12-11T11:47:39Z","date_updated":"2021-01-12T08:07:22Z","ec_funded":1,"publist_id":"7148","citation":{"short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","mla":"Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32."},"page":"3 - 32","date_published":"2017-04-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"640","intvolume":" 10212","title":"Depth-robust graphs and their cumulative memory complexity","status":"public","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions."}]},{"publication_identifier":{"isbn":["978-331958770-7"]},"month":"01","day":"01","scopus_import":1,"doi":"10.1007/978-3-319-58771-4_26","date_published":"2017-01-01T00:00:00Z","conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"language":[{"iso":"eng"}],"citation":{"ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). 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_26","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","mla":"Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26."},"page":"323 - 334","quality_controlled":"1","publist_id":"7147","abstract":[{"text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"author":[{"full_name":"Trajkovska, Vera","last_name":"Trajkovska","first_name":"Vera"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Åström, Freddie","first_name":"Freddie","last_name":"Åström"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}],"volume":10302,"oa_version":"None","date_created":"2018-12-11T11:47:39Z","date_updated":"2021-01-12T08:07:23Z","_id":"641","year":"2017","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"publisher":"Springer","intvolume":" 10302","editor":[{"last_name":"Lauze","first_name":"François","full_name":"Lauze, François"},{"full_name":"Dong, Yiqiu","first_name":"Yiqiu","last_name":"Dong"},{"first_name":"Anders","last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders"}],"status":"public","title":"Graphical model parameter learning by inverse linear programming","publication_status":"published"},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"08","day":"04","page":"28","oa":1,"citation":{"chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","apa":"Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2","ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2"},"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2018-853-v2-2","date_published":"2017-08-04T00:00:00Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:30Z","publisher":"IST Austria","department":[{"_id":"ToHe"}],"publication_status":"published","status":"public","title":"Synchronizing the asynchronous","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6426","year":"2017","oa_version":"Published Version","file":[{"date_created":"2019-05-13T08:14:44Z","date_updated":"2020-07-14T12:47:30Z","checksum":"b48d42725182d7ca10107a118815f4cf","relation":"main_file","file_id":"6431","file_size":971347,"content_type":"application/pdf","creator":"dernst","file_name":"main(1).pdf","access_level":"open_access"}],"date_updated":"2023-02-21T16:59:21Z","date_created":"2019-05-13T08:15:55Z","related_material":{"record":[{"id":"133","status":"public","relation":"later_version"}]},"author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}]},{"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"}],"issue":"4","type":"journal_article","oa_version":"Published Version","_id":"643","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","ddc":["570"],"status":"public","intvolume":" 60","day":"31","article_processing_charge":"No","scopus_import":1,"date_published":"2017-08-31T00:00:00Z","publication":"Chinese Journal of Physiology","citation":{"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.","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","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.","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."},"article_type":"original","page":"207 - 214","publist_id":"7142","author":[{"full_name":"Sun, Wuping","first_name":"Wuping","last_name":"Sun"},{"full_name":"Zhai, Ming-Zhu","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Zhai","first_name":"Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"full_name":"Qian, Chengrui","last_name":"Qian","first_name":"Chengrui"},{"full_name":"Jiang, Changyu","last_name":"Jiang","first_name":"Changyu"}],"date_updated":"2021-01-12T08:07:28Z","date_created":"2018-12-11T11:47:40Z","volume":60,"year":"2017","pmid":1,"publication_status":"published","department":[{"_id":"RySh"}],"publisher":"Chinese Physiological Society","month":"08","publication_identifier":{"issn":["03044920"]},"doi":"10.4077/CJP.2017.BAF469","language":[{"iso":"eng"}],"external_id":{"pmid":["28847140"]},"quality_controlled":"1"},{"doi":"10.1090/mcom/3201","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1508.05535","open_access":"1"}],"quality_controlled":"1","month":"01","publication_identifier":{"issn":["00255718"]},"author":[{"last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"full_name":"Gyöngy, István","last_name":"Gyöngy","first_name":"István"}],"date_created":"2018-12-11T11:47:40Z","date_updated":"2021-01-12T08:07:26Z","volume":86,"year":"2017","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"American Mathematical Society","publist_id":"7144","date_published":"2017-01-01T00:00:00Z","publication":"Mathematics of Computation","citation":{"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.","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.","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.","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.","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","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"},"page":"2373 - 2397","day":"01","scopus_import":1,"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"642","title":"Localization errors in solving stochastic partial differential equations in the whole space","status":"public","intvolume":" 86","abstract":[{"lang":"eng","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."}],"issue":"307","type":"journal_article"},{"page":"201 - 221","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."},"date_published":"2017-07-13T00:00:00Z","scopus_import":1,"day":"13","status":"public","title":"Value iteration for long run average reward in markov decision processes","intvolume":" 10426","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"645","oa_version":"Submitted Version","alternative_title":["LNCS"],"type":"conference","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"}],"quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28"},"doi":"10.1007/978-3-319-63387-9_10","month":"07","publication_identifier":{"isbn":["978-331963386-2"]},"publication_status":"published","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Kunčak","first_name":"Viktor","full_name":"Kunčak, Viktor"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2017","date_updated":"2021-01-12T08:07:32Z","date_created":"2018-12-11T11:47:41Z","volume":10426,"author":[{"last_name":"Ashok","first_name":"Pranav","full_name":"Ashok, Pranav"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"}],"ec_funded":1,"publist_id":"7135"},{"doi":"10.1137/16M1091836","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1502.07327","open_access":"1"}],"quality_controlled":"1","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"month":"06","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"last_name":"Krokhin","first_name":"Andrei","full_name":"Krokhin, Andrei"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal","full_name":"Rolinek, Michal"}],"related_material":{"record":[{"id":"1637","relation":"other","status":"public"}]},"date_created":"2018-12-11T11:47:40Z","date_updated":"2023-02-23T10:07:49Z","volume":46,"year":"2017","publication_status":"published","publisher":"SIAM","department":[{"_id":"VlKo"}],"publist_id":"7138","ec_funded":1,"date_published":"2017-06-29T00:00:00Z","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."},"page":"1087 - 1110","day":"29","scopus_import":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"644","status":"public","title":"The complexity of general-valued CSPs","intvolume":" 46","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"},{"year":"2017","department":[{"_id":"VlKo"}],"publisher":"Springer","editor":[{"full_name":"Lauze, François","first_name":"François","last_name":"Lauze"},{"full_name":"Dong, Yiqiu","last_name":"Dong","first_name":"Yiqiu"},{"last_name":"Bjorholm Dahl","first_name":"Anders","full_name":"Bjorholm Dahl, Anders"}],"publication_status":"published","author":[{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"last_name":"Petra","first_name":"Stefanie","full_name":"Petra, Stefanie"}],"volume":10302,"date_created":"2018-12-11T11:47:41Z","date_updated":"2021-01-12T08:07:34Z","publist_id":"7132","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}],"oa":1,"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"quality_controlled":"1","doi":"10.1007/978-3-319-58771-4_19","conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","end_date":"2017-06-08","start_date":"2017-06-04","location":"Kolding, Denmark"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331958770-7"]},"month":"06","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"646","intvolume":" 10302","title":"A novel convex relaxation for non binary discrete tomography","status":"public","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","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."}],"citation":{"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","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.","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","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.","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","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."},"page":"235 - 246","date_published":"2017-06-01T00:00:00Z","scopus_import":1,"day":"01"},{"date_published":"2017-04-01T00:00:00Z","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.","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.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, 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.","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.","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","day":"01","scopus_import":1,"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"648","intvolume":" 10185","title":"On the complexity of breaking pseudoentropy","status":"public","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."}],"type":"conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-55911-7_43","conference":{"name":"TAMC: Theory and Applications of Models of Computation","start_date":"2017-04-20","location":"Bern, Switzerland","end_date":"2017-04-22"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-331955910-0"]},"month":"04","author":[{"last_name":"Skórski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"volume":10185,"date_created":"2018-12-11T11:47:42Z","date_updated":"2021-01-12T08:07:39Z","year":"2017","publisher":"Springer","editor":[{"last_name":"Jäger","first_name":"Gerhard","full_name":"Jäger, Gerhard"},{"full_name":"Steila, Silvia","last_name":"Steila","first_name":"Silvia"}],"department":[{"_id":"KrPi"}],"publication_status":"published","publist_id":"7125"},{"author":[{"orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan","full_name":"Maas, Jan"}],"volume":2184,"date_updated":"2022-05-24T07:01:33Z","date_created":"2018-12-11T11:47:42Z","year":"2017","publisher":"Springer","editor":[{"first_name":"Laurent","last_name":"Najman","full_name":"Najman, Laurent"},{"first_name":"Pascal","last_name":"Romon","full_name":"Romon, Pascal"}],"department":[{"_id":"JaMa"}],"publication_status":"published","publist_id":"7123","doi":"10.1007/978-3-319-58002-9_5","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"month":"10","oa_version":"None","_id":"649","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2184","title":"Entropic Ricci curvature for discrete spaces","status":"public","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"}],"type":"book_chapter","date_published":"2017-10-05T00:00:00Z","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.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","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.","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","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.","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","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"},"publication":"Modern Approaches to Discrete Curvature","page":"159 - 174","article_processing_charge":"No","day":"05","scopus_import":"1","series_title":"Lecture Notes in Mathematics"}]