[{"publist_id":"4723","ec_funded":1,"month":"12","doi":"10.1007/978-3-642-45221-5_17","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"quality_controlled":"1","series_title":"Lecture Notes in Computer Science","volume":8312,"publisher":"Springer","publication_status":"published","day":"01","status":"public","oa_version":"None","date_created":"2018-12-11T11:56:30Z","type":"conference","department":[{"_id":"KrCh"}],"date_published":"2013-12-01T00:00:00Z","page":"228 - 242","citation":{"ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Multi-Objective Discounted Reward Verification in Graphs and MDPs</i>. Vol. 8312, Springer, 2013, pp. 228–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>.","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","apa":"Chatterjee, K., Forejt, V., &#38; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>"},"abstract":[{"text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n","lang":"eng"}],"_id":"2238","date_updated":"2020-08-11T10:09:42Z","language":[{"iso":"eng"}],"year":"2013","intvolume":"      8312","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"full_name":"Wojtczak, Dominik","first_name":"Dominik","last_name":"Wojtczak"}],"alternative_title":["LNCS"],"conference":{"start_date":"2013-12-14","location":"Stellenbosch, South Africa","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2013-12-19"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Multi-objective discounted reward verification in graphs and MDPs","scopus_import":1},{"publist_id":"4708","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","month":"09","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:45:34Z","pubrep_id":"136","doi":"10.4230/LIPIcs.CSL.2013.563","ddc":["000","004"],"quality_controlled":"1","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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)"},"volume":23,"series_title":"Leibniz International Proceedings in Informatics","file":[{"content_type":"application/pdf","checksum":"e0732e73a8b1e39483df7717d53e3e35","creator":"system","date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","file_name":"IST-2016-136-v1+2_39.pdf","file_size":454915,"date_created":"2018-12-12T10:12:11Z","relation":"main_file","file_id":"4929"}],"status":"public","day":"01","type":"conference","oa_version":"Published Version","date_created":"2018-12-11T11:56:32Z","oa":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"_id":"2243","date_updated":"2020-08-11T10:09:42Z","department":[{"_id":"ToHe"}],"citation":{"ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>"},"page":"563 - 577","date_published":"2013-09-01T00:00:00Z","year":"2013","author":[{"first_name":"Jakub","last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"intvolume":"        23","alternative_title":["LIPIcs"],"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Elementary modal logics over transitive structures","conference":{"end_date":"2013-09-05","name":"CSL: Computer Science Logic","location":"Torino, Italy","start_date":"2013-09-02"}},{"month":"09","project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-03841-4_41","publist_id":"4707","main_file_link":[{"url":"http://arxiv.org/abs/1302.6475","open_access":"1"}],"publication_status":"published","publisher":"Springer","volume":8242,"series_title":"Lecture Notes in Computer Science","arxiv":1,"status":"public","day":"01","acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","external_id":{"arxiv":["1302.6475"]},"quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-09-18T14:27:53Z","_id":"2244","abstract":[{"lang":"eng","text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to &quot;untangle&quot; the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components (&quot;holes&quot;), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. "}],"department":[{"_id":"UlWa"}],"citation":{"mla":"Matoušek, Jiří, et al. <i>Untangling Two Systems of Noncrossing Curves</i>. Vol. 8242, Springer, 2013, pp. 472–83, doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>."},"date_published":"2013-09-01T00:00:00Z","page":"472 - 483","type":"conference","date_created":"2018-12-11T11:56:32Z","oa_version":"Preprint","oa":1,"alternative_title":["LNCS"],"scopus_import":1,"title":"Untangling two systems of noncrossing curves","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"GD: Graph Drawing and Network Visualization","end_date":"2013-09-25","location":"Bordeaux, France","start_date":"2013-09-23"},"year":"2013","related_material":{"record":[{"relation":"later_version","status":"public","id":"1411"}]},"intvolume":"      8242","author":[{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"full_name":"Sedgwick, Eric","first_name":"Eric","last_name":"Sedgwick"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","first_name":"Martin","orcid":"0000-0002-1191-6714","last_name":"Tancer"},{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"}]},{"_id":"2256","abstract":[{"lang":"eng","text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license."},{"text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte.","lang":"ger"}],"date_updated":"2021-01-12T06:56:20Z","department":[{"_id":"E-Lib"}],"date_published":"2013-12-01T00:00:00Z","citation":{"ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. 2013;66(3/4):559-587.","short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., &#38; Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. Verein Österreichischer Bibliothekarinnen und Bibliothekare."},"page":"559 - 587","language":[{"iso":"eng"}],"has_accepted_license":"1","issue":"3/4","oa":1,"date_created":"2018-12-11T11:56:36Z","oa_version":"Published Version","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","author":[{"first_name":"Patrick","last_name":"Danowski","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goldfarb","first_name":"Doron","full_name":"Goldfarb, Doron"},{"full_name":"Schaffner, Verena","last_name":"Schaffner","first_name":"Verena"},{"last_name":"Seidler","first_name":"Wolfram","full_name":"Seidler, Wolfram"}],"intvolume":"        66","year":"2013","file_date_updated":"2020-07-14T12:45:35Z","pubrep_id":"719","month":"12","popular_science":"1","publist_id":"4690","status":"public","day":"01","file":[{"file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","access_level":"open_access","file_size":881545,"checksum":"ae57ffcee3720adcc27b0f2767a1e04b","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","creator":"system","file_id":"4669","relation":"main_file","date_created":"2018-12-12T10:08:09Z"}],"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)"},"volume":66,"publication":"VÖB Mitteilungen","publication_status":"published","publisher":"Verein Österreichischer Bibliothekarinnen und Bibliothekare","ddc":["020"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","conference":{"location":"Santa Barbara, CA, United States","start_date":"2013-08-18","name":"CRYPTO: International Cryptology Conference","end_date":"2013-08-22"},"scopus_import":1,"alternative_title":["LNCS"],"intvolume":"      8042","author":[{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Szegedy, Mario","last_name":"Szegedy","first_name":"Mario"}],"year":"2013","_id":"2258","abstract":[{"lang":"eng","text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n"}],"date_updated":"2021-01-12T06:56:21Z","department":[{"_id":"KrPi"}],"citation":{"ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>.","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.","ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>","mla":"Kiltz, Eike, et al. <i>Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions</i>. Vol. 8042, Springer, 2013, pp. 571–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>.","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","apa":"Kiltz, E., Pietrzak, K. Z., &#38; Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>"},"date_published":"2013-01-01T00:00:00Z","page":"571 - 588","language":[{"iso":"eng"}],"has_accepted_license":"1","oa":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:37Z","type":"conference","status":"public","day":"01","file":[{"content_type":"application/pdf","checksum":"18a3f602cb41de184dc0e16a0e907633","date_updated":"2020-07-14T12:45:35Z","creator":"system","file_name":"IST-2016-685-v1+1_658.pdf","access_level":"open_access","file_size":493175,"date_created":"2018-12-12T10:09:20Z","relation":"main_file","file_id":"4744"}],"series_title":"Lecture Notes in Computer Science","volume":8042,"publication_status":"published","publisher":"Springer","quality_controlled":"1","ddc":["000","004"],"file_date_updated":"2020-07-14T12:45:35Z","pubrep_id":"685","doi":"10.1007/978-3-642-40041-4_31","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"month":"01","ec_funded":1,"publist_id":"4688"},{"date_published":"2013-01-01T00:00:00Z","citation":{"ama":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">10.1007/978-3-642-40041-4_4</a>","ieee":"J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.","ista":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.","chicago":"Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">https://doi.org/10.1007/978-3-642-40041-4_4</a>.","mla":"Alwen, Joel F., et al. <i>Learning with Rounding, Revisited: New Reduction Properties and Applications</i>. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">10.1007/978-3-642-40041-4_4</a>.","short":"J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.","apa":"Alwen, J. F., Krenn, S., Pietrzak, K. Z., &#38; Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">https://doi.org/10.1007/978-3-642-40041-4_4</a>"},"page":"57 - 74","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:56:21Z","_id":"2259","abstract":[{"lang":"eng","text":"The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:56:37Z","type":"conference","issue":"1","oa":1,"alternative_title":["LNCS"],"conference":{"end_date":"2013-08-22","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","start_date":"2013-08-18"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Learning with rounding, revisited: New reduction properties and applications","scopus_import":1,"year":"2013","intvolume":"      8042","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan","first_name":"Stephan","last_name":"Krenn","orcid":"0000-0003-2835-9093"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"month":"01","doi":"10.1007/978-3-642-40041-4_4","pubrep_id":"684","file_date_updated":"2020-07-14T12:45:35Z","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"publist_id":"4687","ec_funded":1,"volume":8042,"series_title":"Lecture Notes in Computer Science","publisher":"Springer","publication_status":"published","day":"01","status":"public","file":[{"file_id":"4912","date_created":"2018-12-12T10:11:55Z","relation":"main_file","access_level":"open_access","file_name":"IST-2016-684-v1+1_098.pdf","file_size":587898,"checksum":"16d428408a806b8e49eecc607deab115","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","creator":"system"}],"quality_controlled":"1","ddc":["000","004"]},{"month":"06","doi":"10.1007/978-3-642-38980-1_33","publist_id":"4686","main_file_link":[{"url":"http://eprint.iacr.org/2012/475","open_access":"1"}],"series_title":"Lecture Notes in Computer Science","volume":7954,"publication_status":"published","publisher":"Springer","status":"public","day":"01","quality_controlled":"1","abstract":[{"text":"Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.\r\n","lang":"eng"}],"_id":"2260","date_updated":"2020-08-11T10:09:44Z","department":[{"_id":"KrPi"}],"date_published":"2013-06-01T00:00:00Z","page":"518 - 533","citation":{"mla":"Bernhard, David, et al. <i>Efficient Signatures of Knowledge and DAA in the Standard Model</i>. Vol. 7954, Springer, 2013, pp. 518–33, doi:<a href=\"https://doi.org/10.1007/978-3-642-38980-1_33\">10.1007/978-3-642-38980-1_33</a>.","short":"D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533.","apa":"Bernhard, D., Fuchsbauer, G., &#38; Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-642-38980-1_33\">https://doi.org/10.1007/978-3-642-38980-1_33</a>","ista":"Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge and DAA in the standard model. 7954, 518–533.","chicago":"Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38980-1_33\">https://doi.org/10.1007/978-3-642-38980-1_33</a>.","ama":"Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and DAA in the standard model. 2013;7954:518-533. doi:<a href=\"https://doi.org/10.1007/978-3-642-38980-1_33\">10.1007/978-3-642-38980-1_33</a>","ieee":"D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013."},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:37Z","type":"conference","oa":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Efficient signatures of knowledge and DAA in the standard model","conference":{"end_date":"2013-06-28","name":"ACNS: Applied Cryptography and Network Security","start_date":"2013-06-25","location":"Banff, AB, Canada"},"scopus_import":1,"year":"2013","intvolume":"      7954","author":[{"full_name":"Bernhard, David","last_name":"Bernhard","first_name":"David"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer"},{"first_name":"Essam","last_name":"Ghadafi","full_name":"Ghadafi, Essam"}]},{"external_id":{"pmid":["23293287"],"isi":["000313363500009"]},"quality_controlled":"1","pmid":1,"day":"01","status":"public","publisher":"Company of Biologists","publication_status":"published","publication":"Development","volume":140,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/"}],"publist_id":"4681","doi":"10.1242/dev.085621","month":"02","intvolume":"       140","author":[{"full_name":"Liang, Huixuan","last_name":"Liang","first_name":"Huixuan"},{"full_name":"Xiao, Guanxi","first_name":"Guanxi","last_name":"Xiao"},{"full_name":"Yin, Haifeng","first_name":"Haifeng","last_name":"Yin"},{"first_name":"Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"},{"first_name":"Jonathan","last_name":"Horowitz","full_name":"Horowitz, Jonathan"},{"full_name":"Ghashghaei, Troy","first_name":"Troy","last_name":"Ghashghaei"}],"year":"2013","article_processing_charge":"No","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Neural development is dependent on the function of specificity protein 2 in cell cycle progression","isi":1,"oa":1,"issue":"3","type":"journal_article","oa_version":"Submitted Version","date_created":"2018-12-11T11:56:39Z","language":[{"iso":"eng"}],"department":[{"_id":"SiHi"}],"citation":{"apa":"Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., &#38; Ghashghaei, T. (2013). Neural development is dependent on the function of specificity protein 2 in cell cycle progression. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.085621\">https://doi.org/10.1242/dev.085621</a>","short":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development 140 (2013) 552–561.","mla":"Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” <i>Development</i>, vol. 140, no. 3, Company of Biologists, 2013, pp. 552–61, doi:<a href=\"https://doi.org/10.1242/dev.085621\">10.1242/dev.085621</a>.","ama":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. <i>Development</i>. 2013;140(3):552-561. doi:<a href=\"https://doi.org/10.1242/dev.085621\">10.1242/dev.085621</a>","ieee":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei, “Neural development is dependent on the function of specificity protein 2 in cell cycle progression,” <i>Development</i>, vol. 140, no. 3. Company of Biologists, pp. 552–561, 2013.","chicago":"Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz, and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” <i>Development</i>. Company of Biologists, 2013. <a href=\"https://doi.org/10.1242/dev.085621\">https://doi.org/10.1242/dev.085621</a>.","ista":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 140(3), 552–561."},"date_published":"2013-02-01T00:00:00Z","page":"552 - 561","date_updated":"2025-09-29T14:29:19Z","_id":"2264","abstract":[{"lang":"eng","text":"Faithful progression through the cell cycle is crucial to the maintenance and developmental potential of stem cells. Here, we demonstrate that neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in two temporally and spatially distinct progenitor domains. Differential conditional deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal olfactory bulb progenitors disrupted transitions through G1, G2 and M phases, whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified by deletion of Sp2 using mosaic analysis with double markers, which clearly established that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly, conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis in the embryonic and postnatal brain."}]},{"doi":"DOI: 10.1111/cgf.12061","month":"05","date_published":"2013-05-06T00:00:00Z","citation":{"ista":"Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418.","chicago":"Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">https://doi.org/DOI: 10.1111/cgf.12061</a>.","ama":"Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. <i>Computer Graphics Forum</i>. 2013;32(124):409-418. doi:<a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">DOI: 10.1111/cgf.12061</a>","ieee":"T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” <i>Computer Graphics Forum</i>, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013.","mla":"Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” <i>Computer Graphics Forum</i>, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:<a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">DOI: 10.1111/cgf.12061</a>.","short":"T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418.","apa":"Auzinger, T., Wimmer, M., &#38; Jeschke, S. (2013). Analytic Visibility on the GPU. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">https://doi.org/DOI: 10.1111/cgf.12061</a>"},"page":"409 - 418","_id":"2269","date_updated":"2021-01-12T06:56:25Z","abstract":[{"text":"This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods.","lang":"eng"}],"issue":124,"type":"journal_article","date_created":"2018-12-11T11:56:40Z","publist_id":"4675","day":"06","status":"public","title":"Analytic Visibility on the GPU","publisher":"Wiley-Blackwell","publication_status":"published","publication":"Computer Graphics Forum","volume":32,"acknowledgement":"Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. ","author":[{"full_name":"Thomas Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger"},{"full_name":"Wimmer, Michael","last_name":"Wimmer","first_name":"Michael"},{"full_name":"Stefan Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Jeschke"}],"quality_controlled":0,"intvolume":"        32","extern":1,"year":"2013"},{"publisher":"AAAI Press","publication_status":"published","arxiv":1,"day":"31","conference":{"end_date":"2013-07-18","name":"AAAI: Conference on Artificial Intelligence","start_date":"2013-07-14","location":"Bellevue, WA, United States"},"title":"Optimal Coalition Structures in Cooperative Graph Games","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","article_processing_charge":"No","external_id":{"arxiv":["1108.5248"]},"author":[{"full_name":"Bachrach, Yoram","first_name":"Yoram","last_name":"Bachrach"},{"full_name":"Kohli, Pushmeet","last_name":"Kohli","first_name":"Pushmeet"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"last_name":"Zadimoghaddam","first_name":"Morteza","full_name":"Zadimoghaddam, Morteza"}],"quality_controlled":"1","month":"12","language":[{"iso":"eng"}],"date_published":"2013-12-31T00:00:00Z","department":[{"_id":"VlKo"}],"citation":{"chicago":"Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.","ista":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.","ieee":"Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.","ama":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.","apa":"Bachrach, Y., Kohli, P., Kolmogorov, V., &#38; Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.","short":"Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.","mla":"Bachrach, Yoram, et al. <i>Optimal Coalition Structures in Cooperative Graph Games</i>. AAAI Press, 2013, pp. 81–87."},"page":"81-87","abstract":[{"text":"Representation languages for coalitional games are a key research area in algorithmic game theory.   There is an inher-\r\nent tradeoff between how general a language is, allowing it to  capture  more  elaborate  games,  and  how  hard  it  is  computationally to optimize and solve such games.  One prominent  such  language  is  the  simple  yet  expressive\r\nWeighted Graph Games  (WGGs) representation (Deng  and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We  consider  the  problem  of  finding  the  optimal  coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We  show  that  finding  the  optimal  coalition  structure  is  not only hard for general graphs,  but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems.  We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs.","lang":"eng"}],"_id":"2270","date_updated":"2025-07-10T11:52:18Z","OA_type":"green","type":"conference","OA_place":"repository","publist_id":"4674","date_created":"2018-12-11T11:56:41Z","oa_version":"Preprint","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1108.5248","open_access":"1"}]},{"quality_controlled":"1","external_id":{"isi":["000381149500002"]},"status":"public","day":"01","volume":28,"publication":"ICML'13 Proceedings of the 30th International Conference on International","publication_status":"published","publisher":"ML Research Press","main_file_link":[{"url":"http://proceedings.mlr.press/v28/takhanov13.pdf?CFID=105472548&CFTOKEN=5c5859b5d97b4439-27B4AC58-BA92-A964-B598CAACEE6CC515","open_access":"1"}],"publist_id":"4672","corr_author":"1","month":"06","author":[{"id":"2CCAC26C-F248-11E8-B48F-1D18A9856A87","full_name":"Takhanov, Rustem","last_name":"Takhanov","first_name":"Rustem"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"intvolume":"        28","related_material":{"record":[{"status":"public","id":"1794","relation":"later_version"}]},"article_processing_charge":"No","year":"2013","title":"Inference algorithms for pattern-based CRFs on sequence data","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"start_date":"2013-06-16","location":"Atlanta, GA, USA","name":"ICML: International Conference on Machine Learning","end_date":"2013-06-21"},"scopus_import":"1","alternative_title":["JMLR"],"issue":"3","oa":1,"isi":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:41Z","type":"conference","abstract":[{"lang":"eng","text":"We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) x1...xn is the sum of terms over intervals [i,j] where each term is non-zero only if the substring xi...xj equals a prespecified pattern α. Such CRFs can be naturally applied to many sequence tagging problems.\r\nWe present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively O(nL), O(nLℓmax) and O(nLmin{|D|,log(ℓmax+1)}) where L is the combined length of input patterns, ℓmax is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of (Ye et al., 2009) whose complexities are respectively O(nL|D|), O(n|Γ|L2ℓ2max) and O(nL|D|), where |Γ| is the number of input patterns.\r\nIn addition, we give an efficient algorithm for sampling. Finally, we consider the case of non-positive weights. (Komodakis &amp; Paragios, 2009) gave an O(nL) algorithm for computing the MAP. We present a modification that has the same worst-case complexity but can beat it in the best case. "}],"_id":"2272","date_updated":"2025-09-29T14:28:48Z","department":[{"_id":"VlKo"}],"citation":{"mla":"Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>ICML’13 Proceedings of the 30th International Conference on International</i>, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.","short":"R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, ML Research Press, 2013, pp. 145–153.","apa":"Takhanov, R., &#38; Kolmogorov, V. (2013). Inference algorithms for pattern-based CRFs on sequence data. In <i>ICML’13 Proceedings of the 30th International Conference on International</i> (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.","ista":"Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs on sequence data. ICML’13 Proceedings of the 30th International Conference on International. ICML: International Conference on Machine Learning, JMLR, vol. 28, 145–153.","chicago":"Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” In <i>ICML’13 Proceedings of the 30th International Conference on International</i>, 28:145–53. ML Research Press, 2013.","ama":"Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence data. In: <i>ICML’13 Proceedings of the 30th International Conference on International</i>. Vol 28. ML Research Press; 2013:145-153.","ieee":"R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in <i>ICML’13 Proceedings of the 30th International Conference on International</i>, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153."},"date_published":"2013-06-01T00:00:00Z","page":"145 - 153","language":[{"iso":"eng"}]},{"publisher":"IST Austria","publication_status":"draft","arxiv":1,"day":"22","title":"Reweighted message passing revisited","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","year":"2013","article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"1841","relation":"later_version"}]},"external_id":{"arxiv":["1309.5655"]},"author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"month":"09","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}],"date_published":"2013-09-22T00:00:00Z","citation":{"ista":"Kolmogorov V. Reweighted message passing revisited, IST Austria,p.","chicago":"Kolmogorov, Vladimir. <i>Reweighted Message Passing Revisited</i>. IST Austria, n.d.","ama":"Kolmogorov V. <i>Reweighted Message Passing Revisited</i>. IST Austria","ieee":"V. Kolmogorov, <i>Reweighted message passing revisited</i>. IST Austria.","short":"V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, n.d.","mla":"Kolmogorov, Vladimir. <i>Reweighted Message Passing Revisited</i>. IST Austria.","apa":"Kolmogorov, V. (n.d.). <i>Reweighted message passing revisited</i>. IST Austria."},"_id":"2273","date_updated":"2025-09-22T14:33:14Z","abstract":[{"lang":"eng","text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a  decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results."}],"type":"report","OA_place":"repository","corr_author":"1","date_created":"2018-12-11T11:56:42Z","oa_version":"Preprint","publist_id":"4671","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}]},{"oa":1,"type":"report","oa_version":"Published Version","date_created":"2018-12-11T11:56:42Z","publist_id":"4670","file_date_updated":"2020-07-14T12:45:36Z","pubrep_id":"671","language":[{"iso":"eng"}],"month":"11","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto'92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system.\r\n\r\nIn this work, we put forward an alternative concept for PoWs -- so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model, using graphs with high &quot;pebbling complexity&quot; and Merkle hash-trees. "}],"_id":"2274","date_updated":"2025-09-23T09:55:25Z","department":[{"_id":"VlKo"},{"_id":"KrPi"}],"citation":{"short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.","mla":"Dziembowski, Stefan, et al. <i>Proofs of Space</i>. IST Austria, 2013.","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., &#38; Pietrzak, K. Z. (2013). <i>Proofs of Space</i>. IST Austria.","ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. <i>Proofs of Space</i>. IST Austria; 2013.","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, <i>Proofs of Space</i>. IST Austria, 2013.","ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. <i>Proofs of Space</i>. IST Austria, 2013."},"date_published":"2013-11-28T00:00:00Z","ddc":["530"],"related_material":{"record":[{"id":"1675","status":"public","relation":"later_version"}]},"author":[{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"year":"2013","scopus_import":1,"file":[{"checksum":"37b61637b62fc079d9141c59d9f1a94f","content_type":"application/pdf","date_updated":"2020-07-14T12:45:36Z","creator":"system","access_level":"open_access","file_name":"IST-2016-671-v1+1_796.pdf","file_size":405870,"relation":"main_file","date_created":"2018-12-12T10:16:11Z","file_id":"5197"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Proofs of Space","status":"public","day":"28","publication_status":"published","publisher":"IST Austria"},{"title":"Potts model, parametric maxflow and k-submodular functions","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"start_date":"2013-12-01","location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision","end_date":"2013-12-08"},"scopus_import":"1","author":[{"last_name":"Gridchyn","orcid":"0000-0002-1807-1929","first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","full_name":"Gridchyn, Igor"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"article_processing_charge":"No","year":"2013","_id":"2276","abstract":[{"text":"The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions.","lang":"eng"}],"date_updated":"2025-09-29T14:27:49Z","date_published":"2013-12-01T00:00:00Z","citation":{"apa":"Gridchyn, I., &#38; Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.288\">https://doi.org/10.1109/ICCV.2013.288</a>","mla":"Gridchyn, Igor, and Vladimir Kolmogorov. <i>Potts Model, Parametric Maxflow and k-Submodular Functions</i>. IEEE, 2013, pp. 2320–27, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.288\">10.1109/ICCV.2013.288</a>.","short":"I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.","ama":"Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.288\">10.1109/ICCV.2013.288</a>","ieee":"I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.","chicago":"Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.288\">https://doi.org/10.1109/ICCV.2013.288</a>.","ista":"Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327."},"page":"2320 - 2327","department":[{"_id":"JoCs"},{"_id":"VlKo"}],"language":[{"iso":"eng"}],"isi":1,"oa":1,"date_created":"2018-12-11T11:56:43Z","oa_version":"Preprint","type":"conference","status":"public","day":"01","arxiv":1,"publication_status":"published","publisher":"IEEE","quality_controlled":"1","external_id":{"arxiv":["1310.1771"],"isi":["000351830500290"]},"doi":"10.1109/ICCV.2013.288","month":"12","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.1771"}],"publist_id":"4668","corr_author":"1"},{"oa":1,"isi":1,"issue":"12","type":"journal_article","article_number":"e1003344","oa_version":"Published Version","date_created":"2018-12-11T11:56:43Z","has_accepted_license":"1","language":[{"iso":"eng"}],"citation":{"apa":"Simmons, K., Prentice, J., Tkačik, G., Homann, J., Yee, H., Palmer, S., … Balasubramanian, V. (2013). Transformation of stimulus correlations by the retina. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">https://doi.org/10.1371/journal.pcbi.1003344</a>","short":"K. Simmons, J. Prentice, G. Tkačik, J. Homann, H. Yee, S. Palmer, P. Nelson, V. Balasubramanian, PLoS Computational Biology 9 (2013).","mla":"Simmons, Kristina, et al. “Transformation of Stimulus Correlations by the Retina.” <i>PLoS Computational Biology</i>, vol. 9, no. 12, e1003344, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">10.1371/journal.pcbi.1003344</a>.","chicago":"Simmons, Kristina, Jason Prentice, Gašper Tkačik, Jan Homann, Heather Yee, Stephanie Palmer, Philip Nelson, and Vijay Balasubramanian. “Transformation of Stimulus Correlations by the Retina.” <i>PLoS Computational Biology</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">https://doi.org/10.1371/journal.pcbi.1003344</a>.","ista":"Simmons K, Prentice J, Tkačik G, Homann J, Yee H, Palmer S, Nelson P, Balasubramanian V. 2013. Transformation of stimulus correlations by the retina. PLoS Computational Biology. 9(12), e1003344.","ama":"Simmons K, Prentice J, Tkačik G, et al. Transformation of stimulus correlations by the retina. <i>PLoS Computational Biology</i>. 2013;9(12). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">10.1371/journal.pcbi.1003344</a>","ieee":"K. Simmons <i>et al.</i>, “Transformation of stimulus correlations by the retina,” <i>PLoS Computational Biology</i>, vol. 9, no. 12. Public Library of Science, 2013."},"department":[{"_id":"GaTk"}],"date_published":"2013-12-05T00:00:00Z","_id":"2277","abstract":[{"lang":"eng","text":"Redundancies and correlations in the responses of sensory neurons may seem to waste neural resources, but they can also carry cues about structured stimuli and may help the brain to correct for response errors. To investigate the effect of stimulus structure on redundancy in retina, we measured simultaneous responses from populations of retinal ganglion cells presented with natural and artificial stimuli that varied greatly in correlation structure; these stimuli and recordings are publicly available online. Responding to spatio-temporally structured stimuli such as natural movies, pairs of ganglion cells were modestly more correlated than in response to white noise checkerboards, but they were much less correlated than predicted by a non-adapting functional model of retinal response. Meanwhile, responding to stimuli with purely spatial correlations, pairs of ganglion cells showed increased correlations consistent with a static, non-adapting receptive field and nonlinearity. We found that in response to spatio-temporally correlated stimuli, ganglion cells had faster temporal kernels and tended to have stronger surrounds. These properties of individual cells, along with gain changes that opposed changes in effective contrast at the ganglion cell input, largely explained the pattern of pairwise correlations across stimuli where receptive field measurements were possible."}],"date_updated":"2025-09-29T14:27:23Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"9752"}]},"author":[{"full_name":"Simmons, Kristina","first_name":"Kristina","last_name":"Simmons"},{"full_name":"Prentice, Jason","first_name":"Jason","last_name":"Prentice"},{"orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"},{"last_name":"Homann","first_name":"Jan","full_name":"Homann, Jan"},{"full_name":"Yee, Heather","first_name":"Heather","last_name":"Yee"},{"full_name":"Palmer, Stephanie","first_name":"Stephanie","last_name":"Palmer"},{"full_name":"Nelson, Philip","first_name":"Philip","last_name":"Nelson"},{"full_name":"Balasubramanian, Vijay","last_name":"Balasubramanian","first_name":"Vijay"}],"intvolume":"         9","year":"2013","article_processing_charge":"No","scopus_import":"1","title":"Transformation of stimulus correlations by the retina","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4667","doi":"10.1371/journal.pcbi.1003344","file_date_updated":"2020-07-14T12:45:36Z","pubrep_id":"410","month":"12","external_id":{"isi":["000329364800028"]},"ddc":["570"],"quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:45:36Z","creator":"system","content_type":"application/pdf","checksum":"46722afc4f7eabb0831165d9c1b171ad","file_size":3115568,"access_level":"open_access","file_name":"IST-2016-410-v1+1_journal.pcbi.1003344.pdf","relation":"main_file","date_created":"2018-12-12T10:14:36Z","file_id":"5089"}],"day":"05","status":"public","publisher":"Public Library of Science","publication_status":"published","publication":"PLoS Computational Biology","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)"},"volume":9},{"month":"11","doi":"10.1242/jcs.125617","publist_id":"4658","publication_status":"published","publisher":"Company of Biologists","volume":126,"publication":"Journal of Cell Science","status":"public","day":"01","external_id":{"isi":["000326392500009"]},"quality_controlled":"1","language":[{"iso":"eng"}],"_id":"2278","date_updated":"2025-09-29T14:26:53Z","abstract":[{"text":"It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling.","lang":"eng"}],"page":"4873 - 4884","department":[{"_id":"CaHe"}],"date_published":"2013-11-01T00:00:00Z","citation":{"apa":"Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., &#38; Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.125617\">https://doi.org/10.1242/jcs.125617</a>","mla":"Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” <i>Journal of Cell Science</i>, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:<a href=\"https://doi.org/10.1242/jcs.125617\">10.1242/jcs.125617</a>.","short":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884.","ieee":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” <i>Journal of Cell Science</i>, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013.","ama":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. <i>Journal of Cell Science</i>. 2013;126(21):4873-4884. doi:<a href=\"https://doi.org/10.1242/jcs.125617\">10.1242/jcs.125617</a>","chicago":"Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” <i>Journal of Cell Science</i>. Company of Biologists, 2013. <a href=\"https://doi.org/10.1242/jcs.125617\">https://doi.org/10.1242/jcs.125617</a>.","ista":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884."},"type":"journal_article","date_created":"2018-12-11T11:56:43Z","oa_version":"None","isi":1,"issue":"21","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development","article_processing_charge":"No","year":"2013","intvolume":"       126","author":[{"last_name":"Pérez Gómez","first_name":"Raquel","full_name":"Pérez Gómez, Raquel"},{"id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","full_name":"Slovakova, Jana","first_name":"Jana","last_name":"Slovakova"},{"full_name":"Rives Quinto, Noemí","last_name":"Rives Quinto","first_name":"Noemí"},{"first_name":"Alena","last_name":"Krejčí","full_name":"Krejčí, Alena"},{"full_name":"Carmena, Ana","last_name":"Carmena","first_name":"Ana"}]},{"main_file_link":[{"url":"http://arxiv.org/abs/1302.4248","open_access":"1"}],"ec_funded":1,"publist_id":"4656","doi":"10.1007/978-3-319-02444-8_10","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"month":"01","quality_controlled":"1","acknowledgement":"279307; ERC; Fonds National de la Reserche Luxembourg;  279499; ERC; Fonds National de la Reserche Luxembourg","external_id":{"arxiv":["1302.4248"]},"status":"public","day":"01","arxiv":1,"series_title":"Lecture Notes in Computer Science","volume":8172,"publication_status":"published","publisher":"Springer","oa":1,"oa_version":"Preprint","date_created":"2018-12-11T11:56:44Z","type":"conference","_id":"2279","date_updated":"2025-09-23T09:29:54Z","abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"date_published":"2013-01-01T00:00:00Z","citation":{"ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. 2013;8172:118-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.","mla":"Chatterjee, Krishnendu, et al. <i>Looking at Mean-Payoff and Total-Payoff through Windows</i>. Vol. 8172, Springer, 2013, pp. 118–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>"},"page":"118 - 132","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"intvolume":"      8172","related_material":{"record":[{"status":"public","id":"523","relation":"later_version"}]},"article_processing_charge":"No","year":"2013","title":"Looking at mean-payoff and total-payoff through windows","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2013-10-15","location":"Hanoi, Vietnam","end_date":"2013-10-18","name":"ATVA: Automated Technology for Verification and Analysis"},"scopus_import":"1","alternative_title":["LNCS"]},{"year":"2013","article_processing_charge":"No","author":[{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler"},{"full_name":"Wright, Stephen","first_name":"Stephen","last_name":"Wright"}],"intvolume":"        55","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Packing ellipsoids with overlap","type":"journal_article","date_created":"2018-12-11T11:56:44Z","oa_version":"Preprint","isi":1,"oa":1,"issue":"4","language":[{"iso":"eng"}],"department":[{"_id":"CaUh"}],"date_published":"2013-11-07T00:00:00Z","citation":{"chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>.","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” <i>SIAM Review</i>, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. <i>SIAM Review</i>. 2013;55(4):671-706. doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>","apa":"Uhler, C., &#38; Wright, S. (2013). Packing ellipsoids with overlap. <i>SIAM Review</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706."},"page":"671 - 706","abstract":[{"lang":"eng","text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented."}],"_id":"2280","date_updated":"2025-09-29T14:26:18Z","external_id":{"arxiv":["1204.0235"],"isi":["000327502800002"]},"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics ","publication_status":"published","publication":"SIAM Review","volume":55,"arxiv":1,"day":"07","status":"public","publist_id":"4655","main_file_link":[{"url":"http://arxiv.org/abs/1204.0235","open_access":"1"}],"month":"11","doi":"10.1137/120872309"},{"citation":{"apa":"Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., &#38; Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb2869\">https://doi.org/10.1038/ncb2869</a>","mla":"Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” <i>Nature Cell Biology</i>, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:<a href=\"https://doi.org/10.1038/ncb2869\">10.1038/ncb2869</a>.","short":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414.","ama":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. <i>Nature Cell Biology</i>. 2013;15:1405-1414. doi:<a href=\"https://doi.org/10.1038/ncb2869\">10.1038/ncb2869</a>","ieee":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” <i>Nature Cell Biology</i>, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013.","chicago":"Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/ncb2869\">https://doi.org/10.1038/ncb2869</a>.","ista":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414."},"department":[{"_id":"CaHe"}],"date_published":"2013-11-10T00:00:00Z","page":"1405 - 1414","date_updated":"2026-03-09T14:56:18Z","_id":"2282","abstract":[{"lang":"eng","text":"Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly."}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"isi":1,"oa":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:45Z","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly","scopus_import":"1","intvolume":"        15","author":[{"full_name":"Campinho, Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro","orcid":"0000-0002-8526-5416","last_name":"Campinho"},{"last_name":"Behrndt","first_name":"Martin","full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ranft","first_name":"Jonas","full_name":"Ranft, Jonas"},{"full_name":"Risler, Thomas","last_name":"Risler","first_name":"Thomas"},{"full_name":"Minc, Nicolas","last_name":"Minc","first_name":"Nicolas"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"related_material":{"record":[{"id":"1403","status":"public","relation":"dissertation_contains"}]},"year":"2013","article_processing_charge":"No","doi":"10.1038/ncb2869","project":[{"_id":"252ABD0A-B435-11E9-9278-68D0E5697425","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","grant_number":"I930-B20","call_identifier":"FWF"}],"month":"11","main_file_link":[{"url":"http://hal.upmc.fr/hal-00983313/","open_access":"1"}],"publist_id":"4652","corr_author":"1","day":"10","status":"public","publication":"Nature Cell Biology","volume":15,"publisher":"Nature Publishing Group","publication_status":"published","quality_controlled":"1","external_id":{"isi":["000327944200005"]},"acknowledgement":"This work was supported by the IST Austria and MPI-CBG "},{"title":"Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","article_processing_charge":"No","year":"2013","intvolume":"       100","author":[{"first_name":"Christopher","orcid":"0000-0003-1122-3982","last_name":"Pull","full_name":"Pull, Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"first_name":"William","last_name":"Hughes","full_name":"Hughes, William"},{"last_name":"Brown","first_name":"Markus","full_name":"Brown, Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87"}],"_id":"2283","abstract":[{"text":"Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success.","lang":"eng"}],"date_updated":"2025-09-29T14:24:42Z","department":[{"_id":"SyCr"}],"date_published":"2013-11-14T00:00:00Z","page":"1125  - 1136","citation":{"ama":"Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . <i>Naturwissenschaften</i>. 2013;100(12):1125-1136. doi:<a href=\"https://doi.org/10.1007/s00114-013-1115-5\">10.1007/s00114-013-1115-5</a>","ieee":"C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” <i>Naturwissenschaften</i>, vol. 100, no. 12. Springer, pp. 1125–1136, 2013.","ista":"Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.","chicago":"Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” <i>Naturwissenschaften</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00114-013-1115-5\">https://doi.org/10.1007/s00114-013-1115-5</a>.","short":"C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136.","mla":"Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” <i>Naturwissenschaften</i>, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:<a href=\"https://doi.org/10.1007/s00114-013-1115-5\">10.1007/s00114-013-1115-5</a>.","apa":"Pull, C., Hughes, W., &#38; Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . <i>Naturwissenschaften</i>. Springer. <a href=\"https://doi.org/10.1007/s00114-013-1115-5\">https://doi.org/10.1007/s00114-013-1115-5</a>"},"language":[{"iso":"eng"}],"oa_version":"None","date_created":"2018-12-11T11:56:45Z","type":"journal_article","issue":"12","isi":1,"volume":100,"publication":"Naturwissenschaften","publication_status":"published","publisher":"Springer","status":"public","day":"14","quality_controlled":"1","external_id":{"isi":["000328850200004"]},"month":"11","doi":"10.1007/s00114-013-1115-5","publist_id":"4649","corr_author":"1"}]