[{"doi":"10.1007/978-3-319-55911-7_43","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","start_date":"2017-04-20","end_date":"2017-04-22"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"oa":1,"quality_controlled":"1","publication_identifier":{"isbn":["978-331955910-0"]},"month":"04","author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej"}],"volume":10185,"date_updated":"2021-01-12T08:07:39Z","date_created":"2018-12-11T11:47:42Z","year":"2017","department":[{"_id":"KrPi"}],"publisher":"Springer","editor":[{"full_name":"Jäger, Gerhard","first_name":"Gerhard","last_name":"Jäger"},{"first_name":"Silvia","last_name":"Steila","full_name":"Steila, Silvia"}],"publication_status":"published","publist_id":"7125","date_published":"2017-04-01T00:00:00Z","citation":{"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","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.","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.","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."},"page":"600 - 613","day":"01","scopus_import":1,"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"648","intvolume":" 10185","status":"public","title":"On the complexity of breaking pseudoentropy","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"]},{"oa_version":"None","intvolume":" 2184","status":"public","title":"Entropic Ricci curvature for discrete spaces","_id":"649","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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","page":"159 - 174","citation":{"chicago":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5.","mla":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","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.","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","article_processing_charge":"No","day":"05","series_title":"Lecture Notes in Mathematics","scopus_import":"1","volume":2184,"date_created":"2018-12-11T11:47:42Z","date_updated":"2022-05-24T07:01:33Z","author":[{"full_name":"Maas, Jan","last_name":"Maas","first_name":"Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","department":[{"_id":"JaMa"}],"editor":[{"full_name":"Najman, Laurent","first_name":"Laurent","last_name":"Najman"},{"full_name":"Romon, Pascal","last_name":"Romon","first_name":"Pascal"}],"publication_status":"published","year":"2017","publist_id":"7123","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-58002-9_5","quality_controlled":"1","publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"month":"10"},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/965.pdf"}],"quality_controlled":"1","conference":{"name":"TAMC: Theory and Applications of Models of Computation","end_date":"2017-04-22","location":"Bern, Switzerland","start_date":"2017-04-20"},"doi":"10.1007/978-3-319-55911-7_42","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["03029743"]},"year":"2017","publication_status":"published","publisher":"Springer","editor":[{"full_name":"Jäger, Gerhard","first_name":"Gerhard","last_name":"Jäger"},{"full_name":"Steila, Silvia","first_name":"Silvia","last_name":"Steila"}],"department":[{"_id":"KrPi"}],"author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej"}],"date_updated":"2021-01-12T08:07:46Z","date_created":"2018-12-11T11:47:42Z","volume":10185,"publist_id":"7119","citation":{"chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.","mla":"Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","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.","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","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"},"page":"586 - 599","date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01","_id":"650","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","intvolume":" 10185","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"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."}]},{"file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/3.0/","article_number":"18","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"date_created":"2019-06-04T12:42:43Z","date_updated":"2023-02-14T10:08:25Z","volume":82,"year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","department":[{"_id":"KrCh"}],"month":"08","conference":{"end_date":"2017-08-24","start_date":"2017-08-20","location":"Stockholm, Sweden","name":"CSL: Conference on Computer Science Logic"},"doi":"10.4230/LIPICS.CSL.2017.18","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"abstract":[{"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. ","lang":"eng"}],"type":"conference","oa_version":"Published Version","file":[{"checksum":"7c2c9d09970af79026d7e37d9b632ef8","date_created":"2019-06-04T12:56:52Z","date_updated":"2020-07-14T12:47:33Z","relation":"main_file","file_id":"6520","file_size":710185,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2017_LIPIcs-Chatterjee.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6519","title":"Improved set-based symbolic algorithms for parity games","status":"public","ddc":["004"],"intvolume":" 82","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2017-08-01T00:00:00Z","citation":{"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","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.","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","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.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","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."}},{"citation":{"ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","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","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","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","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.","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.","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"date_published":"2017-12-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 92","ddc":["510"],"status":"public","title":"Embedding graphs into embedded graphs","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6517","file":[{"file_id":"6518","relation":"main_file","checksum":"fc7a643e29621c8bbe49d36b39081f31","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:20:35Z","access_level":"open_access","file_name":"2017_LIPIcs-Fulek.pdf","creator":"kschuh","file_size":588982,"content_type":"application/pdf"}],"oa_version":"Published Version","type":"conference","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"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ISAAC.2017.34","conference":{"location":"Phuket, Thailand","start_date":"2017-12-09","end_date":"2017-12-22","name":"ISAAC: International Symposium on Algorithms and Computation"},"month":"12","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2017","volume":92,"date_created":"2019-06-04T12:11:52Z","date_updated":"2021-01-12T08:07:51Z","author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav"}],"article_number":"34","ec_funded":1,"file_date_updated":"2020-07-14T12:47:33Z"}]