[{"intvolume":"        23","external_id":{"isi":["000328918900032"]},"year":"2013","publication_status":"published","scopus_import":"1","month":"12","date_created":"2018-12-11T11:46:58Z","title":"Modeling framework for the establishment of the apical-basal embryonic axis in plants","quality_controlled":"1","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"citation":{"mla":"Wabnik, Krzysztof T., et al. “Modeling Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.” <i>Current Biology</i>, vol. 23, no. 24, Cell Press, 2013, pp. 2513–18, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">10.1016/j.cub.2013.10.038</a>.","ieee":"K. T. Wabnik, H. Robert, R. Smith, and J. Friml, “Modeling framework for the establishment of the apical-basal embryonic axis in plants,” <i>Current Biology</i>, vol. 23, no. 24. Cell Press, pp. 2513–2518, 2013.","chicago":"Wabnik, Krzysztof T, Hélène Robert, Richard Smith, and Jiří Friml. “Modeling Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">https://doi.org/10.1016/j.cub.2013.10.038</a>.","ama":"Wabnik KT, Robert H, Smith R, Friml J. Modeling framework for the establishment of the apical-basal embryonic axis in plants. <i>Current Biology</i>. 2013;23(24):2513-2518. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">10.1016/j.cub.2013.10.038</a>","apa":"Wabnik, K. T., Robert, H., Smith, R., &#38; Friml, J. (2013). Modeling framework for the establishment of the apical-basal embryonic axis in plants. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">https://doi.org/10.1016/j.cub.2013.10.038</a>","short":"K.T. Wabnik, H. Robert, R. Smith, J. Friml, Current Biology 23 (2013) 2513–2518.","ista":"Wabnik KT, Robert H, Smith R, Friml J. 2013. Modeling framework for the establishment of the apical-basal embryonic axis in plants. Current Biology. 23(24), 2513–2518."},"ec_funded":1,"publist_id":"7292","_id":"527","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"2513 - 2518","doi":"10.1016/j.cub.2013.10.038","article_processing_charge":"No","volume":23,"language":[{"iso":"eng"}],"date_published":"2013-12-16T00:00:00Z","abstract":[{"lang":"eng","text":"The apical-basal axis of the early plant embryo determines the body plan of the adult organism. To establish a polarized embryonic axis, plants evolved a unique mechanism that involves directional, cell-to-cell transport of the growth regulator auxin. Auxin transport relies on PIN auxin transporters [1], whose polar subcellular localization determines the flow directionality. PIN-mediated auxin transport mediates the spatial and temporal activity of the auxin response machinery [2-7] that contributes to embryo patterning processes, including establishment of the apical (shoot) and basal (root) embryo poles [8]. However, little is known of upstream mechanisms guiding the (re)polarization of auxin fluxes during embryogenesis [9]. Here, we developed a model of plant embryogenesis that correctly generates emergent cell polarities and auxin-mediated sequential initiation of apical-basal axis of plant embryo. The model relies on two precisely localized auxin sources and a feedback between auxin and the polar, subcellular PIN transporter localization. Simulations reproduced PIN polarity and auxin distribution, as well as previously unknown polarization events during early embryogenesis. The spectrum of validated model predictions suggests that our model corresponds to a minimal mechanistic framework for initiation and orientation of the apical-basal axis to guide both embryonic and postembryonic plant development."}],"corr_author":"1","status":"public","issue":"24","publication":"Current Biology","oa_version":"None","type":"journal_article","publisher":"Cell Press","author":[{"orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof T","full_name":"Wabnik, Krzysztof T","last_name":"Wabnik"},{"last_name":"Robert","full_name":"Robert, Hélène","first_name":"Hélène"},{"last_name":"Smith","full_name":"Smith, Richard","first_name":"Richard"},{"full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants"}],"isi":1,"day":"16","date_updated":"2025-09-30T07:10:38Z"},{"publication":"Current Biology","issue":"24","status":"public","corr_author":"1","abstract":[{"text":"Establishment of the embryonic axis foreshadows the main body axis of adults both in plants and in animals, but underlying mechanisms are considered distinct. Plants utilize directional, cell-to-cell transport of the growth hormone auxin [1, 2] to generate an asymmetric auxin response that specifies the embryonic apical-basal axis [3-6]. The auxin flow directionality depends on the polarized subcellular localization of PIN-FORMED (PIN) auxin transporters [7, 8]. It remains unknown which mechanisms and spatial cues guide cell polarization and axis orientation in early embryos. Herein, we provide conceptually novel insights into the formation of embryonic axis in Arabidopsis by identifying a crucial role of localized tryptophan-dependent auxin biosynthesis [9-12]. Local auxin production at the base of young embryos and the accompanying PIN7-mediated auxin flow toward the proembryo are required for the apical auxin response maximum and the specification of apical embryonic structures. Later in embryogenesis, the precisely timed onset of localized apical auxin biosynthesis mediates PIN1 polarization, basal auxin response maximum, and specification of the root pole. Thus, the tight spatiotemporal control of distinct local auxin sources provides a necessary, non-cell-autonomous trigger for the coordinated cell polarization and subsequent apical-basal axis orientation during embryogenesis and, presumably, also for other polarization events during postembryonic plant life [13, 14].","lang":"eng"}],"oa_version":"None","volume":23,"article_processing_charge":"No","doi":"10.1016/j.cub.2013.09.039","page":"2506 - 2512","date_published":"2013-12-16T00:00:00Z","language":[{"iso":"eng"}],"day":"16","isi":1,"project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_updated":"2025-09-30T07:10:06Z","type":"journal_article","publisher":"Cell Press","author":[{"full_name":"Robert, Hélène","last_name":"Robert","first_name":"Hélène"},{"full_name":"Grones, Peter","last_name":"Grones","first_name":"Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stepanova, Anna","last_name":"Stepanova","first_name":"Anna"},{"first_name":"Linda","full_name":"Robles, Linda","last_name":"Robles"},{"first_name":"Annemarie","last_name":"Lokerse","full_name":"Lokerse, Annemarie"},{"full_name":"Alonso, Jose","last_name":"Alonso","first_name":"Jose"},{"first_name":"Dolf","full_name":"Weijers, Dolf","last_name":"Weijers"},{"last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","publication_status":"published","month":"12","intvolume":"        23","year":"2013","external_id":{"isi":["000328918900031"]},"ec_funded":1,"publist_id":"7291","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"528","quality_controlled":"1","department":[{"_id":"JiFr"}],"title":"Local auxin sources orient the apical basal axis in arabidopsis embryos","date_created":"2018-12-11T11:46:59Z","citation":{"ista":"Robert H, Grones P, Stepanova A, Robles L, Lokerse A, Alonso J, Weijers D, Friml J. 2013. Local auxin sources orient the apical basal axis in arabidopsis embryos. Current Biology. 23(24), 2506–2512.","short":"H. Robert, P. Grones, A. Stepanova, L. Robles, A. Lokerse, J. Alonso, D. Weijers, J. Friml, Current Biology 23 (2013) 2506–2512.","apa":"Robert, H., Grones, P., Stepanova, A., Robles, L., Lokerse, A., Alonso, J., … Friml, J. (2013). Local auxin sources orient the apical basal axis in arabidopsis embryos. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">https://doi.org/10.1016/j.cub.2013.09.039</a>","ama":"Robert H, Grones P, Stepanova A, et al. Local auxin sources orient the apical basal axis in arabidopsis embryos. <i>Current Biology</i>. 2013;23(24):2506-2512. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">10.1016/j.cub.2013.09.039</a>","chicago":"Robert, Hélène, Peter Grones, Anna Stepanova, Linda Robles, Annemarie Lokerse, Jose Alonso, Dolf Weijers, and Jiří Friml. “Local Auxin Sources Orient the Apical Basal Axis in Arabidopsis Embryos.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">https://doi.org/10.1016/j.cub.2013.09.039</a>.","ieee":"H. Robert <i>et al.</i>, “Local auxin sources orient the apical basal axis in arabidopsis embryos,” <i>Current Biology</i>, vol. 23, no. 24. Cell Press, pp. 2506–2512, 2013.","mla":"Robert, Hélène, et al. “Local Auxin Sources Orient the Apical Basal Axis in Arabidopsis Embryos.” <i>Current Biology</i>, vol. 23, no. 24, Cell Press, 2013, pp. 2506–12, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">10.1016/j.cub.2013.09.039</a>."}},{"doi":"10.15479/AT:IST-2013-104-v1-1","page":"17","related_material":{"record":[{"relation":"later_version","status":"public","id":"2000"}]},"year":"2013","pubrep_id":"104","file_date_updated":"2020-07-14T12:46:44Z","language":[{"iso":"eng"}],"date_published":"2013-01-11T00:00:00Z","publication_status":"published","status":"public","ddc":["000"],"abstract":[{"lang":"eng","text":"In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics."}],"file":[{"file_id":"5542","file_name":"IST-2013-104-v1+1_tumortool.pdf","date_updated":"2020-07-14T12:46:44Z","access_level":"open_access","file_size":1471954,"creator":"system","content_type":"application/pdf","relation":"main_file","checksum":"2cc8c6e157eca1271128db80bb3dec80","date_created":"2018-12-12T11:54:20Z"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"month":"01","oa_version":"Published Version","date_created":"2018-12-12T11:39:07Z","type":"technical_report","department":[{"_id":"KrCh"}],"title":"TTP: Tool for Tumor Progression","has_accepted_license":"1","author":[{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","last_name":"Reiter"},{"last_name":"Bozic","full_name":"Bozic, Ivana","first_name":"Ivana"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"publisher":"IST Austria","citation":{"apa":"Reiter, J., Bozic, I., Chatterjee, K., &#38; Nowak, M. (2013). <i>TTP: Tool for Tumor Progression</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">https://doi.org/10.15479/AT:IST-2013-104-v1-1</a>","ama":"Reiter J, Bozic I, Chatterjee K, Nowak M. <i>TTP: Tool for Tumor Progression</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">10.15479/AT:IST-2013-104-v1-1</a>","ista":"Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p.","short":"J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.","mla":"Reiter, Johannes, et al. <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">10.15479/AT:IST-2013-104-v1-1</a>.","chicago":"Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak. <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">https://doi.org/10.15479/AT:IST-2013-104-v1-1</a>.","ieee":"J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013."},"publication_identifier":{"issn":["2664-1690"]},"day":"11","_id":"5399","date_updated":"2025-04-15T08:12:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2013","date_published":"2013-02-20T00:00:00Z","language":[{"iso":"eng"}],"pubrep_id":"109","file_date_updated":"2020-07-14T12:46:44Z","page":"41","doi":"10.15479/AT:IST-2013-109-v1-1","related_material":{"record":[{"status":"public","relation":"later_version","id":"2295"},{"id":"1477","status":"public","relation":"later_version"}]},"month":"02","oa_version":"Published Version","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages extends regular languages to infinite strings and provides a robust specification language to express all properties used in verification, and parity objectives are canonical forms to express ω-regular conditions. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satis- fied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite- memory strategies. We establish asymptotically optimal (exponential) memory bounds and EXPTIME- completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives.","lang":"eng"}],"publication_status":"published","status":"public","ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"file":[{"content_type":"application/pdf","file_name":"IST-2013-109-v1+1_What_is_Decidable_about_Partially_Observable_Markov_Decision_Processes_with_ω-Regular_Objectives.pdf","file_id":"5467","date_updated":"2020-07-14T12:46:44Z","access_level":"open_access","creator":"system","file_size":483407,"relation":"main_file","date_created":"2018-12-12T11:53:06Z","checksum":"cbba40210788a1b22c6cf06433b5ed6f"}],"oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">https://doi.org/10.15479/AT:IST-2013-109-v1-1</a>.","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, <i>What is decidable about partially observable Markov decision processes with ω-regular objectives</i>. IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">10.15479/AT:IST-2013-109-v1-1</a>.","ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.","short":"K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.","ama":"Chatterjee K, Chmelik M, Tracol M. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">10.15479/AT:IST-2013-109-v1-1</a>","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2013). <i>What is decidable about partially observable Markov decision processes with ω-regular objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">https://doi.org/10.15479/AT:IST-2013-109-v1-1</a>"},"has_accepted_license":"1","publisher":"IST Austria","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tracol","full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu"}],"type":"technical_report","date_created":"2018-12-12T11:39:07Z","title":"What is decidable about partially observable Markov decision processes with ω-regular objectives","department":[{"_id":"KrCh"}],"_id":"5400","date_updated":"2025-09-18T11:38:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"20"},{"status":"public","publication_status":"published","ddc":["000","004"],"abstract":[{"lang":"eng","text":"Linearizability requires that the outcome of calls by competing threads to a concurrent data structure is the same as some sequential execution where each thread has exclusive access to the data structure. In an ordered data structure, such as a queue or a stack, linearizability is ensured by requiring threads commit in the order dictated by the sequential semantics of the data structure; e.g., in a concurrent queue implementation a dequeue can only remove the oldest element. \r\nIn this paper, we investigate the impact of this strict ordering, by comparing what linearizability allows to what existing implementations do. We first give an operational definition for linearizability which allows us to build the most general linearizable implementation as a transition system for any given sequential specification. We then use this operational definition to categorize linearizable implementations based on whether they are bound or free. In a bound implementation, whenever all threads observe the same logical state, the updates to the logical state and the temporal order of commits coincide. All existing queue implementations we know of are bound. We then proceed to present, to the best of our knowledge, the first ever free queue implementation. Our experiments show that free implementations have the potential for better performance by suffering less from contention."}],"oa":1,"file":[{"file_size":249790,"creator":"system","file_id":"5480","date_updated":"2020-07-14T12:46:45Z","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"ce580605ae9756a8c99d7b403ebb8eed","date_created":"2018-12-12T11:53:19Z"}],"alternative_title":["IST Austria Technical Report"],"month":"06","oa_version":"Published Version","doi":"10.15479/AT:IST-2013-123-v1-1","page":"16","year":"2013","pubrep_id":"123","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}],"date_published":"2013-06-12T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"day":"12","_id":"5402","date_updated":"2020-07-14T23:04:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:07Z","type":"technical_report","department":[{"_id":"ToHe"}],"title":"How free is your linearizable concurrent data structure?","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali","last_name":"Sezgin"}],"publisher":"IST Austria","has_accepted_license":"1","citation":{"apa":"Henzinger, T. A., &#38; Sezgin, A. (2013). <i>How free is your linearizable concurrent data structure?</i> IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>","ama":"Henzinger TA, Sezgin A. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","mla":"Henzinger, Thomas A., and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>.","chicago":"Henzinger, Thomas A, and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>.","ieee":"T. A. Henzinger and A. Sezgin, <i>How free is your linearizable concurrent data structure?</i> IST Austria, 2013."}},{"month":"07","oa_version":"Published Version","publication_status":"published","ddc":["000","005"],"status":"public","abstract":[{"lang":"eng","text":"We consider concurrent games played by two-players on a finite state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to every transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of mean-payoff games) that is not known to be in polynomial time."}],"file":[{"creator":"system","file_size":434523,"date_updated":"2020-07-14T12:46:45Z","file_name":"IST-2013-126-v1+1_soda_full.pdf","file_id":"5510","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T11:53:49Z","checksum":"063868c665beec37bf28160e2a695746"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"year":"2013","pubrep_id":"126","file_date_updated":"2020-07-14T12:46:45Z","date_published":"2013-07-03T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2013-126-v1-1","page":"33","related_material":{"record":[{"status":"public","relation":"later_version","id":"524"}]},"date_updated":"2025-09-23T09:56:27Z","_id":"5403","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"03","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"publisher":"IST Austria","has_accepted_license":"1","citation":{"apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2013). <i>Qualitative analysis of concurrent mean-payoff games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">https://doi.org/10.15479/AT:IST-2013-126-v1-1</a>","ama":"Chatterjee K, Ibsen-Jensen R. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">10.15479/AT:IST-2013-126-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.","ista":"Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">10.15479/AT:IST-2013-126-v1-1</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>Qualitative analysis of concurrent mean-payoff games</i>. IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">https://doi.org/10.15479/AT:IST-2013-126-v1-1</a>."},"date_created":"2018-12-12T11:39:08Z","type":"technical_report","department":[{"_id":"KrCh"}],"title":"Qualitative analysis of concurrent mean-payoff games"},{"related_material":{"record":[{"relation":"later_version","status":"public","id":"2162"}]},"doi":"10.15479/AT:IST-2013-127-v1-1","page":"29","pubrep_id":"127","file_date_updated":"2020-07-14T12:46:45Z","date_published":"2013-07-03T00:00:00Z","language":[{"iso":"eng"}],"year":"2013","oa":1,"file":[{"date_created":"2018-12-12T11:53:35Z","checksum":"79ee5e677a82611ce06e0360c69d494a","relation":"main_file","file_size":517275,"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:45Z","file_name":"IST-2013-127-v1+1_ergodic.pdf","file_id":"5496","content_type":"application/pdf"}],"alternative_title":["IST Austria Technical Report"],"ddc":["000","005"],"status":"public","publication_status":"published","abstract":[{"text":"We study finite-state two-player (zero-sum) concurrent mean-payoff games played on a graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lie in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP and coNP is the long-standing best known bound). We show that the exact value can be expressed in the existential theory of the reals, and also establish square-root sum hardness for a related class of games.","lang":"eng"}],"oa_version":"Published Version","month":"07","department":[{"_id":"KrCh"}],"title":"The complexity of ergodic games","date_created":"2018-12-12T11:39:08Z","type":"technical_report","has_accepted_license":"1","publisher":"IST Austria","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.","short":"K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.","ama":"Chatterjee K, Ibsen-Jensen R. <i>The Complexity of Ergodic Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">10.15479/AT:IST-2013-127-v1-1</a>","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2013). <i>The complexity of ergodic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">https://doi.org/10.15479/AT:IST-2013-127-v1-1</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">https://doi.org/10.15479/AT:IST-2013-127-v1-1</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>The complexity of ergodic games</i>. IST Austria, 2013.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">10.15479/AT:IST-2013-127-v1-1</a>."},"day":"03","publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-15T07:55:59Z","_id":"5404"},{"date_updated":"2025-04-15T07:56:00Z","_id":"5405","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"08","has_accepted_license":"1","publisher":"IST Austria","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"first_name":"Youssouf","full_name":"Oualhadj, Youssouf","last_name":"Oualhadj"}],"citation":{"ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">10.15479/AT:IST-2013-128-v1-1</a>","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2013). <i>Perfect-information stochastic mean-payoff parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">https://doi.org/10.15479/AT:IST-2013-128-v1-1</a>","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">10.15479/AT:IST-2013-128-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">https://doi.org/10.15479/AT:IST-2013-128-v1-1</a>.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, <i>Perfect-information stochastic mean-payoff parity games</i>. IST Austria, 2013."},"type":"technical_report","date_created":"2018-12-12T11:39:09Z","department":[{"_id":"KrCh"}],"title":"Perfect-information stochastic mean-payoff parity games","month":"07","oa_version":"Published Version","ddc":["000","005","510"],"status":"public","publication_status":"published","abstract":[{"text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2-1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic) with only parity objectives, or with only mean-payoff objectives. We present an algorithm running\r\nin time O(d · n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the objective\r\ncan be ensured with probability 1, where n is the number of states of the game, d the number of priorities\r\nof the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems\r\nwith both functional requirement (given as a qualitative objective) and performance requirement (given\r\nas a quantitative objective).","lang":"eng"}],"file":[{"creator":"system","file_size":387467,"access_level":"open_access","file_id":"5516","date_updated":"2020-07-14T12:46:45Z","file_name":"IST-2013-128-v1+1_full_stoch_mpp.pdf","content_type":"application/pdf","checksum":"ede787a10e74e4f7db302fab8f12f3ca","date_created":"2018-12-12T11:53:54Z","relation":"main_file"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"year":"2013","pubrep_id":"128","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}],"date_published":"2013-07-08T00:00:00Z","doi":"10.15479/AT:IST-2013-128-v1-1","page":"22","related_material":{"record":[{"id":"2212","status":"public","relation":"later_version"}]}},{"pubrep_id":"130","file_date_updated":"2020-07-14T12:46:45Z","date_published":"2013-07-08T00:00:00Z","language":[{"iso":"eng"}],"year":"2013","related_material":{"record":[{"id":"1376","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2013-130-v1-1","page":"11","oa_version":"Published Version","month":"07","oa":1,"file":[{"relation":"main_file","checksum":"855513ebaf6f72228800c5fdb522f93c","date_created":"2018-12-12T11:54:18Z","content_type":"application/pdf","creator":"system","file_size":467895,"file_id":"5540","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","date_updated":"2020-07-14T12:46:45Z","access_level":"open_access"}],"alternative_title":["IST Austria Technical Report"],"publication_status":"published","status":"public","ddc":["005"],"abstract":[{"lang":"eng","text":"We consider the distributed synthesis problem fortemporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTLand our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3)Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition."}],"has_accepted_license":"1","publisher":"IST Austria","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). <i>Distributed synthesis for LTL Fragments</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","mla":"Chatterjee, Krishnendu, et al. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, <i>Distributed synthesis for LTL Fragments</i>. IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Distributed synthesis for LTL Fragments","date_created":"2018-12-12T11:39:09Z","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5406","date_updated":"2025-06-26T08:33:42Z","day":"08","publication_identifier":{"issn":["2664-1690"]}},{"publication_identifier":{"issn":["2664-1690"]},"day":"12","_id":"5408","date_updated":"2025-04-15T07:56:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:10Z","type":"technical_report","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","department":[{"_id":"KrCh"}],"citation":{"apa":"Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2013). <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>","ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>.","ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria, 2013."},"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Nain, Sumit","last_name":"Nain","first_name":"Sumit"},{"first_name":"Moshe","last_name":"Vardi","full_name":"Vardi, Moshe"}],"publisher":"IST Austria","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We consider two-player partial-observation stochastic games where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are omega-regular conditions specified as parity objectives. The qualitative analysis problem given a partial-observation stochastic game and a parity objective asks whether  there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, they were shown to be decidable in 2EXPTIME under finite-memory  strategies. We improve the complexity and show that the qualitative analysis problems for partial-observation stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis. "}],"publication_status":"published","ddc":["000","005"],"status":"public","alternative_title":["IST Austria Technical Report"],"file":[{"relation":"main_file","date_created":"2018-12-12T11:53:16Z","checksum":"226bc791124f8d3138379778ce834e86","file_id":"5477","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2013-141-v1+1_main-tech-rpt.pdf","access_level":"open_access","creator":"system","file_size":300481,"content_type":"application/pdf"}],"oa":1,"month":"09","oa_version":"Published Version","page":"17","doi":"10.15479/AT:IST-2013-141-v1-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"2213"}]},"year":"2013","language":[{"iso":"eng"}],"date_published":"2013-09-12T00:00:00Z","file_date_updated":"2020-07-14T12:46:46Z","pubrep_id":"141"},{"file_date_updated":"2020-07-14T12:46:46Z","pubrep_id":"144","date_published":"2013-10-30T00:00:00Z","language":[{"iso":"eng"}],"year":"2013","related_material":{"record":[{"id":"2216","relation":"later_version","status":"public"}]},"doi":"10.15479/AT:IST-2013-144-v1-1","page":"12","oa_version":"Published Version","month":"10","file":[{"relation":"main_file","date_created":"2018-12-12T11:53:08Z","checksum":"0f7633081ba8299c543322f0ad08571f","file_size":336377,"creator":"system","file_id":"5469","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2013-144-v1+1_main.pdf","access_level":"open_access","content_type":"application/pdf"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"publication_status":"published","status":"public","ddc":["000"],"abstract":[{"lang":"eng","text":"The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. \r\nIn this paper, we lift the study of edit distances from untimed languages to the timed setting. We define an edit distance between timed words which incorporates both the edit distance between the untimed words and the absolute difference in timestamps. Our edit distance between two timed words is computable in polynomial time. Further, we show that the edit distance between a timed word and a timed language generated by a timed automaton, defined as the edit distance between the word and the closest word in the language, is PSPACE-complete. While computing the edit distance between two timed automata is undecidable, we show that the approximate version, where we decide if the edit distance between two timed automata is either less than a given parameter or more than delta away from the parameter, for delta>0, can be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques can be generalized to the setting of hybrid systems, and we show analogous decidability results for rectangular automata."}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"}],"has_accepted_license":"1","publisher":"IST Austria","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, <i>Edit distance for timed automata</i>. IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. <i>Edit Distance for Timed Automata</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">https://doi.org/10.15479/AT:IST-2013-144-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Timed Automata</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">10.15479/AT:IST-2013-144-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Majumdar, R. (2013). <i>Edit distance for timed automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">https://doi.org/10.15479/AT:IST-2013-144-v1-1</a>","ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. <i>Edit Distance for Timed Automata</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">10.15479/AT:IST-2013-144-v1-1</a>"},"department":[{"_id":"KrCh"}],"title":"Edit distance for timed automata","type":"technical_report","date_created":"2018-12-12T11:39:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T06:02:53Z","_id":"5409","day":"30","publication_identifier":{"issn":["2664-1690"]}},{"publication_identifier":{"issn":["2664-1690"]},"day":"03","_id":"5410","date_updated":"2025-05-19T11:10:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:10Z","type":"technical_report","department":[{"_id":"KrCh"}],"title":"Automatic generation of alternative starting positions for traditional board games","author":[{"full_name":"Ahmed, Umair","last_name":"Ahmed","first_name":"Umair"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Gulwani, Sumit","last_name":"Gulwani","first_name":"Sumit"}],"publisher":"IST Austria","has_accepted_license":"1","citation":{"mla":"Ahmed, Umair, et al. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">10.15479/AT:IST-2013-146-v1-1</a>.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, <i>Automatic generation of alternative starting positions for traditional board games</i>. IST Austria, 2013.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">https://doi.org/10.15479/AT:IST-2013-146-v1-1</a>.","apa":"Ahmed, U., Chatterjee, K., &#38; Gulwani, S. (2013). <i>Automatic generation of alternative starting positions for traditional board games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">https://doi.org/10.15479/AT:IST-2013-146-v1-1</a>","ama":"Ahmed U, Chatterjee K, Gulwani S. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">10.15479/AT:IST-2013-146-v1-1</a>","short":"U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p."},"status":"public","ddc":["000","005"],"publication_status":"published","abstract":[{"text":"Board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in development of mathematical and logical skills, but also in emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. \r\nOur approach generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. Also, the presence of such states for standard game variants like Tic-Tac-Toe on board size 4x4 opens up new games to be played that have not been played for ages since the default start state is heavily biased. ","lang":"eng"}],"file":[{"date_created":"2018-12-12T11:54:06Z","checksum":"409f3aaaf1184e4057b89cbb449dac80","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":818189,"access_level":"open_access","file_name":"IST-2013-146-v1+1_main.pdf","file_id":"5528","date_updated":"2020-07-14T12:46:46Z"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"month":"12","oa_version":"Published Version","doi":"10.15479/AT:IST-2013-146-v1-1","page":"13","related_material":{"record":[{"id":"1481","relation":"later_version","status":"public"}]},"year":"2013","file_date_updated":"2020-07-14T12:46:46Z","pubrep_id":"146","language":[{"iso":"eng"}],"date_published":"2013-12-03T00:00:00Z"},{"date_published":"2013-08-01T00:00:00Z","language":[{"iso":"eng"}],"pubrep_id":"195","file_date_updated":"2020-07-14T12:47:10Z","volume":8044,"page":"174-190","doi":"10.1007/978-3-642-39799-8_11","article_processing_charge":"No","oa_version":"None","conference":{"end_date":"2013-07-19","location":"Saint Petersburg, Russia","start_date":"2013-07-13","name":"CAV: Computer Aided Verification"},"file":[{"file_size":236480,"creator":"dernst","file_name":"2013_CAV_Dragoi.pdf","date_updated":"2020-07-14T12:47:10Z","file_id":"5748","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"a901cc6b71db08b61c0d4c0cbacc6287","date_created":"2018-12-18T13:13:33Z"}],"publication":"Computer Aided Verification","series_title":"CAV","status":"public","publisher":"Springer Berlin Heidelberg","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"full_name":"Gupta, Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_updated":"2025-07-10T11:52:57Z","day":"01","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"}],"year":"2013","intvolume":"      8044","month":"08","oa":1,"scopus_import":"1","publication_status":"published","ddc":["005"],"citation":{"apa":"Dragoi, C., Gupta, A., &#38; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In <i>Computer Aided Verification</i> (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>","ama":"Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: <i>Computer Aided Verification</i>. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.","ista":"Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.","mla":"Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” <i>Computer Aided Verification</i>, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>.","ieee":"C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in <i>Computer Aided Verification</i>, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.","chicago":"Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In <i>Computer Aided Verification</i>, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>."},"has_accepted_license":"1","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","quality_controlled":"1","department":[{"_id":"ToHe"}],"date_created":"2018-12-18T13:10:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5747","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642397998"],"eissn":["1611-3349"],"isbn":["9783642397981"]}},{"external_id":{"arxiv":["1209.3617"]},"arxiv":1,"year":"2013","intvolume":"      7721","month":"01","alternative_title":["LNCS"],"scopus_import":"1","oa":1,"publication_status":"published","acknowledgement":"Work of the second author supported by the Sino-Danish Center for the Theory of Interactive Computation, funded by the Danish National Research Foundation and the National Science Foundation of China (under the grant 61061130540). The second author acknowledge support from the Center for research in the Foundations of Electronic Markets (CFEM), supported by the Danish Strategic Research Council. The first author was supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, in:, Mathematical and Engineering Methods in Computer Science, Springer Nature, 2013, pp. 106–117.","ista":"Chatterjee K, Ibsen-Jensen R. 2013. Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. Mathematical and Engineering Methods in Computer Science. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7721, 106–117.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2013). Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. In <i>Mathematical and Engineering Methods in Computer Science</i> (Vol. 7721, pp. 106–117). Znojmo, Czech Republic: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-36046-6_11\">https://doi.org/10.1007/978-3-642-36046-6_11</a>","ama":"Chatterjee K, Ibsen-Jensen R. Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. In: <i>Mathematical and Engineering Methods in Computer Science</i>. Vol 7721. Springer Nature; 2013:106-117. doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6_11\">10.1007/978-3-642-36046-6_11</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Strategy complexity of finite-horizon Markov decision processes and simple stochastic games,” in <i>Mathematical and Engineering Methods in Computer Science</i>, Znojmo, Czech Republic, 2013, vol. 7721, pp. 106–117.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games.” In <i>Mathematical and Engineering Methods in Computer Science</i>, 7721:106–17. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36046-6_11\">https://doi.org/10.1007/978-3-642-36046-6_11</a>.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games.” <i>Mathematical and Engineering Methods in Computer Science</i>, vol. 7721, Springer Nature, 2013, pp. 106–17, doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6_11\">10.1007/978-3-642-36046-6_11</a>."},"title":"Strategy complexity of finite-horizon Markov decision processes and simple stochastic games","quality_controlled":"1","department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1209.3617"}],"date_created":"2025-07-10T14:08:49Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"19995","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642360466"],"isbn":["9783642360442"],"eissn":["1611-3349"]},"OA_place":"repository","date_published":"2013-01-17T00:00:00Z","OA_type":"green","language":[{"iso":"eng"}],"volume":7721,"page":"106-117","article_processing_charge":"No","doi":"10.1007/978-3-642-36046-6_11","oa_version":"Preprint","conference":{"location":"Znojmo, Czech Republic","start_date":"2012-10-25","name":"MEMICS: Mathematical and Engineering Methods in Computer Science","end_date":"2012-10-28"},"publication":"Mathematical and Engineering Methods in Computer Science","corr_author":"1","abstract":[{"text":"Markov decision processes (MDPs) and simple stochastic games (SSGs) provide a rich mathematical framework to study many important problems related to probabilistic systems. MDPs and SSGs with finite-horizon objectives, where the goal is to maximize the probability to reach a target state in a given finite time, is a classical and well-studied problem. In this work we consider the strategy complexity of finite-horizon MDPs and SSGs. We show that for all ε > 0, the natural class of counter-based strategies require at most log log/(1/ε) + n + 1 memory states, and memory of size Omega(log log(1/ε) + n) is required, for ε-optimality, where n is the number of states of the MDP (resp. SSG). Thus our bounds are asymptotically optimal. We then study the periodic property of optimal strategies, and show a sub-exponential lower bound on the period for optimal strategies.","lang":"eng"}],"status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389"}],"publisher":"Springer Nature","type":"conference","date_updated":"2025-09-23T09:24:13Z","day":"17","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"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}]},{"publist_id":"5067","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2009","quality_controlled":"1","department":[{"_id":"CaUh"}],"title":"Privacy-preserving data sharing for genome-wide association studies","date_created":"2018-12-11T11:55:11Z","main_file_link":[{"open_access":"1","url":"http://repository.cmu.edu/jpc/vol5/iss1/6"}],"citation":{"ista":"Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 5(1), 137–166.","short":"C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality  5 (2013) 137–166.","ama":"Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. 2013;5(1):137-166. doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>","apa":"Uhler, C., Slavkovic, A., &#38; Fienberg, S. (2013). Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>","chicago":"Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University, 2013. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>.","ieee":"C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing for genome-wide association studies,” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.","mla":"Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1, Carnegie Mellon University, 2013, pp. 137–66, doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>."},"oa":1,"ddc":["000"],"publication_status":"published","month":"08","intvolume":"         5","year":"2013","day":"01","date_updated":"2026-06-18T18:20:21Z","type":"journal_article","author":[{"orcid":"0000-0002-7008-0216","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","last_name":"Uhler"},{"first_name":"Aleksandra","full_name":"Slavkovic, Aleksandra","last_name":"Slavkovic"},{"first_name":"Stephen","last_name":"Fienberg","full_name":"Fienberg, Stephen"}],"publisher":"Carnegie Mellon University","publication":"Journal of Privacy and Confidentiality ","issue":"1","status":"public","abstract":[{"lang":"eng","text":"Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression."}],"oa_version":"Published Version","volume":5,"doi":"10.29012/jpc.v5i1.629","article_processing_charge":"No","page":"137 - 166","language":[{"iso":"eng"}],"date_published":"2013-08-01T00:00:00Z"},{"oa_version":"Published Version","issue":"2","publication":"The Annals of Statistics","abstract":[{"lang":"eng","text":"Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case."}],"status":"public","language":[{"iso":"eng"}],"date_published":"2013-04-01T00:00:00Z","volume":41,"page":"436 - 463","doi":"10.1214/12-AOS1080","article_processing_charge":"No","date_updated":"2026-06-18T18:20:45Z","day":"01","isi":1,"publisher":"Institute of Mathematical Statistics","author":[{"full_name":"Uhler, Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216"},{"full_name":"Raskutti, Garvesh","last_name":"Raskutti","first_name":"Garvesh"},{"last_name":"Bühlmann","full_name":"Bühlmann, Peter","first_name":"Peter"},{"first_name":"Bin","last_name":"Yu","full_name":"Yu, Bin"}],"type":"journal_article","month":"04","scopus_import":"1","oa":1,"publication_status":"published","ddc":["500"],"external_id":{"isi":["000320488200002"],"arxiv":["1207.0547"]},"arxiv":1,"year":"2013","intvolume":"        41","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2010","publist_id":"5066","citation":{"apa":"Uhler, C., Raskutti, G., Bühlmann, P., &#38; Yu, B. (2013). Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>","ama":"Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. 2013;41(2):436-463. doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>","ista":"Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 41(2), 436–463.","short":"C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013) 436–463.","mla":"Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>, vol. 41, no. 2, Institute of Mathematical Statistics, 2013, pp. 436–63, doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>.","chicago":"Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>. Institute of Mathematical Statistics, 2013. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>.","ieee":"C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness assumption in causal inference,” <i>The Annals of Statistics</i>, vol. 41, no. 2. Institute of Mathematical Statistics, pp. 436–463, 2013."},"title":"Geometry of the faithfulness assumption in causal inference","quality_controlled":"1","department":[{"_id":"CaUh"}],"main_file_link":[{"url":"www.doi.org/10.1214/12-AOS1080","open_access":"1"}],"date_created":"2018-12-11T11:55:11Z"},{"has_accepted_license":"1","pmid":1,"citation":{"chicago":"Schlögl, Alois, Peter M Jonas, C. Schmidt-Hieber, and S. J. Guzman. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” <i>Biomedical Engineering / Biomedizinische Technik</i>. De Gruyter, 2013. <a href=\"https://doi.org/10.1515/bmt-2013-4181\">https://doi.org/10.1515/bmt-2013-4181</a>.","ieee":"A. Schlögl, P. M. Jonas, C. Schmidt-Hieber, and S. J. Guzman, “Stimfit: A fast visualization and analysis environment for cellular neurophysiology,” <i>Biomedical Engineering / Biomedizinische Technik</i>, vol. 58, no. SI-1-Track-G. De Gruyter, 2013.","mla":"Schlögl, Alois, et al. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” <i>Biomedical Engineering / Biomedizinische Technik</i>, vol. 58, no. SI-1-Track-G, 000010151520134181, De Gruyter, 2013, doi:<a href=\"https://doi.org/10.1515/bmt-2013-4181\">10.1515/bmt-2013-4181</a>.","ista":"Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. 2013. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. Biomedical Engineering / Biomedizinische Technik. 58(SI-1-Track-G), 000010151520134181.","short":"A. Schlögl, P.M. Jonas, C. Schmidt-Hieber, S.J. Guzman, Biomedical Engineering / Biomedizinische Technik 58 (2013).","apa":"Schlögl, A., Jonas, P. M., Schmidt-Hieber, C., &#38; Guzman, S. J. (2013). Stimfit: A fast visualization and analysis environment for cellular neurophysiology. <i>Biomedical Engineering / Biomedizinische Technik</i>. Graz, Austria: De Gruyter. <a href=\"https://doi.org/10.1515/bmt-2013-4181\">https://doi.org/10.1515/bmt-2013-4181</a>","ama":"Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. <i>Biomedical Engineering / Biomedizinische Technik</i>. 2013;58(SI-1-Track-G). doi:<a href=\"https://doi.org/10.1515/bmt-2013-4181\">10.1515/bmt-2013-4181</a>"},"quality_controlled":"1","department":[{"_id":"PeJo"}],"title":"Stimfit: A fast visualization and analysis environment for cellular neurophysiology","date_created":"2021-12-01T14:35:35Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"10396","article_number":"000010151520134181","publication_identifier":{"issn":["0013-5585"],"eissn":["1862-278X"]},"year":"2013","external_id":{"isi":["000497714000034"],"pmid":["24042795"]},"keyword":["biomedical engineering","data analysis","free software"],"intvolume":"        58","month":"08","article_type":"original","oa":1,"publication_status":"published","ddc":["005","610"],"author":[{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas"},{"first_name":"C.","last_name":"Schmidt-Hieber","full_name":"Schmidt-Hieber, C."},{"first_name":"S. J.","full_name":"Guzman, S. J.","last_name":"Guzman"}],"publisher":"De Gruyter","type":"journal_article","date_updated":"2025-09-30T07:31:23Z","day":"01","isi":1,"file_date_updated":"2021-12-01T14:38:08Z","date_published":"2013-08-01T00:00:00Z","language":[{"iso":"eng"}],"volume":58,"doi":"10.1515/bmt-2013-4181","article_processing_charge":"No","oa_version":"Submitted Version","conference":{"name":"BMT: Biomedizinische Technik ","start_date":"2013-09-19","location":"Graz, Austria","end_date":"2013-09-21"},"publication":"Biomedical Engineering / Biomedizinische Technik","file":[{"file_size":149825,"creator":"schloegl","file_id":"10397","date_updated":"2021-12-01T14:38:08Z","file_name":"Schloegl_Abstract-BMT2013.pdf","access_level":"open_access","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2021-12-01T14:38:08Z","checksum":"cdfc5339b530a25d6079f7223f0b1f16"}],"issue":"SI-1-Track-G","status":"public","corr_author":"1","abstract":[{"text":"Stimfit is a free cross-platform software package for viewing and analyzing electrophysiological data. It supports most standard file types for cellular neurophysiology and other biomedical formats. Its analysis algorithms have been used and validated in several experimental laboratories. Its embedded Python scripting interface makes Stimfit highly extensible and customizable.","lang":"eng"}]},{"external_id":{"isi":["000331445200001"]},"year":"2013","intvolume":"         4","month":"11","scopus_import":"1","oa":1,"publication_status":"published","ddc":["580"],"citation":{"apa":"O’Brien, J., &#38; Benková, E. (2013). Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>","ama":"O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>","ista":"O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic stress responses. Frontiers in Plant Science. 4, 451.","short":"J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).","mla":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>, vol. 4, 451, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>.","chicago":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>.","ieee":"J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic stress responses,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013."},"has_accepted_license":"1","tmp":{"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","short":"CC BY (4.0)"},"title":"Cytokinin cross talking during biotic and abiotic stress responses","quality_controlled":"1","department":[{"_id":"EvBe"}],"date_created":"2018-12-11T11:48:43Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"827","article_number":"451","ec_funded":1,"publist_id":"6821","date_published":"2013-11-19T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:11Z","volume":4,"doi":"10.3389/fpls.2013.00451","article_processing_charge":"No","oa_version":"Published Version","file":[{"relation":"main_file","checksum":"fdc25ddd1bf9a99b99f662cdbafeddd4","date_created":"2019-01-31T10:40:38Z","file_size":953299,"creator":"dernst","date_updated":"2020-07-14T12:48:11Z","file_id":"5903","file_name":"2013_FrontiersPlant_OBrien.pdf","access_level":"open_access","content_type":"application/pdf"}],"publication":"Frontiers in Plant Science","corr_author":"1","abstract":[{"lang":"eng","text":"As sessile organisms, plants have to be able to adapt to a continuously changing environment. Plants that perceive some of these changes as stress signals activate signaling pathways to modulate their development and to enable them to survive. The complex responses to environmental cues are to a large extent mediated by plant hormones that together orchestrate the final plant response. The phytohormone cytokinin is involved in many plant developmental processes. Recently, it has been established that cytokinin plays an important role in stress responses, but does not act alone. Indeed, the hormonal control of plant development and stress adaptation is the outcome of a complex network of multiple synergistic and antagonistic interactions between various hormones. Here, we review the recent findings on the cytokinin function as part of this hormonal network. We focus on the importance of the crosstalk between cytokinin and other hormones, such as abscisic acid, jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development and stress adaptation. Finally, the impact of the current research in the biotechnological industry will be discussed."}],"status":"public","author":[{"first_name":"José","full_name":"O'Brien, José","last_name":"O'Brien"},{"last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Frontiers Research Foundation","type":"journal_article","date_updated":"2025-09-29T14:33:09Z","day":"19","isi":1,"project":[{"call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","name":"Hormonal cross-talk in plant organogenesis","grant_number":"207362"}]},{"oa":1,"scopus_import":"1","ddc":["580"],"publication_status":"published","month":"12","intvolume":"         4","external_id":{"isi":["000331533500002"]},"year":"2013","publist_id":"6820","article_number":"537","ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"828","title":"Systems approaches to study root architecture dynamics","department":[{"_id":"EvBe"}],"quality_controlled":"1","date_created":"2018-12-11T11:48:43Z","citation":{"short":"C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).","ista":"Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture dynamics. Frontiers in Plant Science. 4, 537.","ama":"Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>","apa":"Cuesta, C., Wabnik, K. T., &#38; Benková, E. (2013). Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>","ieee":"C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root architecture dynamics,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","chicago":"Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>.","mla":"Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>, vol. 4, 537, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>."},"has_accepted_license":"1","tmp":{"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","short":"CC BY (4.0)"},"file":[{"file_size":710835,"creator":"dernst","file_name":"2013_FrontiersPlant_Cuesta.pdf","date_updated":"2020-07-14T12:48:11Z","file_id":"5902","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2019-01-31T10:36:43Z","checksum":"0185b3c4d7df9a94bd3ce5a66d213506"}],"publication":"Frontiers in Plant Science","corr_author":"1","abstract":[{"lang":"eng","text":"The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation. Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how LRs and thereby root system architecture is established and developed."}],"status":"public","oa_version":"Published Version","volume":4,"doi":"10.3389/fpls.2013.00537","article_processing_charge":"No","date_published":"2013-12-26T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:11Z","day":"26","project":[{"name":"Hormonal cross-talk in plant organogenesis","grant_number":"207362","call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425"}],"isi":1,"date_updated":"2025-09-29T14:32:42Z","type":"journal_article","publisher":"Frontiers Research Foundation","author":[{"orcid":"0000-0003-1923-2410","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","first_name":"Candela","full_name":"Cuesta, Candela","last_name":"Cuesta"},{"orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof T","full_name":"Wabnik, Krzysztof T","last_name":"Wabnik"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Benková, Eva"}]},{"_id":"9459","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"issn":["0092-8674"],"eissn":["1097-4172"]},"pmid":1,"citation":{"ista":"Zemach A, Kim MY, Hsieh P-H, Coleman-Derr D, Eshed-Williams L, Thao K, Harmer SL, Zilberman D. 2013. The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. Cell. 153(1), 193–205.","short":"A. Zemach, M.Y. Kim, P.-H. Hsieh, D. Coleman-Derr, L. Eshed-Williams, K. Thao, S.L. Harmer, D. Zilberman, Cell 153 (2013) 193–205.","ama":"Zemach A, Kim MY, Hsieh P-H, et al. The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. <i>Cell</i>. 2013;153(1):193-205. doi:<a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">10.1016/j.cell.2013.02.033</a>","apa":"Zemach, A., Kim, M. Y., Hsieh, P.-H., Coleman-Derr, D., Eshed-Williams, L., Thao, K., … Zilberman, D. (2013). The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">https://doi.org/10.1016/j.cell.2013.02.033</a>","chicago":"Zemach, Assaf, M. Yvonne Kim, Ping-Hung Hsieh, Devin Coleman-Derr, Leor Eshed-Williams, Ka Thao, Stacey L. Harmer, and Daniel Zilberman. “The Arabidopsis Nucleosome Remodeler DDM1 Allows DNA Methyltransferases to Access H1-Containing Heterochromatin.” <i>Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">https://doi.org/10.1016/j.cell.2013.02.033</a>.","ieee":"A. Zemach <i>et al.</i>, “The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin,” <i>Cell</i>, vol. 153, no. 1. Elsevier, pp. 193–205, 2013.","mla":"Zemach, Assaf, et al. “The Arabidopsis Nucleosome Remodeler DDM1 Allows DNA Methyltransferases to Access H1-Containing Heterochromatin.” <i>Cell</i>, vol. 153, no. 1, Elsevier, 2013, pp. 193–205, doi:<a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">10.1016/j.cell.2013.02.033</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2013.02.033"}],"date_created":"2021-06-04T12:23:28Z","extern":"1","title":"The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin","quality_controlled":"1","department":[{"_id":"DaZi"}],"month":"03","publication_status":"published","article_type":"original","oa":1,"scopus_import":"1","external_id":{"pmid":["23540698"]},"year":"2013","intvolume":"       153","date_updated":"2021-12-14T08:25:35Z","day":"28","author":[{"first_name":"Assaf","full_name":"Zemach, Assaf","last_name":"Zemach"},{"first_name":"M. Yvonne","last_name":"Kim","full_name":"Kim, M. Yvonne"},{"first_name":"Ping-Hung","last_name":"Hsieh","full_name":"Hsieh, Ping-Hung"},{"last_name":"Coleman-Derr","full_name":"Coleman-Derr, Devin","first_name":"Devin"},{"first_name":"Leor","last_name":"Eshed-Williams","full_name":"Eshed-Williams, Leor"},{"first_name":"Ka","full_name":"Thao, Ka","last_name":"Thao"},{"first_name":"Stacey L.","full_name":"Harmer, Stacey L.","last_name":"Harmer"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","full_name":"Zilberman, Daniel","last_name":"Zilberman"}],"publisher":"Elsevier","type":"journal_article","oa_version":"Published Version","abstract":[{"text":"Nucleosome remodelers of the DDM1/Lsh family are required for DNA methylation of transposable elements, but the reason for this is unknown. How DDM1 interacts with other methylation pathways, such as small-RNA-directed DNA methylation (RdDM), which is thought to mediate plant asymmetric methylation through DRM enzymes, is also unclear. Here, we show that most asymmetric methylation is facilitated by DDM1 and mediated by the methyltransferase CMT2 separately from RdDM. We find that heterochromatic sequences preferentially require DDM1 for DNA methylation and that this preference depends on linker histone H1. RdDM is instead inhibited by heterochromatin and absolutely requires the nucleosome remodeler DRD1. Together, DDM1 and RdDM mediate nearly all transposon methylation and collaborate to repress transposition and regulate the methylation and expression of genes. Our results indicate that DDM1 provides DNA methyltransferases access to H1-containing heterochromatin to allow stable silencing of transposable elements in cooperation with the RdDM pathway.","lang":"eng"}],"status":"public","issue":"1","publication":"Cell","date_published":"2013-03-28T00:00:00Z","language":[{"iso":"eng"}],"page":"193-205","article_processing_charge":"No","doi":"10.1016/j.cell.2013.02.033","volume":153}]