[{"issue":"4","acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","publication_identifier":{"issn":["0018-9286"]},"title":"Optimal Kullback-Leibler aggregation via information bottleneck","page":"1010 - 1022","fulldoi":"https://doi.org/10.1109/TAC.2014.2364971","publication":"IEEE Transactions on Automatic Control","author":[{"full_name":"Geiger, Bernhard","first_name":"Bernhard","last_name":"Geiger"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana","orcid":"0000-0002-9041-0905"},{"last_name":"Kubin","full_name":"Kubin, Gernot","first_name":"Gernot"},{"last_name":"Koeppl","full_name":"Koeppl, Heinz","first_name":"Heinz"}],"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"year":"2015","citation":{"short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","apa":"Geiger, B., Petrov, T., Kubin, G., &#38; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. IEEE. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>","mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>.","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. 2015;60(4):1010-1022. doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.","chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>."},"volume":60,"publisher":"IEEE","date_updated":"2025-09-23T09:45:33Z","doi":"10.1109/TAC.2014.2364971","external_id":{"isi":["000351731600009"],"arxiv":["1304.6603"]},"scopus_import":"1","arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.6603","open_access":"1"}],"month":"04","intvolume":"        60","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:18Z","_id":"1840","day":"01","type":"journal_article","quality_controlled":"1","oa":1,"publist_id":"5262","language":[{"iso":"eng"}],"oa_version":"Preprint","article_processing_charge":"No","isi":1,"abstract":[{"text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions.","lang":"eng"}],"status":"public","publication_status":"published","date_published":"2015-04-01T00:00:00Z"},{"OA_place":"repository","department":[{"_id":"VlKo"}],"citation":{"ieee":"V. Kolmogorov, “A new look at reweighted message passing,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>.","ama":"Kolmogorov V. A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(5):919-930. doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.","mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>.","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>","short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930."},"year":"2015","publisher":"IEEE","volume":37,"date_updated":"2025-09-22T14:33:14Z","doi":"10.1109/TPAMI.2014.2363465","external_id":{"arxiv":["1309.5655"],"isi":["000352533000002"]},"scopus_import":"1","ec_funded":1,"issue":"5","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2273"}]},"title":"A new look at reweighted message passing","page":"919 - 930","fulldoi":"https://doi.org/10.1109/TPAMI.2014.2363465","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","author":[{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"publist_id":"5261","language":[{"iso":"eng"}],"article_type":"original","oa_version":"Preprint","article_processing_charge":"No","isi":1,"status":"public","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 Diffusion (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. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results."}],"publication_status":"published","date_published":"2015-05-01T00:00:00Z","OA_type":"green","arxiv":1,"month":"05","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"intvolume":"        37","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:18Z","type":"journal_article","_id":"1841","day":"01","quality_controlled":"1","corr_author":"1","oa":1},{"volume":17,"publisher":"EMS Press","department":[{"_id":"LaEr"}],"year":"2015","citation":{"mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, EMS Press, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>.","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. EMS Press, pp. 1927–2036, 2015.","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>.","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036.","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>"},"scopus_import":"1","date_updated":"2026-07-06T11:55:30Z","doi":"10.4171/JEMS/548","external_id":{"isi":["000360822900003"],"arxiv":["1211.3786"]},"issue":"8","das_tickbox":"1","title":"Gap universality of generalized Wigner and β ensembles","page":"1927 - 2036","publication":"Journal of the European Mathematical Society","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"last_name":"Yau","first_name":"Horng","full_name":"Yau, Horng"}],"fulldoi":"https://doi.org/10.4171/JEMS/548","publist_id":"5669","language":[{"iso":"eng"}],"oa_version":"Preprint","status":"public","abstract":[{"lang":"eng","text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential."}],"publication_status":"published","date_published":"2015-08-01T00:00:00Z","article_processing_charge":"No","isi":1,"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:26Z","main_file_link":[{"url":"http://arxiv.org/abs/1211.3786","open_access":"1"}],"month":"08","intvolume":"        17","quality_controlled":"1","_id":"1508","type":"journal_article","day":"01","oa":1},{"quality_controlled":"1","corr_author":"1","_id":"1832","type":"journal_article","day":"01","oa":1,"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:15Z","month":"04","intvolume":"        11","oa_version":"Published Version","status":"public","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. "}],"has_accepted_license":"1","publication_status":"published","date_published":"2015-04-01T00:00:00Z","article_processing_charge":"No","isi":1,"article_number":"20","publist_id":"5271","article_type":"original","language":[{"iso":"eng"}],"title":"Aspect-oriented linearizability proofs","author":[{"full_name":"Chakraborty, Soham","first_name":"Soham","last_name":"Chakraborty"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Ali","full_name":"Sezgin, Ali","last_name":"Sezgin"},{"last_name":"Vafeiadis","first_name":"Viktor","full_name":"Vafeiadis, Viktor"}],"publication":"Logical Methods in Computer Science","file":[{"content_type":"application/pdf","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:45:17Z","file_id":"4881","checksum":"7370e164d0a731f442424a92669efc34","access_level":"open_access","file_size":380203,"date_created":"2018-12-12T10:11:27Z","file_name":"IST-2015-390-v1+1_1502.07639.pdf"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"fulldoi":"https://doi.org/10.2168/LMCS-11(1:20)2015","ddc":["000"],"pubrep_id":"390","license":"https://creativecommons.org/licenses/by-nd/4.0/","issue":"1","file_date_updated":"2020-07-14T12:45:17Z","related_material":{"record":[{"status":"public","id":"2328","relation":"earlier_version"}]},"das_tickbox":"1","scopus_import":"1","doi":"10.2168/LMCS-11(1:20)2015","date_updated":"2026-07-06T13:24:05Z","external_id":{"isi":["000353193000019"]},"ec_funded":1,"publisher":"International Federation for Computational Logic","volume":11,"department":[{"_id":"ToHe"}],"citation":{"chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation for Computational Logic, 2015.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation for Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015)."},"year":"2015"},{"day":"01","_id":"1610","type":"conference","quality_controlled":"1","oa":1,"OA_type":"green","arxiv":1,"month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1504.08259","open_access":"1"}],"intvolume":"      9135","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:01Z","oa_version":"Preprint","article_processing_charge":"No","isi":1,"publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k."}],"date_published":"2015-07-01T00:00:00Z","publist_id":"5556","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"title":"Edit distance for pushdown automata","page":"121 - 133","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"fulldoi":"https://doi.org/10.1007/978-3-662-47666-6_10","conference":{"start_date":"2015-07-06","end_date":"2015-07-10","name":"ICALP: Automata, Languages and Programming","location":"Kyoto, Japan"},"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publication":"42nd International Colloquium on Automata, Languages, and Programming","issue":"Part II","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and MSR faculty fellows award.","pubrep_id":"321","publication_identifier":{"isbn":["978-3-662-47665-9"]},"related_material":{"record":[{"id":"5438","status":"public","relation":"earlier_version"},{"relation":"later_version","id":"465","status":"public"}]},"doi":"10.1007/978-3-662-47666-6_10","date_updated":"2026-07-06T13:27:53Z","external_id":{"isi":["000364317900010"],"arxiv":["1504.08259"]},"scopus_import":"1","ec_funded":1,"OA_place":"repository","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in <i>42nd International Colloquium on Automata, Languages, and Programming</i>, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: <i>42nd International Colloquium on Automata, Languages, and Programming</i>. Vol 9135. Springer Nature; 2015:121-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In <i>42nd International Colloquium on Automata, Languages, and Programming</i>, 9135:121–33. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). Edit distance for pushdown automata. In <i>42nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp. 121–133.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>42nd International Colloquium on Automata, Languages, and Programming</i>, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>."},"year":"2015","volume":9135,"publisher":"Springer Nature"},{"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","page":"244 - 256","fulldoi":"https://doi.org/10.1109/LICS.2015.32","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"conference":{"end_date":"2015-07-10","name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan"},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Komárková, Zuzana","first_name":"Zuzana","last_name":"Komárková"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","full_name":"Kretinsky, Jan"}],"acknowledgement":"A Technical Report of this paper is available at DOI: 10.15479/AT:IST-2015-318-v1-1\r\n","related_material":{"record":[{"relation":"earlier_version","id":"5429","status":"public"},{"id":"5435","status":"public","relation":"earlier_version"},{"status":"public","id":"466","relation":"later_version"}]},"doi":"10.1109/LICS.2015.32","date_updated":"2026-07-06T13:26:26Z","external_id":{"isi":["000380427100024"]},"scopus_import":"1","ec_funded":1,"OA_place":"repository","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2015","citation":{"short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","apa":"Chatterjee, K., Komárková, Z., &#38; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IEEE, 2015, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>.","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015."},"publisher":"IEEE","_id":"1657","day":"01","type":"conference","quality_controlled":"1","oa":1,"OA_type":"green","series_title":"LICS","month":"07","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:18Z","oa_version":"Preprint","article_processing_charge":"No","isi":1,"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"status":"public","publication_status":"published","date_published":"2015-07-01T00:00:00Z","publist_id":"5493","language":[{"iso":"eng"}],"alternative_title":["LICS"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:19Z","month":"02","_id":"5435","type":"technical_report","day":"23","oa":1,"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","date_published":"2015-02-23T00:00:00Z","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}],"status":"public","publication_status":"published","has_accepted_license":"1","pubrep_id":"327","ddc":["004"],"file_date_updated":"2020-07-14T12:46:53Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5429"},{"relation":"later_version","id":"1657","status":"public"},{"status":"public","id":"466","relation":"later_version"}]},"publication_identifier":{"issn":["2664-1690"]},"page":"51","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Komarkova","full_name":"Komarkova, Zuzana","first_name":"Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"}],"fulldoi":"https://doi.org/10.15479/AT:IST-2015-318-v2-1","file":[{"file_id":"5525","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:53Z","content_type":"application/pdf","checksum":"75284adec80baabdfe71ff9ebbc27445","access_level":"open_access","file_size":717630,"file_name":"IST-2015-318-v2+1_main.pdf","date_created":"2018-12-12T11:54:03Z"}],"publisher":"IST Austria","citation":{"ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015."},"year":"2015","department":[{"_id":"KrCh"}],"doi":"10.15479/AT:IST-2015-318-v2-1","date_updated":"2026-07-06T13:26:26Z"},{"file_date_updated":"2020-07-14T12:46:52Z","ddc":["004"],"pubrep_id":"318","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"relation":"later_version","id":"5435","status":"public"},{"relation":"later_version","id":"1657","status":"public"},{"status":"public","id":"466","relation":"later_version"}]},"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","page":"41","file":[{"access_level":"open_access","checksum":"e4869a584567c506349abda9c8ec7db3","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:52Z","file_id":"5533","relation":"main_file","date_created":"2018-12-12T11:54:11Z","file_name":"IST-2015-318-v1+1_main.pdf","file_size":689863}],"fulldoi":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Komarkova","full_name":"Komarkova, Zuzana","first_name":"Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"}],"department":[{"_id":"KrCh"}],"year":"2015","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015."},"publisher":"IST Austria","doi":"10.15479/AT:IST-2015-318-v1-1","date_updated":"2026-07-06T13:26:26Z","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:17Z","type":"technical_report","_id":"5429","day":"12","oa":1,"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}],"status":"public","publication_status":"published","has_accepted_license":"1","date_published":"2015-01-12T00:00:00Z"},{"alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"date_published":"2015-05-05T00:00:00Z","status":"public","publication_status":"published","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. "}],"oa_version":"Published Version","month":"05","date_created":"2018-12-12T11:39:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"_id":"5438","day":"05","type":"technical_report","citation":{"short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). <i>Edit distance for pushdown automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">https://doi.org/10.15479/AT:IST-2015-334-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Pushdown Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">10.15479/AT:IST-2015-334-v1-1</a>.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. <i>Edit Distance for Pushdown Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">10.15479/AT:IST-2015-334-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. <i>Edit Distance for Pushdown Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">https://doi.org/10.15479/AT:IST-2015-334-v1-1</a>.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, <i>Edit distance for pushdown automata</i>. IST Austria, 2015."},"year":"2015","department":[{"_id":"KrCh"}],"publisher":"IST Austria","doi":"10.15479/AT:IST-2015-334-v1-1","date_updated":"2026-07-06T13:27:53Z","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"relation":"later_version","status":"public","id":"1610"},{"status":"public","id":"465","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:46:55Z","ddc":["004"],"pubrep_id":"334","fulldoi":"https://doi.org/10.15479/AT:IST-2015-334-v1-1","file":[{"file_size":422573,"date_created":"2018-12-12T11:53:56Z","file_name":"IST-2015-334-v1+1_report.pdf","checksum":"8a5f2d77560e552af87eb1982437a43b","creator":"system","date_updated":"2020-07-14T12:46:55Z","file_id":"5518","relation":"main_file","content_type":"application/pdf","access_level":"open_access"}],"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"}],"page":"15","title":"Edit distance for pushdown automata"},{"related_material":{"record":[{"id":"464","status":"public","relation":"later_version"}]},"acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","fulldoi":"https://doi.org/10.1109/LICS.2015.34","conference":{"location":"Kyoto, Japan","start_date":"2015-07-06","name":"LICS: Logic in Computer Science","end_date":"2015-07-10"},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"publication":"Proceedings - Symposium on Logic in Computer Science","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"title":"Improved algorithms for one-pair and k-pair Streett objectives","department":[{"_id":"KrCh"}],"year":"2015","citation":{"ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in <i>Proceedings - Symposium on Logic in Computer Science</i>, Kyoto, Japan, 2015, vol. 2015–July.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: <i>Proceedings - Symposium on Logic in Computer Science</i>. Vol 2015-July. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In <i>Proceedings - Symposium on Logic in Computer Science</i>, Vol. 2015–July. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>.","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","apa":"Chatterjee, K., Henzinger, M., &#38; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In <i>Proceedings - Symposium on Logic in Computer Science</i> (Vol. 2015–July). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” <i>Proceedings - Symposium on Logic in Computer Science</i>, vol. 2015–July, 7174888, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>."},"volume":"2015-July","publisher":"IEEE","ec_funded":1,"doi":"10.1109/LICS.2015.34","date_updated":"2026-07-06T13:28:05Z","external_id":{"isi":["000380427100026"]},"scopus_import":"1","month":"07","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:19Z","oa":1,"type":"conference","_id":"1661","day":"01","quality_controlled":"1","publist_id":"5489","language":[{"iso":"eng"}],"article_number":"7174888","article_processing_charge":"No","isi":1,"abstract":[{"lang":"eng","text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years."}],"status":"public","publication_status":"published","date_published":"2015-07-01T00:00:00Z","oa_version":"Submitted Version"},{"quality_controlled":"1","_id":"1566","day":"23","type":"journal_article","oa":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_created":"2018-12-11T11:52:45Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        11","month":"10","oa_version":"Published Version","date_published":"2015-10-23T00:00:00Z","has_accepted_license":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Deposits of misfolded proteins in the human brain are associated with the development of many neurodegenerative diseases. Recent studies show that these proteins have common traits even at the monomer level. Among them, a polyglutamine region that is present in huntingtin is known to exhibit a correlation between the length of the chain and the severity as well as the earliness of the onset of Huntington disease. Here, we apply bias exchange molecular dynamics to generate structures of polyglutamine expansions of several lengths and characterize the resulting independent conformations. We compare the properties of these conformations to those of the standard proteins, as well as to other homopolymeric tracts. We find that, similar to the previously studied polyvaline chains, the set of possible transient folds is much broader than the set of known-to-date folds, although the conformations have different structures. We show that the mechanical stability is not related to any simple geometrical characteristics of the structures. We demonstrate that long polyglutamine expansions result in higher mechanical stability than the shorter ones. They also have a longer life span and are substantially more prone to form knotted structures. The knotted region has an average length of 35 residues, similar to the typical threshold for most polyglutamine-related diseases. Similarly, changes in shape and mechanical stability appear once the total length of the peptide exceeds this threshold of 35 glutamine residues. We suggest that knotted conformers may also harm the cellular machinery and thus lead to disease."}],"status":"public","isi":1,"article_processing_charge":"No","article_number":"e1004541","language":[{"iso":"eng"}],"publist_id":"5605","title":"An exploration of the universe of polyglutamine structures","publication":"PLoS Computational Biology","author":[{"last_name":"Gómez Sicilia","full_name":"Gómez Sicilia, Àngel","first_name":"Àngel"},{"first_name":"Mateusz K","full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","last_name":"Sikora"},{"full_name":"Cieplak, Marek","first_name":"Marek","last_name":"Cieplak"},{"full_name":"Carrión Vázquez, Mariano","first_name":"Mariano","last_name":"Carrión Vázquez"}],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1004541","file":[{"date_created":"2018-12-12T10:16:21Z","file_name":"IST-2016-478-v1+1_journal.pcbi.1004541.pdf","file_size":1412511,"access_level":"open_access","checksum":"8b67d729be663bfc9af04bfd94459655","relation":"main_file","date_updated":"2020-07-14T12:45:02Z","file_id":"5207","creator":"system","content_type":"application/pdf"}],"pubrep_id":"478","ddc":["570"],"acknowledgement":"We acknowledge the support by the EU Joint Programme in Neurodegenerative Diseases (JPND AC14/00037) project. The project is supported through the following funding organisations under the aegis of JPND—www.jpnd.eu: Ireland, HRB; Poland, National Science Centre; and Spain, ISCIII. ","file_date_updated":"2020-07-14T12:45:02Z","license":"https://creativecommons.org/licenses/by/4.0/","issue":"10","related_material":{"record":[{"relation":"research_data","status":"public","id":"9714"}]},"scopus_import":"1","external_id":{"isi":["000364399700067"]},"doi":"10.1371/journal.pcbi.1004541","date_updated":"2026-07-06T13:54:28Z","volume":11,"publisher":"Public Library of Science","citation":{"ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures,” <i>PLoS Computational Biology</i>, vol. 11, no. 10. Public Library of Science, 2015.","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures.” <i>PLoS Computational Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">https://doi.org/10.1371/journal.pcbi.1004541</a>.","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures. PLoS Computational Biology. 11(10), e1004541.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures. <i>PLoS Computational Biology</i>. 2015;11(10). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">10.1371/journal.pcbi.1004541</a>","mla":"Gómez Sicilia, Àngel, et al. “An Exploration of the Universe of Polyglutamine Structures.” <i>PLoS Computational Biology</i>, vol. 11, no. 10, e1004541, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">10.1371/journal.pcbi.1004541</a>.","apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., &#38; Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">https://doi.org/10.1371/journal.pcbi.1004541</a>","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, PLoS Computational Biology 11 (2015)."},"year":"2015","department":[{"_id":"CaHe"}]},{"publisher":"Public Library of Science","department":[{"_id":"CaHe"}],"citation":{"chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>.","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures - submission to PLOS journals, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures - submission to PLOS journals. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures - submission to PLOS journals.” Public Library of Science, 2015.","mla":"Gómez Sicilia, Àngel, et al. <i>An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>.","apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., &#38; Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures - submission to PLOS journals. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015)."},"year":"2015","status":"public","date_published":"2015-10-23T00:00:00Z","article_processing_charge":"No","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1004541.s001","date_updated":"2026-07-06T13:54:29Z","date_created":"2021-07-23T12:05:28Z","related_material":{"record":[{"status":"public","id":"1566","relation":"used_in_publication"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","author":[{"first_name":"Àngel","full_name":"Gómez Sicilia, Àngel","last_name":"Gómez Sicilia"},{"last_name":"Sikora","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","full_name":"Sikora, Mateusz K","first_name":"Mateusz K"},{"last_name":"Cieplak","first_name":"Marek","full_name":"Cieplak, Marek"},{"full_name":"Carrión Vázquez, Mariano","first_name":"Mariano","last_name":"Carrión Vázquez"}],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1004541.s001","title":"An exploration of the universe of polyglutamine structures - submission to PLOS journals","day":"23","_id":"9714","type":"research_data_reference"},{"date_published":"2015-01-01T00:00:00Z","abstract":[{"text":"We show that incorporating spatial dispersal of individuals into a simple vaccination epidemic model may give rise to a model that exhibits rich dynamical behavior. Using an SIVS (susceptible-infected-vaccinated-susceptible) model as a basis, we describe the spread of an infectious disease in a population split into two regions. In each subpopulation, both forward and backward bifurcations can occur. This implies that for disconnected regions the two-patch system may admit several steady states. We consider traveling between the regions and investigate the impact of spatial dispersal of individuals on the model dynamics. We establish conditions for the existence of multiple nontrivial steady states in the system, and we study the structure of the equilibria. The mathematical analysis reveals an unusually rich dynamical behavior, not normally found in the simple epidemic models. In addition to the disease-free equilibrium, eight endemic equilibria emerge from backward transcritical and saddle-node bifurcation points, forming an interesting bifurcation diagram. Stability of steady states, their bifurcations, and the global dynamics are investigated with analytical tools, numerical simulations, and rigorous set-oriented numerical computations.","lang":"eng"}],"status":"public","publication_status":"published","isi":1,"article_processing_charge":"No","oa_version":"Published Version","language":[{"iso":"eng"}],"article_type":"original","publist_id":"5616","oa":1,"quality_controlled":"1","type":"journal_article","_id":"1555","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:42Z","intvolume":"        14","main_file_link":[{"open_access":"1","url":"http://discovery.ucl.ac.uk/1473750/1/99393.pdf"}],"month":"01","ec_funded":1,"scopus_import":"1","external_id":{"isi":["000357310400015"]},"doi":"10.1137/140993934","date_updated":"2026-07-06T13:59:25Z","volume":14,"publisher":"Society for Industrial and Applied Mathematics","citation":{"ama":"Knipl D, Pilarczyk P, Röst G. Rich bifurcation structure in a two patch vaccination model. <i>SIAM Journal on Applied Dynamical Systems</i>. 2015;14(2):980-1017. doi:<a href=\"https://doi.org/10.1137/140993934\">10.1137/140993934</a>","ista":"Knipl D, Pilarczyk P, Röst G. 2015. Rich bifurcation structure in a two patch vaccination model. SIAM Journal on Applied Dynamical Systems. 14(2), 980–1017.","chicago":"Knipl, Diána, Pawel Pilarczyk, and Gergely Röst. “Rich Bifurcation Structure in a Two Patch Vaccination Model.” <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial and Applied Mathematics, 2015. <a href=\"https://doi.org/10.1137/140993934\">https://doi.org/10.1137/140993934</a>.","ieee":"D. Knipl, P. Pilarczyk, and G. Röst, “Rich bifurcation structure in a two patch vaccination model,” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 14, no. 2. Society for Industrial and Applied Mathematics, pp. 980–1017, 2015.","apa":"Knipl, D., Pilarczyk, P., &#38; Röst, G. (2015). Rich bifurcation structure in a two patch vaccination model. <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/140993934\">https://doi.org/10.1137/140993934</a>","short":"D. Knipl, P. Pilarczyk, G. Röst, SIAM Journal on Applied Dynamical Systems 14 (2015) 980–1017.","mla":"Knipl, Diána, et al. “Rich Bifurcation Structure in a Two Patch Vaccination Model.” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 14, no. 2, Society for Industrial and Applied Mathematics, 2015, pp. 980–1017, doi:<a href=\"https://doi.org/10.1137/140993934\">10.1137/140993934</a>."},"year":"2015","department":[{"_id":"HeEd"}],"publication":"SIAM Journal on Applied Dynamical Systems","author":[{"last_name":"Knipl","first_name":"Diána","full_name":"Knipl, Diána"},{"first_name":"Pawel","full_name":"Pilarczyk, Pawel","last_name":"Pilarczyk","id":"3768D56A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Röst, Gergely","first_name":"Gergely","last_name":"Röst"}],"project":[{"name":"Persistent Homology - Images, Data and Maps","grant_number":"622033","call_identifier":"FP7","_id":"255F06BE-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.1137/140993934","page":"980 - 1017","title":"Rich bifurcation structure in a two patch vaccination model","das_tickbox":"1","publication_identifier":{"eissn":["1536-0040"]},"ddc":["510"],"acknowledgement":"Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria (pawel.pilarczyk@ist.ac.at). This author’s work was partially supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement 622033, by Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE—Programa Operacional Factores de Competitividade (POFC), by the Portuguese national funds through Funda ̧caoparaaCiˆencia e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645 (ref. FCT PTDC/MAT/098871/2008), and by European Research Council through StG 259559 in the framework of the EPIDELAY project.","issue":"2"},{"language":[{"iso":"eng"}],"article_type":"original","publist_id":"5648","oa_version":"Published Version","date_published":"2015-11-12T00:00:00Z","publication_status":"published","status":"public","has_accepted_license":"1","abstract":[{"text":"Based on 16 recommendations, efforts should be made to achieve the following goal: By 2025, all scholarly publication activity in Austria should be Open Access. In other words, the final versions of all scholarly publications resulting from the support of public resources must be freely accessible on the Internet without delay (Gold Open Access). The resources required to meet this obligation shall be provided to the authors, or the cost of the publication venues shall be borne directly by the research organisations.","lang":"eng"}],"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"OA_type":"gold","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:31Z","intvolume":"        68","month":"11","quality_controlled":"1","_id":"1525","type":"journal_article","day":"12","oa":1,"OA_place":"publisher","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","volume":68,"citation":{"ama":"Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. <i>VÖB Mitteilungen</i>. 2015;68(3):580-607. doi:<a href=\"https://doi.org/10.5281/zenodo.33178\">10.5281/zenodo.33178</a>","ista":"Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.","chicago":"Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus, Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network Austria OANA.” <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2015. <a href=\"https://doi.org/10.5281/zenodo.33178\">https://doi.org/10.5281/zenodo.33178</a>.","ieee":"B. Bauer <i>et al.</i>, “Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA,” <i>VÖB Mitteilungen</i>, vol. 68, no. 3. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 580–607, 2015.","apa":"Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., … Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.5281/zenodo.33178\">https://doi.org/10.5281/zenodo.33178</a>","short":"B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König, K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen 68 (2015) 580–607.","mla":"Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network Austria OANA.” <i>VÖB Mitteilungen</i>, vol. 68, no. 3, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2015, pp. 580–607, doi:<a href=\"https://doi.org/10.5281/zenodo.33178\">10.5281/zenodo.33178</a>."},"year":"2015","department":[{"_id":"E-Lib"}],"scopus_import":"1","date_updated":"2026-07-07T06:11:42Z","doi":"10.5281/zenodo.33178","ddc":["020"],"pubrep_id":"720","file_date_updated":"2020-07-14T12:45:00Z","issue":"3","das_tickbox":"1","page":"580 - 607","title":"Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA","author":[{"last_name":"Bauer","full_name":"Bauer, Bruno","first_name":"Bruno"},{"first_name":"Guido","full_name":"Blechl, Guido","last_name":"Blechl"},{"full_name":"Bock, Christoph","first_name":"Christoph","last_name":"Bock"},{"orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski"},{"first_name":"Andreas","full_name":"Ferus, Andreas","last_name":"Ferus"},{"last_name":"Graschopf","full_name":"Graschopf, Anton","first_name":"Anton"},{"last_name":"König","full_name":"König, Thomas","first_name":"Thomas"},{"last_name":"Mayer","full_name":"Mayer, Katja","first_name":"Katja"},{"last_name":"Reckling","first_name":"Falk","full_name":"Reckling, Falk"},{"last_name":"Rieck","first_name":"Katharina","full_name":"Rieck, Katharina"},{"full_name":"Seitz, Peter","first_name":"Peter","last_name":"Seitz"},{"first_name":"Herwig","full_name":"Stöger, Herwig","last_name":"Stöger"},{"last_name":"Welzig","first_name":"Elvira","full_name":"Welzig, Elvira"}],"publication":"VÖB Mitteilungen","fulldoi":"https://doi.org/10.5281/zenodo.33178","file":[{"file_size":931707,"date_created":"2018-12-12T10:17:59Z","file_name":"IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf","date_updated":"2020-07-14T12:45:00Z","relation":"main_file","file_id":"5317","creator":"system","content_type":"application/pdf","checksum":"a495fe253bbc7615b1d60e9e85c94408","access_level":"open_access"}]},{"ec_funded":1,"scopus_import":"1","date_updated":"2026-07-07T13:10:27Z","doi":"10.1016/j.ipl.2014.09.001","external_id":{"isi":["000345478700010"],"arxiv":["1407.4225"]},"volume":115,"publisher":"Elsevier","department":[{"_id":"KrCh"}],"citation":{"mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” <i>Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>.","apa":"Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>","short":"B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.","chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” <i>Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>.","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. <i>Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” <i>Information Processing Letters</i>, vol. 115, no. 1. Elsevier, pp. 52–59, 2015."},"year":"2015","author":[{"last_name":"Bérard","first_name":"Béatrice","full_name":"Bérard, Béatrice"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Sznajder","full_name":"Sznajder, Nathalie","first_name":"Nathalie"}],"publication":"Information Processing Letters","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"fulldoi":"https://doi.org/10.1016/j.ipl.2014.09.001","title":"Probabilistic opacity for Markov decision processes","page":"52 - 59","das_tickbox":"1","issue":"1","status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers."}],"date_published":"2015-01-01T00:00:00Z","article_processing_charge":"No","isi":1,"oa_version":"Preprint","publist_id":"5025","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","day":"01","_id":"2034","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:55:20Z","main_file_link":[{"url":"http://arxiv.org/abs/1407.4225","open_access":"1"}],"month":"01","intvolume":"       115","arxiv":1},{"das_tickbox":"1","ddc":["570"],"pubrep_id":"483","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file_date_updated":"2020-07-14T12:45:01Z","publication":"Journal of Theoretical Biology","author":[{"full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao"},{"first_name":"Golnaz","full_name":"Badkobeh, Golnaz","last_name":"Badkobeh"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"last_name":"Çörüş","full_name":"Çörüş, Doğan","first_name":"Doğan"},{"last_name":"Dang","first_name":"Duccuong","full_name":"Dang, Duccuong"},{"full_name":"Friedrich, Tobias","first_name":"Tobias","last_name":"Friedrich"},{"full_name":"Lehre, Per","first_name":"Per","last_name":"Lehre"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"},{"last_name":"Sutton","first_name":"Andrew","full_name":"Sutton, Andrew"},{"first_name":"Barbora","orcid":"0000-0002-6873-2967","full_name":"Trubenova, Barbora","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_name":"IST-2016-483-v1+1_1-s2.0-S0022519315003409-main.pdf","date_created":"2018-12-12T10:16:53Z","file_size":595307,"access_level":"open_access","checksum":"33b60ecfea60764756a9ee9df5eb65ca","creator":"system","file_id":"5244","date_updated":"2020-07-14T12:45:01Z","relation":"main_file","content_type":"application/pdf"}],"project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"fulldoi":"https://doi.org/10.1016/j.jtbi.2015.07.011","title":"Toward a unifying framework for evolutionary processes","page":"28 - 43","publisher":"Elsevier","volume":383,"department":[{"_id":"NiBa"},{"_id":"CaGu"}],"citation":{"chicago":"Paixao, Tiago, Golnaz Badkobeh, Nicholas H Barton, Doğan Çörüş, Duccuong Dang, Tobias Friedrich, Per Lehre, Dirk Sudholt, Andrew Sutton, and Barbora Trubenova. “Toward a Unifying Framework for Evolutionary Processes.” <i>Journal of Theoretical Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">https://doi.org/10.1016/j.jtbi.2015.07.011</a>.","ista":"Paixao T, Badkobeh G, Barton NH, Çörüş D, Dang D, Friedrich T, Lehre P, Sudholt D, Sutton A, Trubenova B. 2015. Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology. 383, 28–43.","ama":"Paixao T, Badkobeh G, Barton NH, et al. Toward a unifying framework for evolutionary processes. <i>Journal of Theoretical Biology</i>. 2015;383:28-43. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">10.1016/j.jtbi.2015.07.011</a>","ieee":"T. Paixao <i>et al.</i>, “Toward a unifying framework for evolutionary processes,” <i>Journal of Theoretical Biology</i>, vol. 383. Elsevier, pp. 28–43, 2015.","mla":"Paixao, Tiago, et al. “Toward a Unifying Framework for Evolutionary Processes.” <i>Journal of Theoretical Biology</i>, vol. 383, Elsevier, 2015, pp. 28–43, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">10.1016/j.jtbi.2015.07.011</a>.","apa":"Paixao, T., Badkobeh, G., Barton, N. H., Çörüş, D., Dang, D., Friedrich, T., … Trubenova, B. (2015). Toward a unifying framework for evolutionary processes. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">https://doi.org/10.1016/j.jtbi.2015.07.011</a>","short":"T. Paixao, G. Badkobeh, N.H. Barton, D. Çörüş, D. Dang, T. Friedrich, P. Lehre, D. Sudholt, A. Sutton, B. Trubenova, Journal of Theoretical Biology 383 (2015) 28–43."},"year":"2015","ec_funded":1,"scopus_import":"1","doi":"10.1016/j.jtbi.2015.07.011","date_updated":"2026-07-07T13:12:13Z","external_id":{"isi":["000362056300005"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:37Z","month":"10","intvolume":"       383","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"oa":1,"quality_controlled":"1","corr_author":"1","type":"journal_article","_id":"1542","day":"21","publist_id":"5629","language":[{"iso":"eng"}],"status":"public","publication_status":"published","abstract":[{"text":"The theory of population genetics and evolutionary computation have been evolving separately for nearly 30 years. Many results have been independently obtained in both fields and many others are unique to its respective field. We aim to bridge this gap by developing a unifying framework for evolutionary processes that allows both evolutionary algorithms and population genetics models to be cast in the same formal framework. The framework we present here decomposes the evolutionary process into its several components in order to facilitate the identification of similarities between different models. In particular, we propose a classification of evolutionary operators based on the defining properties of the different components. We cast several commonly used operators from both fields into this common framework. Using this, we map different evolutionary and genetic algorithms to different evolutionary regimes and identify candidates with the most potential for the translation of results between the fields. This provides a unified description of evolutionary processes and represents a stepping stone towards new tools and results to both fields. ","lang":"eng"}],"has_accepted_license":"1","date_published":"2015-10-21T00:00:00Z","article_processing_charge":"No","isi":1,"oa_version":"Published Version"},{"arxiv":1,"OA_type":"green","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:17Z","month":"07","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1606.03598"}],"quality_controlled":"1","corr_author":"1","_id":"1656","day":"31","type":"conference","oa":1,"article_number":"7174926","language":[{"iso":"eng"}],"publist_id":"5494","oa_version":"Preprint","date_published":"2015-07-31T00:00:00Z","publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"isi":1,"article_processing_charge":"No","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available at: \r\nhttps://repository.ist.ac.at/331/\r\n","related_material":{"record":[{"status":"public","id":"5415","relation":"earlier_version"},{"relation":"earlier_version","id":"5436","status":"public"},{"status":"public","id":"467","relation":"later_version"}]},"title":"Nested weighted automata","publication":"Proceedings - Symposium on Logic in Computer Science","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"fulldoi":"https://doi.org/10.1109/LICS.2015.72","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"location":"Kyoto, Japan","end_date":"2015-07-10","name":"LICS: Logic in Computer Science","start_date":"2015-07-06"},"OA_place":"repository","volume":"2015-July","publisher":"IEEE","year":"2015","citation":{"mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>Proceedings - Symposium on Logic in Computer Science</i>, vol. 2015–July, 7174926, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/LICS.2015.72\">10.1109/LICS.2015.72</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). Nested weighted automata. In <i>Proceedings - Symposium on Logic in Computer Science</i> (Vol. 2015–July). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.72\">https://doi.org/10.1109/LICS.2015.72</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in <i>Proceedings - Symposium on Logic in Computer Science</i>, Kyoto, Japan, 2015, vol. 2015–July.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In <i>Proceedings - Symposium on Logic in Computer Science</i>, Vol. 2015–July. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.72\">https://doi.org/10.1109/LICS.2015.72</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: <i>Proceedings - Symposium on Logic in Computer Science</i>. Vol 2015-July. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/LICS.2015.72\">10.1109/LICS.2015.72</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","external_id":{"isi":["000380427100064"],"arxiv":["1606.03598"]},"doi":"10.1109/LICS.2015.72","date_updated":"2026-07-07T14:01:10Z","ec_funded":1},{"oa":1,"_id":"5436","type":"technical_report","day":"24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:19Z","month":"04","date_published":"2015-04-24T00:00:00Z","status":"public","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"fulldoi":"https://doi.org/10.15479/AT:IST-2015-170-v2-2","file":[{"date_created":"2018-12-12T11:54:19Z","file_name":"IST-2015-170-v2+2_report.pdf","file_size":569991,"access_level":"open_access","checksum":"3c402f47d3669c28d04d1af405a08e3f","creator":"system","date_updated":"2020-07-14T12:46:54Z","file_id":"5541","relation":"main_file","content_type":"application/pdf"}],"page":"29","title":"Nested weighted automata","related_material":{"record":[{"relation":"earlier_version","id":"5415","status":"public"},{"id":"1656","status":"public","relation":"later_version"},{"relation":"later_version","id":"467","status":"public"}]},"publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"331","ddc":["000"],"file_date_updated":"2020-07-14T12:46:54Z","doi":"10.15479/AT:IST-2015-170-v2-2","date_updated":"2026-07-07T14:01:10Z","publisher":"IST Austria","year":"2015","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"publisher":"Academic Press","volume":31,"department":[{"_id":"HeEd"}],"year":"2015","citation":{"short":"F. Pausinger, A. Svane, Journal of Complexity 31 (2015) 773–797.","apa":"Pausinger, F., &#38; Svane, A. (2015). A Koksma-Hlawka inequality for general discrepancy systems. <i>Journal of Complexity</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jco.2015.06.002\">https://doi.org/10.1016/j.jco.2015.06.002</a>","mla":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” <i>Journal of Complexity</i>, vol. 31, no. 6, Academic Press, 2015, pp. 773–97, doi:<a href=\"https://doi.org/10.1016/j.jco.2015.06.002\">10.1016/j.jco.2015.06.002</a>.","ista":"Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 31(6), 773–797.","ama":"Pausinger F, Svane A. A Koksma-Hlawka inequality for general discrepancy systems. <i>Journal of Complexity</i>. 2015;31(6):773-797. doi:<a href=\"https://doi.org/10.1016/j.jco.2015.06.002\">10.1016/j.jco.2015.06.002</a>","chicago":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” <i>Journal of Complexity</i>. Academic Press, 2015. <a href=\"https://doi.org/10.1016/j.jco.2015.06.002\">https://doi.org/10.1016/j.jco.2015.06.002</a>.","ieee":"F. Pausinger and A. Svane, “A Koksma-Hlawka inequality for general discrepancy systems,” <i>Journal of Complexity</i>, vol. 31, no. 6. Academic Press, pp. 773–797, 2015."},"scopus_import":"1","date_updated":"2026-07-29T10:08:33Z","doi":"10.1016/j.jco.2015.06.002","external_id":{"isi":["000362926900001"]},"acknowledgement":"F.P. is supported by the Graduate School of IST Austria, A.M.S is supported by the Centre for Stochastic Geometry and Advanced Bioimaging funded by a grant from the Villum Foundation.","issue":"6","related_material":{"record":[{"relation":"dissertation_contains","id":"1399","status":"public"}]},"title":"A Koksma-Hlawka inequality for general discrepancy systems","page":"773 - 797","publication":"Journal of Complexity","author":[{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","last_name":"Pausinger","orcid":"0000-0002-8379-3768","first_name":"Florian","full_name":"Pausinger, Florian"},{"full_name":"Svane, Anne","first_name":"Anne","last_name":"Svane"}],"fulldoi":"https://doi.org/10.1016/j.jco.2015.06.002","publist_id":"5320","language":[{"iso":"eng"}],"oa_version":"None","abstract":[{"lang":"eng","text":"Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop a new concept of variation of multivariate functions on a compact Hausdorff space with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka theorem that holds for this notion of variation and discrepancy with respect to D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions, such as extreme or isotropic discrepancy. For extreme discrepancy, our result coincides with the usual Koksma-Hlawka theorem. We show that the space of functions of bounded D-variation contains important discontinuous functions and is closed under natural algebraic operations. Finally, we illustrate the results on concrete integration problems from integral geometry and stereology."}],"status":"public","publication_status":"published","date_published":"2015-12-01T00:00:00Z","article_processing_charge":"No","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:02Z","month":"12","intvolume":"        31","corr_author":"1","quality_controlled":"1","type":"journal_article","_id":"1792","day":"01"},{"author":[{"last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","first_name":"Florian","orcid":"0000-0002-8379-3768"}],"title":"On the approximation of intrinsic volumes","corr_author":"1","page":"144","_id":"1399","type":"dissertation","day":"01","supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert"}],"date_created":"2018-12-11T11:51:48Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"status":"public","id":"1662","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"1792","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"2255"}]},"month":"06","publication_identifier":{"issn":["2663-337X"]},"status":"public","publication_status":"published","abstract":[{"text":"This thesis is concerned with the computation and approximation of intrinsic volumes. Given a smooth body M and a certain digital approximation of it, we develop algorithms to approximate various intrinsic volumes of M using only measurements taken from its digital approximations. The crucial idea behind our novel algorithms is to link the recent theory of persistent homology to the theory of intrinsic volumes via the Crofton formula from integral geometry and, in particular, via Euler characteristic computations. Our main contributions are a multigrid convergent digital algorithm to compute the first intrinsic volume of a solid body in R^n as well as an appropriate integration pipeline to approximate integral-geometric integrals defined over the Grassmannian manifold.","lang":"eng"}],"date_published":"2015-06-01T00:00:00Z","article_processing_charge":"No","oa_version":"None","date_updated":"2026-07-29T10:08:34Z","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"doi_confirm":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"citation":{"short":"F. Pausinger, On the Approximation of Intrinsic Volumes, Institute of Science and Technology Austria, 2015.","apa":"Pausinger, F. (2015). <i>On the approximation of intrinsic volumes</i>. Institute of Science and Technology Austria.","mla":"Pausinger, Florian. <i>On the Approximation of Intrinsic Volumes</i>. Institute of Science and Technology Austria, 2015.","ieee":"F. Pausinger, “On the approximation of intrinsic volumes,” Institute of Science and Technology Austria, 2015.","ista":"Pausinger F. 2015. On the approximation of intrinsic volumes. Institute of Science and Technology Austria.","ama":"Pausinger F. On the approximation of intrinsic volumes. 2015.","chicago":"Pausinger, Florian. “On the Approximation of Intrinsic Volumes.” Institute of Science and Technology Austria, 2015."},"year":"2015","OA_place":"publisher","publist_id":"5808","language":[{"iso":"eng"}]}]