[{"abstract":[{"lang":"eng","text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 10212","month":"01","publication_status":"published","publication_identifier":{"isbn":["978-331956616-0"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10212,"_id":"635","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2017-05-04","location":"Paris, France","start_date":"2017-04-30"},"type":"conference","status":"public","date_updated":"2021-01-12T08:07:10Z","department":[{"_id":"KrPi"}],"oa":1,"publisher":"Springer","quality_controlled":"1","year":"2017","day":"01","page":"33 - 62","date_created":"2018-12-11T11:47:37Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-56617-7_2","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.","apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2","chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.","ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"7154","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen"},{"full_name":"Chen, Binchi","last_name":"Chen","first_name":"Binchi"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"},{"first_name":"Stefano","full_name":"Tessaro, Stefano","last_name":"Tessaro"}],"editor":[{"last_name":"Coron","full_name":"Coron, Jean-Sébastien","first_name":"Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"title":"Scrypt is maximally memory hard"},{"citation":{"ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.","ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11","apa":"Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate & G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","mla":"Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7152","author":[{"first_name":"Alexey","full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Dogan","last_name":"Ulus","full_name":"Ulus, Dogan"}],"title":"On the quantitative semantics of regular expressions over real-valued signals","editor":[{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"first_name":"Gilles","full_name":"Geeraerts, Gilles","last_name":"Geeraerts"}],"project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"year":"2017","day":"03","page":"189 - 206","date_created":"2018-12-11T11:47:38Z","date_published":"2017-08-03T00:00:00Z","doi":"10.1007/978-3-319-65765-3_11","oa":1,"publisher":"Springer","quality_controlled":"1","date_updated":"2021-01-12T08:07:14Z","department":[{"_id":"ToHe"}],"_id":"636","conference":{"start_date":"2017-09-05","end_date":"2017-09-07","location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-331965764-6"]},"language":[{"iso":"eng"}],"volume":10419,"abstract":[{"lang":"eng","text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems."}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01552132","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10419","month":"08"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-05-24T07:09:52Z","citation":{"apa":"Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8","ama":"Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8."},"editor":[{"first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","last_name":"Bogomolov"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"department":[{"_id":"ToHe"}],"title":"Numerical Software Verification","publist_id":"7150","article_processing_charge":"No","_id":"638","series_title":"LNCS","status":"public","type":"conference_editor","conference":{"location":"Toronto, ON, Canada","end_date":"2016-07-18","start_date":"2016-07-17","name":"NSV: Numerical Software Verification"},"day":"01","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"publication_status":"published","year":"2017","doi":"10.1007/978-3-319-54292-8","date_published":"2017-01-01T00:00:00Z","volume":10152,"date_created":"2018-12-11T11:47:38Z","oa_version":"None","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"month":"01","intvolume":" 10152","publisher":"Springer","quality_controlled":"1"},{"oa":1,"publisher":"Springer","quality_controlled":"1","year":"2017","day":"01","page":"3 - 32","date_created":"2018-12-11T11:47:39Z","doi":"10.1007/978-3-319-56617-7_1","date_published":"2017-04-01T00:00:00Z","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"citation":{"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.","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","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","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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"full_name":"Blocki, Jeremiah","last_name":"Blocki","first_name":"Jeremiah"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"publist_id":"7148","title":"Depth-robust graphs and their cumulative memory complexity","editor":[{"full_name":"Coron, Jean-Sébastien","last_name":"Coron","first_name":"Jean-Sébastien"},{"last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper","first_name":"Jesper"}],"abstract":[{"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.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/875"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10212","month":"04","publication_status":"published","publication_identifier":{"isbn":["978-331956616-0"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10212,"_id":"640","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Paris, France","end_date":"2017-05-04","start_date":"2017-04-30"},"type":"conference","status":"public","date_updated":"2021-01-12T08:07:22Z","department":[{"_id":"KrPi"}]},{"alternative_title":["LNCS"],"publisher":"Springer","quality_controlled":"1","scopus_import":1,"month":"01","intvolume":" 10302","abstract":[{"lang":"eng","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."}],"oa_version":"None","page":"323 - 334","doi":"10.1007/978-3-319-58771-4_26","volume":10302,"date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:39Z","publication_identifier":{"isbn":["978-331958770-7"]},"publication_status":"published","year":"2017","day":"01","language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2017-06-04","location":"Kolding, Denmark","end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"status":"public","_id":"641","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"},{"first_name":"Freddie","full_name":"Åström, Freddie","last_name":"Åström"},{"first_name":"Stefanie","full_name":"Petra, Stefanie","last_name":"Petra"}],"publist_id":"7147","title":"Graphical model parameter learning by inverse linear programming","editor":[{"last_name":"Lauze","full_name":"Lauze, François","first_name":"François"},{"last_name":"Dong","full_name":"Dong, Yiqiu","first_name":"Yiqiu"},{"first_name":"Anders","last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders"}],"department":[{"_id":"VlKo"}],"citation":{"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.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 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","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","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.","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.","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."},"date_updated":"2021-01-12T08:07:23Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"day":"04","file":[{"creator":"dernst","file_size":971347,"date_updated":"2020-07-14T12:47:30Z","file_name":"main(1).pdf","date_created":"2019-05-13T08:14:44Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6431","checksum":"b48d42725182d7ca10107a118815f4cf"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2017","publication_status":"published","related_material":{"record":[{"relation":"later_version","status":"public","id":"133"}]},"date_published":"2017-08-04T00:00:00Z","doi":"10.15479/AT:IST-2018-853-v2-2","date_created":"2019-05-13T08:15:55Z","page":"28","oa_version":"Published Version","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"}],"month":"08","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","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.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2","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","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2."},"date_updated":"2023-02-21T16:59:21Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:30Z","title":"Synchronizing the asynchronous","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"_id":"6426","status":"public","type":"technical_report"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","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.","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","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"},"title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","external_id":{"pmid":["28847140"]},"article_processing_charge":"No","author":[{"full_name":"Sun, Wuping","last_name":"Sun","first_name":"Wuping"},{"last_name":"Zhai","full_name":"Zhai, Ming-Zhu","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"last_name":"Qian","full_name":"Qian, Chengrui","first_name":"Chengrui"},{"last_name":"Jiang","full_name":"Jiang, Changyu","first_name":"Changyu"}],"publist_id":"7142","publisher":"Chinese Physiological Society","quality_controlled":"1","publication":"Chinese Journal of Physiology","day":"31","year":"2017","date_created":"2018-12-11T11:47:40Z","date_published":"2017-08-31T00:00:00Z","doi":"10.4077/CJP.2017.BAF469","page":"207 - 214","_id":"643","status":"public","article_type":"original","type":"journal_article","ddc":["570"],"date_updated":"2021-01-12T08:07:28Z","department":[{"_id":"RySh"}],"pmid":1,"oa_version":"Published Version","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"}],"intvolume":" 60","month":"08","scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["03044920"]},"issue":"4","volume":60},{"date_published":"2017-01-01T00:00:00Z","doi":"10.1090/mcom/3201","date_created":"2018-12-11T11:47:40Z","page":"2373 - 2397","day":"01","publication":"Mathematics of Computation","year":"2017","quality_controlled":"1","publisher":"American Mathematical Society","oa":1,"title":"Localization errors in solving stochastic partial differential equations in the whole space","author":[{"first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","full_name":"Gerencser, Mate"},{"first_name":"István","last_name":"Gyöngy","full_name":"Gyöngy, István"}],"publist_id":"7144","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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.","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","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","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 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.","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.","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."},"volume":86,"issue":"307","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00255718"]},"publication_status":"published","month":"01","intvolume":" 86","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.05535"}],"oa_version":"Submitted Version","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."}],"department":[{"_id":"JaMa"}],"date_updated":"2021-01-12T08:07:26Z","status":"public","type":"journal_article","_id":"642"},{"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:07:32Z","status":"public","type":"conference","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28"},"_id":"645","volume":10426,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331963386-2"]},"publication_status":"published","month":"07","intvolume":" 10426","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/1705.02326","open_access":"1"}],"oa_version":"Submitted Version","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"}],"title":"Value iteration for long run average reward in markov decision processes","editor":[{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"},{"last_name":"Kunčak","full_name":"Kunčak, Viktor","first_name":"Viktor"}],"author":[{"first_name":"Pranav","full_name":"Ashok, Pranav","last_name":"Ashok"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"}],"publist_id":"7135","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","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","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.","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."},"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"date_published":"2017-07-13T00:00:00Z","doi":"10.1007/978-3-319-63387-9_10","date_created":"2018-12-11T11:47:41Z","page":"201 - 221","day":"13","year":"2017","quality_controlled":"1","publisher":"Springer","oa":1},{"day":"29","publication":"SIAM Journal on Computing","year":"2017","date_published":"2017-06-29T00:00:00Z","doi":"10.1137/16M1091836","date_created":"2018-12-11T11:47:40Z","page":"1087 - 1110","quality_controlled":"1","publisher":"SIAM","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","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","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","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.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110."},"title":"The complexity of general-valued CSPs","publist_id":"7138","author":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andrei","last_name":"Krokhin","full_name":"Krokhin, Andrei"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"}],"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":46,"related_material":{"record":[{"relation":"other","id":"1637","status":"public"}]},"issue":"3","ec_funded":1,"oa_version":"Preprint","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."}],"month":"06","intvolume":" 46","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.07327"}],"date_updated":"2023-02-23T10:07:49Z","department":[{"_id":"VlKo"}],"_id":"644","status":"public","type":"journal_article"},{"oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T11:47:41Z","date_published":"2017-06-01T00:00:00Z","doi":"10.1007/978-3-319-58771-4_19","page":"235 - 246","day":"01","year":"2017","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"editor":[{"last_name":"Lauze","full_name":"Lauze, François","first_name":"François"},{"first_name":"Yiqiu","full_name":"Dong, Yiqiu","last_name":"Dong"},{"first_name":"Anders","full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl"}],"title":"A novel convex relaxation for non binary discrete tomography","publist_id":"7132","author":[{"full_name":"Kuske, Jan","last_name":"Kuske","first_name":"Jan"},{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"first_name":"Stefanie","full_name":"Petra, Stefanie","last_name":"Petra"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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","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.","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."},"intvolume":" 10302","month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","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"}],"ec_funded":1,"volume":10302,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331958770-7"]},"status":"public","conference":{"start_date":"2017-06-04","location":"Kolding, Denmark","end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"type":"conference","_id":"646","department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T08:07:34Z"},{"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:39Z","status":"public","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20"},"type":"conference","_id":"648","volume":10185,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331955910-0"]},"intvolume":" 10185","month":"04","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","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."}],"title":"On the complexity of breaking pseudoentropy","editor":[{"last_name":"Jäger","full_name":"Jäger, Gerhard","first_name":"Gerhard"},{"first_name":"Silvia","full_name":"Steila, Silvia","last_name":"Steila"}],"publist_id":"7125","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","full_name":"Skórski, Maciej","last_name":"Skórski"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","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.","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","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.","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."},"date_created":"2018-12-11T11:47:42Z","doi":"10.1007/978-3-319-55911-7_43","date_published":"2017-04-01T00:00:00Z","page":"600 - 613","day":"01","year":"2017","oa":1,"quality_controlled":"1","publisher":"Springer"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 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","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","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.","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","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."},"title":"Entropic Ricci curvature for discrete spaces","editor":[{"last_name":"Najman","full_name":"Najman, Laurent","first_name":"Laurent"},{"first_name":"Pascal","last_name":"Romon","full_name":"Romon, Pascal"}],"article_processing_charge":"No","publist_id":"7123","author":[{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas"}],"publication":"Modern Approaches to Discrete Curvature","day":"05","year":"2017","date_created":"2018-12-11T11:47:42Z","doi":"10.1007/978-3-319-58002-9_5","date_published":"2017-10-05T00:00:00Z","page":"159 - 174","publisher":"Springer","quality_controlled":"1","date_updated":"2022-05-24T07:01:33Z","department":[{"_id":"JaMa"}],"series_title":"Lecture Notes in Mathematics","_id":"649","status":"public","type":"book_chapter","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"volume":2184,"oa_version":"None","abstract":[{"lang":"eng","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."}],"intvolume":" 2184","month":"10","scopus_import":"1"},{"year":"2017","day":"01","page":"586 - 599","date_created":"2018-12-11T11:47:42Z","doi":"10.1007/978-3-319-55911-7_42","date_published":"2017-01-01T00:00:00Z","oa":1,"publisher":"Springer","quality_controlled":"1","citation":{"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.","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.","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.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, 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","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","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Skórski","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej"}],"publist_id":"7119","editor":[{"first_name":"Gerhard","full_name":"Jäger, Gerhard","last_name":"Jäger"},{"first_name":"Silvia","full_name":"Steila, Silvia","last_name":"Steila"}],"title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","publication_status":"published","publication_identifier":{"issn":["03029743"]},"language":[{"iso":"eng"}],"volume":10185,"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/965.pdf"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10185","month":"01","date_updated":"2021-01-12T08:07:46Z","department":[{"_id":"KrPi"}],"_id":"650","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20"},"type":"conference","status":"public"},{"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"article_number":"18","title":"Improved set-based symbolic algorithms for parity games","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","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.","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.","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."},"publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","quality_controlled":"1","oa":1,"doi":"10.4230/LIPICS.CSL.2017.18","date_published":"2017-08-01T00:00:00Z","date_created":"2019-06-04T12:42:43Z","day":"01","has_accepted_license":"1","year":"2017","status":"public","type":"conference","conference":{"name":"CSL: Conference on Computer Science Logic","end_date":"2017-08-24","location":"Stockholm, Sweden","start_date":"2017-08-20"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"_id":"6519","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:33Z","ddc":["004"],"date_updated":"2023-02-14T10:08:25Z","month":"08","intvolume":" 82","scopus_import":"1","oa_version":"Published Version","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. "}],"volume":82,"license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6520","checksum":"7c2c9d09970af79026d7e37d9b632ef8","creator":"kschuh","file_size":710185,"date_updated":"2020-07-14T12:47:33Z","file_name":"2017_LIPIcs-Chatterjee.pdf","date_created":"2019-06-04T12:56:52Z"}],"language":[{"iso":"eng"}],"publication_status":"published"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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","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","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","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.","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 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."},"title":"Embedding graphs into embedded graphs","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"}],"article_number":"34","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"day":"01","has_accepted_license":"1","year":"2017","date_published":"2017-12-01T00:00:00Z","doi":"10.4230/LIPICS.ISAAC.2017.34","date_created":"2019-06-04T12:11:52Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"ddc":["510"],"date_updated":"2021-01-12T08:07:51Z","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"UlWa"}],"_id":"6517","status":"public","type":"conference","conference":{"end_date":"2017-12-22","location":"Phuket, Thailand","start_date":"2017-12-09","name":"ISAAC: International Symposium on Algorithms and Computation"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_created":"2019-06-04T12:20:35Z","file_name":"2017_LIPIcs-Fulek.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":588982,"creator":"kschuh","file_id":"6518","checksum":"fc7a643e29621c8bbe49d36b39081f31","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":92,"ec_funded":1,"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"12","intvolume":" 92","scopus_import":1},{"oa_version":"None","abstract":[{"text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed.","lang":"eng"}],"month":"02","quality_controlled":"1","publisher":"IEEE","scopus_import":1,"language":[{"iso":"eng"}],"day":"07","publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-150905069-7"]},"date_created":"2018-12-11T11:47:43Z","date_published":"2017-02-07T00:00:00Z","doi":"10.1109/DEVLRN.2016.7846789","article_number":"7846789","_id":"652","status":"public","conference":{"name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics ","start_date":"2016-09-19","end_date":"2016-09-22","location":"Cergy-Pontoise, France"},"type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789.","ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","mla":"Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789.","ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789","apa":"Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789"},"date_updated":"2021-01-12T08:07:51Z","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","author":[{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"},{"full_name":"Martius, Georg S","last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7100"},{"publication_identifier":{"issn":["00280836"]},"publication_status":"published","year":"2017","day":"11","publication":"Nature","language":[{"iso":"eng"}],"page":"161 - 162","issue":"7636","volume":541,"date_published":"2017-01-11T00:00:00Z","doi":"10.1038/541161a","date_created":"2018-12-11T11:47:43Z","abstract":[{"lang":"eng","text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n"}],"oa_version":"None","scopus_import":1,"publisher":"Nature Publishing Group","quality_controlled":"1","month":"01","intvolume":" 541","citation":{"ama":"Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.","short":"B. Hof, Nature 541 (2017) 161–162.","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a."},"date_updated":"2021-01-12T08:07:49Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7116","title":"Fluid dynamics: Water flows out of touch","department":[{"_id":"BjHo"}],"_id":"651","type":"journal_article","status":"public"},{"page":"358 - 366","date_published":"2017-03-01T00:00:00Z","doi":"10.1038/ng.3764","date_created":"2018-12-11T11:47:43Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Nature Genetics","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","publist_id":"7092","author":[{"last_name":"Makohon Moore","full_name":"Makohon Moore, Alvin","first_name":"Alvin"},{"first_name":"Ming","full_name":"Zhang, Ming","last_name":"Zhang"},{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter"},{"last_name":"Božić","full_name":"Božić, Ivana","first_name":"Ivana"},{"last_name":"Allen","full_name":"Allen, Benjamin","first_name":"Benjamin"},{"id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan","full_name":"Kundu, Deepanjan","last_name":"Kundu"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Fay","full_name":"Wong, Fay","last_name":"Wong"},{"first_name":"Yuchen","full_name":"Jiao, Yuchen","last_name":"Jiao"},{"last_name":"Kohutek","full_name":"Kohutek, Zachary","first_name":"Zachary"},{"full_name":"Hong, Jungeui","last_name":"Hong","first_name":"Jungeui"},{"full_name":"Attiyeh, Marc","last_name":"Attiyeh","first_name":"Marc"},{"first_name":"Breanna","last_name":"Javier","full_name":"Javier, Breanna"},{"last_name":"Wood","full_name":"Wood, Laura","first_name":"Laura"},{"full_name":"Hruban, Ralph","last_name":"Hruban","first_name":"Ralph"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"},{"last_name":"Papadopoulos","full_name":"Papadopoulos, Nickolas","first_name":"Nickolas"},{"first_name":"Kenneth","last_name":"Kinzler","full_name":"Kinzler, Kenneth"},{"last_name":"Vogelstein","full_name":"Vogelstein, Bert","first_name":"Bert"},{"first_name":"Christine","last_name":"Iacobuzio Donahue","full_name":"Iacobuzio Donahue, Christine"}],"article_processing_charge":"No","external_id":{"pmid":["28092682"]},"title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","citation":{"chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.","mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.","ieee":"A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"volume":49,"issue":"3","ec_funded":1,"publication_identifier":{"issn":["10614036"]},"publication_status":"published","file":[{"checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","file_id":"7050","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2017_NatureGenetics_Makohon.pdf","date_created":"2019-11-19T08:13:50Z","creator":"dernst","file_size":908099,"date_updated":"2020-07-14T12:47:33Z"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"03","intvolume":" 49","abstract":[{"lang":"eng","text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease."}],"oa_version":"Submitted Version","pmid":1,"file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrCh"}],"date_updated":"2022-06-10T09:55:08Z","ddc":["000"],"article_type":"original","type":"journal_article","status":"public","_id":"653"},{"author":[{"last_name":"Alwen","full_name":"Alwen, Joel F","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"},{"first_name":"Ben","full_name":"Harsha, Ben","last_name":"Harsha"}],"department":[{"_id":"KrPi"}],"title":"Practical graphs for optimal side-channel resistant memory-hard functions","citation":{"ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031.","apa":"Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031","ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031."},"date_updated":"2021-01-12T08:07:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Dallas, TX, USA","end_date":"2017-11-03","start_date":"2017-10-30","name":"CCS: Conference on Computer and Communications Security"},"type":"conference","status":"public","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"_id":"6527","page":"1001-1017","date_created":"2019-06-06T13:21:29Z","ec_funded":1,"date_published":"2017-10-30T00:00:00Z","doi":"10.1145/3133956.3134031","year":"2017","publication_status":"published","publication_identifier":{"isbn":["9781450349468"]},"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","language":[{"iso":"eng"}],"day":"30","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/443"}],"oa":1,"scopus_import":1,"quality_controlled":"1","publisher":"ACM Press","month":"10","abstract":[{"lang":"eng","text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"}],"oa_version":"Submitted Version"}]