[{"author":[{"id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","full_name":"Porsche, Jana","last_name":"Porsche","first_name":"Jana"}],"has_accepted_license":"1","_id":"5401","month":"03","pubrep_id":"113","title":"Initiatives and projects related to RD","department":[{"_id":"E-Lib"}],"date_created":"2018-12-12T11:39:07Z","oa_version":"Published Version","publication_status":"published","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}],"publisher":"IST Austria","type":"report","date_published":"2013-03-20T00:00:00Z","year":"2013","citation":{"ista":"Porsche J. 2013. Initiatives and projects related to RD, IST Austria,p.","short":"J. Porsche, Initiatives and Projects Related to RD, IST Austria, 2013.","mla":"Porsche, Jana. <i>Initiatives and Projects Related to RD</i>. IST Austria, 2013.","ieee":"J. Porsche, <i>Initiatives and projects related to RD</i>. IST Austria, 2013.","chicago":"Porsche, Jana. <i>Initiatives and Projects Related to RD</i>. IST Austria, 2013.","apa":"Porsche, J. (2013). <i>Initiatives and projects related to RD</i>. IST Austria.","ama":"Porsche J. <i>Initiatives and Projects Related to RD</i>. IST Austria; 2013."},"date_updated":"2020-07-14T23:04:47Z","oa":1,"abstract":[{"text":"This document is created as a part of the project “Repository for Research Data at IST Austria”. It summarises the actual initiatives, projects and standards related to the project. It supports the preparation of standards and specifications for the project, which should be considered and followed to ensure interoperability and visibility of the uploaded data.","lang":"eng"}],"day":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"status":"public","file":[{"file_id":"5536","creator":"system","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:45Z","file_name":"IST-2013-113-v1+1_Initiatives_and_projects_related_to_RD.pdf","content_type":"application/pdf","date_created":"2018-12-12T11:54:14Z","checksum":"d68712db838432ecdacf9ffb1de8f8a6","file_size":151208}]},{"oa":1,"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."}],"day":"12","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-123-v1-1","type":"technical_report","date_published":"2013-06-12T00:00:00Z","year":"2013","citation":{"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>.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","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>","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>","ieee":"T. A. Henzinger and A. Sezgin, <i>How free is your linearizable concurrent data structure?</i> IST Austria, 2013.","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>."},"date_updated":"2020-07-14T23:04:47Z","ddc":["000","004"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":249790,"checksum":"ce580605ae9756a8c99d7b403ebb8eed","date_created":"2018-12-12T11:53:19Z","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:45Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5480"}],"pubrep_id":"123","alternative_title":["IST Austria Technical Report"],"month":"06","title":"How free is your linearizable concurrent data structure?","date_created":"2018-12-12T11:39:07Z","department":[{"_id":"ToHe"}],"publication_status":"published","oa_version":"Published Version","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin"}],"has_accepted_license":"1","_id":"5402","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}],"page":"16"},{"day":"03","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-126-v1-1","oa":1,"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."}],"year":"2013","citation":{"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>","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>","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>.","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>.","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."},"date_updated":"2023-02-23T12:22:53Z","type":"technical_report","date_published":"2013-07-03T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:45Z","content_type":"application/pdf","file_name":"IST-2013-126-v1+1_soda_full.pdf","date_created":"2018-12-12T11:53:49Z","checksum":"063868c665beec37bf28160e2a695746","file_size":434523,"file_id":"5510","creator":"system","access_level":"open_access","relation":"main_file"}],"ddc":["000","005"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"524"}]},"date_created":"2018-12-12T11:39:08Z","department":[{"_id":"KrCh"}],"publication_status":"published","oa_version":"Published Version","pubrep_id":"126","alternative_title":["IST Austria Technical Report"],"title":"Qualitative analysis of concurrent mean-payoff games","month":"07","has_accepted_license":"1","_id":"5403","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"publisher":"IST Austria","page":"33","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:45Z","page":"29","publisher":"IST Austria","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","_id":"5404","month":"07","alternative_title":["IST Austria Technical Report"],"pubrep_id":"127","title":"The complexity of ergodic games","department":[{"_id":"KrCh"}],"date_created":"2018-12-12T11:39:08Z","oa_version":"Published Version","publication_status":"published","status":"public","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"2162","status":"public"}]},"file":[{"file_name":"IST-2013-127-v1+1_ergodic.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:45Z","file_size":517275,"checksum":"79ee5e677a82611ce06e0360c69d494a","date_created":"2018-12-12T11:53:35Z","creator":"system","file_id":"5496","relation":"main_file","access_level":"open_access"}],"type":"technical_report","date_published":"2013-07-03T00:00:00Z","year":"2013","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, 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>.","ista":"Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.","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>","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>","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."},"date_updated":"2023-02-23T10:30:55Z","oa":1,"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"}],"publication_identifier":{"issn":["2664-1690"]},"day":"03","doi":"10.15479/AT:IST-2013-127-v1-1"},{"title":"Perfect-information stochastic mean-payoff parity games","pubrep_id":"128","month":"07","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2018-12-12T11:39:09Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","first_name":"Hugo","last_name":"Gimbert"},{"last_name":"Oualhadj","first_name":"Youssouf","full_name":"Oualhadj, Youssouf"}],"_id":"5405","has_accepted_license":"1","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:45Z","language":[{"iso":"eng"}],"page":"22","abstract":[{"lang":"eng","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)."}],"oa":1,"doi":"10.15479/AT:IST-2013-128-v1-1","day":"08","publication_identifier":{"issn":["2664-1690"]},"date_published":"2013-07-08T00:00:00Z","type":"technical_report","date_updated":"2023-02-23T10:33:08Z","citation":{"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>","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>","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.","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>.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p."},"year":"2013","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"2212"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005","510"],"file":[{"date_created":"2018-12-12T11:53:54Z","checksum":"ede787a10e74e4f7db302fab8f12f3ca","file_size":387467,"date_updated":"2020-07-14T12:46:45Z","content_type":"application/pdf","file_name":"IST-2013-128-v1+1_full_stoch_mpp.pdf","relation":"main_file","access_level":"open_access","file_id":"5516","creator":"system"}]},{"oa":1,"abstract":[{"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.","lang":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"day":"08","doi":"10.15479/AT:IST-2013-130-v1-1","type":"technical_report","date_published":"2013-07-08T00:00:00Z","citation":{"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>","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>","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>.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, <i>Distributed synthesis for LTL Fragments</i>. IST Austria, 2013.","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>.","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."},"year":"2013","date_updated":"2023-02-21T17:01:26Z","status":"public","related_material":{"record":[{"id":"1376","relation":"later_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"file":[{"date_created":"2018-12-12T11:54:18Z","file_size":467895,"checksum":"855513ebaf6f72228800c5fdb522f93c","date_updated":"2020-07-14T12:46:45Z","content_type":"application/pdf","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","access_level":"open_access","relation":"main_file","file_id":"5540","creator":"system"}],"title":"Distributed synthesis for LTL Fragments","pubrep_id":"130","month":"07","alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:09Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","oa_version":"Published Version","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","_id":"5406","publisher":"IST Austria","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:45Z","page":"11"},{"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:46Z","publisher":"IST Austria","_id":"5407","has_accepted_license":"1","author":[{"id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","full_name":"Porsche, Jana","first_name":"Jana","last_name":"Porsche"}],"publication_status":"published","oa_version":"Published Version","date_created":"2018-12-12T11:39:09Z","department":[{"_id":"E-Lib"}],"month":"07","pubrep_id":"135","title":"Technical requirements and features","file":[{"file_id":"5463","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2013-135-v1+1_Features.pdf","content_type":"application/pdf","date_created":"2018-12-12T11:53:02Z","checksum":"9e4f9abf79a56f651f0012a34909880f","file_size":90311}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["020"],"date_updated":"2020-07-14T23:07:51Z","citation":{"ama":"Porsche J. <i>Technical Requirements and Features</i>. IST Austria; 2013.","apa":"Porsche, J. (2013). <i>Technical requirements and features</i>. IST Austria.","chicago":"Porsche, Jana. <i>Technical Requirements and Features</i>. IST Austria, 2013.","ieee":"J. Porsche, <i>Technical requirements and features</i>. IST Austria, 2013.","mla":"Porsche, Jana. <i>Technical Requirements and Features</i>. IST Austria, 2013.","short":"J. Porsche, Technical Requirements and Features, IST Austria, 2013.","ista":"Porsche J. 2013. Technical requirements and features, IST Austria,p."},"year":"2013","date_published":"2013-07-13T00:00:00Z","type":"report","day":"13","abstract":[{"lang":"eng","text":"This document is created as a part of the project “Repository for Research Data at IST Austria”. It summarises the mandatory features, which need to be fulfilled to provide an institutional repository as a platform and also a service to the scientists at the institute. It also includes optional features, which would be of strong benefit for the scientists and would increase the usage of the repository, and hence the visibility of research at IST Austria."}],"oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"status":"public","related_material":{"record":[{"relation":"later_version","id":"2213","status":"public"}]},"file":[{"date_created":"2018-12-12T11:53:16Z","file_size":300481,"checksum":"226bc791124f8d3138379778ce834e86","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2013-141-v1+1_main-tech-rpt.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5477","creator":"system"}],"abstract":[{"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. ","lang":"eng"}],"oa":1,"doi":"10.15479/AT:IST-2013-141-v1-1","publication_identifier":{"issn":["2664-1690"]},"day":"12","date_published":"2013-09-12T00:00:00Z","type":"technical_report","date_updated":"2023-02-23T10:33:11Z","year":"2013","citation":{"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.","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>","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>","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>."},"publisher":"IST Austria","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:46Z","page":"17","alternative_title":["IST Austria Technical Report"],"month":"09","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","pubrep_id":"141","oa_version":"Published Version","publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2018-12-12T11:39:10Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"full_name":"Nain, Sumit","first_name":"Sumit","last_name":"Nain"},{"full_name":"Vardi, Moshe","last_name":"Vardi","first_name":"Moshe"}],"_id":"5408","has_accepted_license":"1"},{"file":[{"date_created":"2018-12-12T11:53:08Z","file_size":336377,"checksum":"0f7633081ba8299c543322f0ad08571f","date_updated":"2020-07-14T12:46:46Z","content_type":"application/pdf","file_name":"IST-2013-144-v1+1_main.pdf","access_level":"open_access","relation":"main_file","file_id":"5469","creator":"system"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"related_material":{"record":[{"id":"2216","relation":"later_version","status":"public"}]},"date_updated":"2023-02-23T10:33:18Z","year":"2013","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.","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.","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>.","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>"},"date_published":"2013-10-30T00:00:00Z","type":"technical_report","doi":"10.15479/AT:IST-2013-144-v1-1","day":"30","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"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.","lang":"eng"}],"oa":1,"page":"12","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:46Z","publisher":"IST Austria","_id":"5409","has_accepted_license":"1","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"}],"oa_version":"Published Version","publication_status":"published","date_created":"2018-12-12T11:39:10Z","department":[{"_id":"KrCh"}],"month":"10","title":"Edit distance for timed automata","pubrep_id":"144","alternative_title":["IST Austria Technical Report"]},{"pubrep_id":"146","alternative_title":["IST Austria Technical Report"],"month":"12","title":"Automatic generation of alternative starting positions for traditional board games","oa_version":"Published Version","publication_status":"published","date_created":"2018-12-12T11:39:10Z","department":[{"_id":"KrCh"}],"author":[{"full_name":"Ahmed, Umair","last_name":"Ahmed","first_name":"Umair"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Gulwani","first_name":"Sumit","full_name":"Gulwani, Sumit"}],"_id":"5410","has_accepted_license":"1","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:46Z","language":[{"iso":"eng"}],"page":"13","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"}],"oa":1,"doi":"10.15479/AT:IST-2013-146-v1-1","publication_identifier":{"issn":["2664-1690"]},"day":"03","date_published":"2013-12-03T00:00:00Z","type":"technical_report","date_updated":"2023-02-23T10:00:50Z","citation":{"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>","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>.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, <i>Automatic generation of alternative starting positions for traditional board games</i>. IST Austria, 2013.","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>.","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."},"year":"2013","status":"public","ddc":["000","005"],"related_material":{"record":[{"relation":"later_version","id":"1481","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2013-146-v1+1_main.pdf","content_type":"application/pdf","date_created":"2018-12-12T11:54:06Z","checksum":"409f3aaaf1184e4057b89cbb449dac80","file_size":818189,"file_id":"5528","creator":"system","relation":"main_file","access_level":"open_access"}]},{"doi":"10.1007/978-3-642-39799-8_11","citation":{"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>.","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.","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>","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>.","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190."},"year":"2013","date_updated":"2023-09-05T14:16:07Z","volume":8044,"ddc":["005"],"date_created":"2018-12-18T13:10:21Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","intvolume":"      8044","pubrep_id":"195","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","scopus_import":"1","_id":"5747","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","first_name":"Cezara","last_name":"Dragoi"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","last_name":"Gupta"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer Berlin Heidelberg","quality_controlled":"1","ec_funded":1,"series_title":"CAV","page":"174-190","file_date_updated":"2020-07-14T12:47:10Z","publication_identifier":{"isbn":["9783642397981","9783642397998"],"issn":["0302-9743"],"eissn":["1611-3349"]},"oa":1,"type":"book_chapter","date_published":"2013-01-01T00:00:00Z","place":"Berlin, Heidelberg","file":[{"date_updated":"2020-07-14T12:47:10Z","content_type":"application/pdf","file_name":"2013_CAV_Dragoi.pdf","date_created":"2018-12-18T13:13:33Z","checksum":"a901cc6b71db08b61c0d4c0cbacc6287","file_size":236480,"file_id":"5748","creator":"dernst","access_level":"open_access","relation":"main_file"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"None","has_accepted_license":"1","publication":"Computer Aided Verification","conference":{"end_date":"2013-07-19","location":"Saint Petersburg, Russia","start_date":"2013-07-13","name":"CAV 2013"},"language":[{"iso":"eng"}]},{"_id":"590","author":[{"full_name":"Schmid, David","first_name":"David","last_name":"Schmid"},{"full_name":"Huang, Ting-Yu","last_name":"Huang","first_name":"Ting"},{"first_name":"Radhika","last_name":"Dirks","full_name":"Dirks, Radhika"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","last_name":"Hosten","orcid":"0000-0002-2031-204X","full_name":"Onur Hosten"},{"first_name":"Paul","last_name":"Kwiat","full_name":"Kwiat, Paul G"}],"publication_status":"published","date_created":"2018-12-11T11:47:22Z","alternative_title":["Optics InfoBase Conference Papers"],"title":"Polarization dependent focusing","month":"01","quality_controlled":0,"publisher":"OSA","conference":{"name":"QIM: Quantum Information and Measurement"},"date_updated":"2021-01-12T08:05:10Z","citation":{"ista":"Schmid D, Huang T, Dirks R, Hosten O, Kwiat P. 2013. Polarization dependent focusing. QIM: Quantum Information and Measurement, Optics InfoBase Conference Papers, .","short":"D. Schmid, T. Huang, R. Dirks, O. Hosten, P. Kwiat, in:, OSA, 2013.","mla":"Schmid, David, et al. <i>Polarization Dependent Focusing</i>. OSA, 2013, doi:<a href=\"https://doi.org/10.1364/QIM.2013.W6.23\">10.1364/QIM.2013.W6.23</a>.","chicago":"Schmid, David, Ting Huang, Radhika Dirks, Onur Hosten, and Paul Kwiat. “Polarization Dependent Focusing.” OSA, 2013. <a href=\"https://doi.org/10.1364/QIM.2013.W6.23\">https://doi.org/10.1364/QIM.2013.W6.23</a>.","ieee":"D. Schmid, T. Huang, R. Dirks, O. Hosten, and P. Kwiat, “Polarization dependent focusing,” presented at the QIM: Quantum Information and Measurement, 2013.","ama":"Schmid D, Huang T, Dirks R, Hosten O, Kwiat P. Polarization dependent focusing. In: OSA; 2013. doi:<a href=\"https://doi.org/10.1364/QIM.2013.W6.23\">10.1364/QIM.2013.W6.23</a>","apa":"Schmid, D., Huang, T., Dirks, R., Hosten, O., &#38; Kwiat, P. (2013). Polarization dependent focusing. Presented at the QIM: Quantum Information and Measurement, OSA. <a href=\"https://doi.org/10.1364/QIM.2013.W6.23\">https://doi.org/10.1364/QIM.2013.W6.23</a>"},"year":"2013","date_published":"2013-01-01T00:00:00Z","type":"conference","doi":"10.1364/QIM.2013.W6.23","day":"01","abstract":[{"text":"We present two methods of creating two orthogonally-polarized focal points at customizable relative locations. These schemes may be critical for enhancing entanglement sources and other applications.","lang":"eng"}],"publist_id":"7217","extern":1,"status":"public"},{"date_published":"2013-07-01T00:00:00Z","type":"journal_article","date_updated":"2021-01-12T08:05:12Z","year":"2013","citation":{"short":"D. Schmid, T. Huang, S. Hazrat, R. Dirks, O. Hosten, S. Quint, D. Thian, P. Kwiat, Optics Express 21 (2013) 15538–15552.","mla":"Schmid, David, et al. “Adjustable and Robust Methods for Polarization-Dependent Focusing.” <i>Optics Express</i>, vol. 21, no. 13, Optical Society of America, 2013, pp. 15538–52, doi:<a href=\"https://doi.org/10.1364/OE.21.015538\">10.1364/OE.21.015538</a>.","ista":"Schmid D, Huang T, Hazrat S, Dirks R, Hosten O, Quint S, Thian D, Kwiat P. 2013. Adjustable and robust methods for polarization-dependent focusing. Optics Express. 21(13), 15538–15552.","ama":"Schmid D, Huang T, Hazrat S, et al. Adjustable and robust methods for polarization-dependent focusing. <i>Optics Express</i>. 2013;21(13):15538-15552. doi:<a href=\"https://doi.org/10.1364/OE.21.015538\">10.1364/OE.21.015538</a>","apa":"Schmid, D., Huang, T., Hazrat, S., Dirks, R., Hosten, O., Quint, S., … Kwiat, P. (2013). Adjustable and robust methods for polarization-dependent focusing. <i>Optics Express</i>. Optical Society of America. <a href=\"https://doi.org/10.1364/OE.21.015538\">https://doi.org/10.1364/OE.21.015538</a>","ieee":"D. Schmid <i>et al.</i>, “Adjustable and robust methods for polarization-dependent focusing,” <i>Optics Express</i>, vol. 21, no. 13. Optical Society of America, pp. 15538–15552, 2013.","chicago":"Schmid, David, Ting Huang, Shiraz Hazrat, Radhika Dirks, Onur Hosten, Stephan Quint, Dickson Thian, and Paul Kwiat. “Adjustable and Robust Methods for Polarization-Dependent Focusing.” <i>Optics Express</i>. Optical Society of America, 2013. <a href=\"https://doi.org/10.1364/OE.21.015538\">https://doi.org/10.1364/OE.21.015538</a>."},"abstract":[{"lang":"eng","text":"We present two methods for the precise independent focusing of orthogonal linear polarizations of light at arbitrary relative locations. Our first scheme uses a displaced lens in a polarization Sagnac interferometer to provide adjustable longitudinal and lateral focal displacements via simple geometry; the second uses uniaxial crystals to achieve the same effect in a compact collinear setup. We develop the theoretical applications and limitations of our schemes, and provide experimental confirmation of our calculations."}],"publist_id":"7218","doi":"10.1364/OE.21.015538","day":"01","extern":1,"status":"public","volume":21,"author":[{"first_name":"David","last_name":"Schmid","full_name":"Schmid, David"},{"full_name":"Huang, Ting-Yu","last_name":"Huang","first_name":"Ting"},{"last_name":"Hazrat","first_name":"Shiraz","full_name":"Hazrat, Shiraz"},{"first_name":"Radhika","last_name":"Dirks","full_name":"Dirks, Radhika"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","full_name":"Onur Hosten","first_name":"Onur","last_name":"Hosten"},{"last_name":"Quint","first_name":"Stephan","full_name":"Quint, Stephan"},{"full_name":"Thian, Dickson","last_name":"Thian","first_name":"Dickson"},{"first_name":"Paul","last_name":"Kwiat","full_name":"Kwiat, Paul G"}],"issue":"13","_id":"591","publication":"Optics Express","month":"07","title":"Adjustable and robust methods for polarization-dependent focusing","intvolume":"        21","publication_status":"published","date_created":"2018-12-11T11:47:22Z","page":"15538 - 15552","quality_controlled":0,"publisher":"Optical Society of America"},{"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1016/j.jsc.2015.09.002"}]},"volume":50,"date_published":"2013-03-01T00:00:00Z","type":"journal_article","date_updated":"2021-01-12T08:05:15Z","citation":{"apa":"Hillar, C. J., &#38; Martin del Campo Sanchez, A. (2013). Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2012.06.006\">https://doi.org/10.1016/j.jsc.2012.06.006</a>","ama":"Hillar CJ, Martin del Campo Sanchez A. Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. <i>Journal of Symbolic Computation</i>. 2013;50:314-334. doi:<a href=\"https://doi.org/10.1016/j.jsc.2012.06.006\">10.1016/j.jsc.2012.06.006</a>","chicago":"Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness Theorems and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.” <i>Journal of Symbolic Computation</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.jsc.2012.06.006\">https://doi.org/10.1016/j.jsc.2012.06.006</a>.","ieee":"C. J. Hillar and A. Martin del Campo Sanchez, “Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals,” <i>Journal of Symbolic Computation</i>, vol. 50. Elsevier, pp. 314–334, 2013.","mla":"Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness Theorems and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.” <i>Journal of Symbolic Computation</i>, vol. 50, Elsevier, 2013, pp. 314–34, doi:<a href=\"https://doi.org/10.1016/j.jsc.2012.06.006\">10.1016/j.jsc.2012.06.006</a>.","short":"C.J. Hillar, A. Martin del Campo Sanchez, Journal of Symbolic Computation 50 (2013) 314–334.","ista":"Hillar CJ, Martin del Campo Sanchez A. 2013. Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. Journal of Symbolic Computation. 50, 314–334."},"year":"2013","abstract":[{"text":"We study chains of lattice ideals that are invariant under a symmetric group action. In our setting, the ambient rings for these ideals are polynomial rings which are increasing in (Krull) dimension. Thus, these chains will fail to stabilize in the traditional commutative algebra sense. However, we prove a theorem which says that “up to the action of the group”, these chains locally stabilize. We also give an algorithm, which we have implemented in software, for explicitly constructing these stabilization generators for a family of Laurent toric ideals involved in applications to algebraic statistics. We close with several open problems and conjectures arising from our theoretical and computational investigations.","lang":"eng"}],"doi":"10.1016/j.jsc.2012.06.006","publication_identifier":{"issn":["0747-7171"]},"day":"01","language":[{"iso":"eng"}],"page":"314-334","quality_controlled":"1","article_type":"original","publisher":"Elsevier","author":[{"full_name":"Hillar, Christopher J.","last_name":"Hillar","first_name":"Christopher J."},{"id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","full_name":"Martin del Campo Sanchez, Abraham","last_name":"Martin del Campo Sanchez","first_name":"Abraham"}],"_id":"5920","publication":"Journal of Symbolic Computation","title":"Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals","month":"03","intvolume":"        50","oa_version":"None","publication_status":"published","date_created":"2019-02-05T08:48:24Z","article_processing_charge":"No"},{"extern":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":32,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3604726/","open_access":"1"}],"oa":1,"publist_id":"7207","doi":"10.1038/emboj.2013.36","day":"20","date_published":"2013-03-20T00:00:00Z","type":"journal_article","date_updated":"2021-01-12T08:05:20Z","citation":{"ista":"Bernecky C, Cramer P. 2013. Struggling to let go: A non-coding RNA directs its own extension and destruction. EMBO Journal. 32(6), 771–772.","short":"C. Bernecky, P. Cramer, EMBO Journal 32 (2013) 771–772.","mla":"Bernecky, Carrie, and Patrick Cramer. “Struggling to Let Go: A Non-Coding RNA Directs Its Own Extension and Destruction.” <i>EMBO Journal</i>, vol. 32, no. 6, Wiley-Blackwell, 2013, pp. 771–72, doi:<a href=\"https://doi.org/10.1038/emboj.2013.36\">10.1038/emboj.2013.36</a>.","chicago":"Bernecky, Carrie, and Patrick Cramer. “Struggling to Let Go: A Non-Coding RNA Directs Its Own Extension and Destruction.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2013.36\">https://doi.org/10.1038/emboj.2013.36</a>.","ieee":"C. Bernecky and P. Cramer, “Struggling to let go: A non-coding RNA directs its own extension and destruction,” <i>EMBO Journal</i>, vol. 32, no. 6. Wiley-Blackwell, pp. 771–772, 2013.","ama":"Bernecky C, Cramer P. Struggling to let go: A non-coding RNA directs its own extension and destruction. <i>EMBO Journal</i>. 2013;32(6):771-772. doi:<a href=\"https://doi.org/10.1038/emboj.2013.36\">10.1038/emboj.2013.36</a>","apa":"Bernecky, C., &#38; Cramer, P. (2013). Struggling to let go: A non-coding RNA directs its own extension and destruction. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2013.36\">https://doi.org/10.1038/emboj.2013.36</a>"},"year":"2013","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"page":"771 - 772","month":"03","title":"Struggling to let go: A non-coding RNA directs its own extension and destruction","intvolume":"        32","publication_status":"published","oa_version":"None","article_processing_charge":"No","date_created":"2018-12-11T11:47:23Z","author":[{"orcid":"0000-0003-0893-7036","full_name":"Bernecky, Carrie A","first_name":"Carrie A","last_name":"Bernecky","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cramer, Patrick","first_name":"Patrick","last_name":"Cramer"}],"issue":"6","publication":"EMBO Journal","_id":"595"},{"language":[{"iso":"eng"}],"month":"12","article_number":"e1004011","oa_version":"Published Version","publication":"PLoS Genetics","has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"checksum":"299b6321be79931c7c17c5db6e69c711","file_size":4499039,"date_created":"2019-03-19T15:14:51Z","file_name":"2013_PLOS_Kodama-Namba.PDF","content_type":"application/pdf","date_updated":"2020-07-14T12:47:20Z","relation":"main_file","access_level":"open_access","creator":"kschuh","file_id":"6129"}],"oa":1,"publication_identifier":{"issn":["1553-7404"]},"date_published":"2013-12-19T00:00:00Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Public Library of Science (PLoS)","file_date_updated":"2020-07-14T12:47:20Z","quality_controlled":"1","title":"Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans","intvolume":"         9","publication_status":"published","date_created":"2019-03-19T14:58:51Z","author":[{"first_name":"Eiji","last_name":"Kodama-Namba","full_name":"Kodama-Namba, Eiji"},{"full_name":"Fenk, Lorenz A.","last_name":"Fenk","first_name":"Lorenz A."},{"full_name":"Bretscher, Andrew J.","last_name":"Bretscher","first_name":"Andrew J."},{"full_name":"Gross, Einav","last_name":"Gross","first_name":"Einav"},{"full_name":"Busch, K. Emanuel","last_name":"Busch","first_name":"K. Emanuel"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443"}],"issue":"12","pmid":1,"_id":"6128","extern":"1","ddc":["570"],"volume":9,"abstract":[{"lang":"eng","text":"Different interoceptive systems must be integrated to ensure that multiple homeostatic insults evoke appropriate behavioral and physiological responses. Little is known about how this is achieved. Using C. elegans, we dissect cross-modulation between systems that monitor temperature, O2 and CO2. CO2 is less aversive to animals acclimated to 15°C than those grown at 22°C. This difference requires the AFD neurons, which respond to both temperature and CO2 changes. CO2 evokes distinct AFD Ca2+ responses in animals acclimated at 15°C or 22°C. Mutants defective in synaptic transmission can reprogram AFD CO2 responses according to temperature experience, suggesting reprogramming occurs cell autonomously. AFD is exquisitely sensitive to CO2. Surprisingly, gradients of 0.01% CO2/second evoke very different Ca2+ responses from gradients of 0.04% CO2/second. Ambient O2 provides further contextual modulation of CO2 avoidance. At 21% O2 tonic signalling from the O2-sensing neuron URX inhibits CO2 avoidance. This inhibition can be graded according to O2 levels. In a natural wild isolate, a switch from 21% to 19% O2 is sufficient to convert CO2 from a neutral to an aversive cue. This sharp tuning is conferred partly by the neuroglobin GLB-5. The modulatory effects of O2 on CO2 avoidance involve the RIA interneurons, which are post-synaptic to URX and exhibit CO2-evoked Ca2+ responses. Ambient O2 and acclimation temperature act combinatorially to modulate CO2 responsiveness. Our work highlights the integrated architecture of homeostatic responses in C. elegans."}],"doi":"10.1371/journal.pgen.1004011","day":"19","external_id":{"pmid":["24385919"]},"date_updated":"2021-01-12T08:06:15Z","citation":{"ama":"Kodama-Namba E, Fenk LA, Bretscher AJ, Gross E, Busch KE, de Bono M. Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans. <i>PLoS Genetics</i>. 2013;9(12). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1004011\">10.1371/journal.pgen.1004011</a>","apa":"Kodama-Namba, E., Fenk, L. A., Bretscher, A. J., Gross, E., Busch, K. E., &#38; de Bono, M. (2013). Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans. <i>PLoS Genetics</i>. Public Library of Science (PLoS). <a href=\"https://doi.org/10.1371/journal.pgen.1004011\">https://doi.org/10.1371/journal.pgen.1004011</a>","chicago":"Kodama-Namba, Eiji, Lorenz A. Fenk, Andrew J. Bretscher, Einav Gross, K. Emanuel Busch, and Mario de Bono. “Cross-Modulation of Homeostatic Responses to Temperature, Oxygen and Carbon Dioxide in C. Elegans.” <i>PLoS Genetics</i>. Public Library of Science (PLoS), 2013. <a href=\"https://doi.org/10.1371/journal.pgen.1004011\">https://doi.org/10.1371/journal.pgen.1004011</a>.","ieee":"E. Kodama-Namba, L. A. Fenk, A. J. Bretscher, E. Gross, K. E. Busch, and M. de Bono, “Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans,” <i>PLoS Genetics</i>, vol. 9, no. 12. Public Library of Science (PLoS), 2013.","mla":"Kodama-Namba, Eiji, et al. “Cross-Modulation of Homeostatic Responses to Temperature, Oxygen and Carbon Dioxide in C. Elegans.” <i>PLoS Genetics</i>, vol. 9, no. 12, e1004011, Public Library of Science (PLoS), 2013, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1004011\">10.1371/journal.pgen.1004011</a>.","short":"E. Kodama-Namba, L.A. Fenk, A.J. Bretscher, E. Gross, K.E. Busch, M. de Bono, PLoS Genetics 9 (2013).","ista":"Kodama-Namba E, Fenk LA, Bretscher AJ, Gross E, Busch KE, de Bono M. 2013. Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans. PLoS Genetics. 9(12), e1004011."},"year":"2013"},{"publisher":"Oxford University Press","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-19T15:17:40Z","publication_status":"published","intvolume":"        41","title":"Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous recombination","_id":"6130","pmid":1,"issue":"20","author":[{"full_name":"Chen, Changchun","first_name":"Changchun","last_name":"Chen"},{"full_name":"Fenk, Lorenz A.","last_name":"Fenk","first_name":"Lorenz A."},{"last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"}],"volume":41,"ddc":["570"],"extern":"1","day":"01","doi":"10.1093/nar/gkt805","abstract":[{"text":"Cas9 is an RNA-guided double-stranded DNA nuclease that participates in clustered regularly interspaced short palindromic repeats (CRISPR)-mediated adaptive immunity in prokaryotes. CRISPR–Cas9 has recently been used to generate insertion and deletion mutations in Caenorhabditis elegans, but not to create tailored changes (knock-ins). We show that the CRISPR–CRISPR-associated (Cas) system can be adapted for efficient and precise editing of the C. elegans genome. The targeted double-strand breaks generated by CRISPR are substrates for transgene-instructed gene conversion. This allows customized changes in the C. elegans genome by homologous recombination: sequences contained in the repair template (the transgene) are copied by gene conversion into the genome. The possibility to edit the C. elegans genome at selected locations will facilitate the systematic study of gene function in this widely used model organism.","lang":"eng"}],"citation":{"ama":"Chen C, Fenk LA, de Bono M. Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous recombination. <i>Nucleic Acids Research</i>. 2013;41(20). doi:<a href=\"https://doi.org/10.1093/nar/gkt805\">10.1093/nar/gkt805</a>","apa":"Chen, C., Fenk, L. A., &#38; de Bono, M. (2013). Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous recombination. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkt805\">https://doi.org/10.1093/nar/gkt805</a>","chicago":"Chen, Changchun, Lorenz A. Fenk, and Mario de Bono. “Efficient Genome Editing in Caenorhabditis Elegans by CRISPR-Targeted Homologous Recombination.” <i>Nucleic Acids Research</i>. Oxford University Press, 2013. <a href=\"https://doi.org/10.1093/nar/gkt805\">https://doi.org/10.1093/nar/gkt805</a>.","ieee":"C. Chen, L. A. Fenk, and M. de Bono, “Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous recombination,” <i>Nucleic Acids Research</i>, vol. 41, no. 20. Oxford University Press, 2013.","mla":"Chen, Changchun, et al. “Efficient Genome Editing in Caenorhabditis Elegans by CRISPR-Targeted Homologous Recombination.” <i>Nucleic Acids Research</i>, vol. 41, no. 20, e193, Oxford University Press, 2013, doi:<a href=\"https://doi.org/10.1093/nar/gkt805\">10.1093/nar/gkt805</a>.","short":"C. Chen, L.A. Fenk, M. de Bono, Nucleic Acids Research 41 (2013).","ista":"Chen C, Fenk LA, de Bono M. 2013. Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous recombination. Nucleic Acids Research. 41(20), e193."},"year":"2013","date_updated":"2021-01-12T08:06:16Z","external_id":{"pmid":["24013562"]},"language":[{"iso":"eng"}],"oa_version":"Published Version","article_number":"e193","month":"11","has_accepted_license":"1","publication":"Nucleic Acids Research","file":[{"relation":"main_file","access_level":"open_access","file_id":"6131","creator":"kschuh","date_created":"2019-03-19T15:25:42Z","checksum":"0f1f127cefd043cb922b292e1cd16f02","file_size":340225,"date_updated":"2020-07-14T12:47:20Z","file_name":"2013_OUP_Chen.pdf","content_type":"application/pdf"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1362-4962","0305-1048"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2013-11-01T00:00:00Z"},{"quality_controlled":"1","page":"61-78","language":[{"iso":"eng"}],"editor":[{"first_name":"Peter","last_name":"Hegemann","full_name":"Hegemann, Peter"},{"last_name":"Sigrist","first_name":"Stephan","full_name":"Sigrist, Stephan"}],"publisher":"Walter de Gruyter","publication":"Optogenetics","_id":"6132","author":[{"first_name":"Mario","last_name":"de Bono","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schafer, W.R.","first_name":"W.R.","last_name":"Schafer"},{"first_name":"A.","last_name":"Gottschalk","full_name":"Gottschalk, A."}],"date_created":"2019-03-20T13:54:05Z","oa_version":"None","publication_status":"published","title":"Optogenetic actuation, inhibition, modulation and readout for neuronal networks generating behavior in the nematode Caenorhabditis elegans","month":"08","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","extern":"1","year":"2013","citation":{"ista":"de Bono M, Schafer WR, Gottschalk A. 2013.Optogenetic actuation, inhibition, modulation and readout for neuronal networks generating behavior in the nematode Caenorhabditis elegans. In: Optogenetics. , 61–78.","mla":"de Bono, Mario, et al. “Optogenetic Actuation, Inhibition, Modulation and Readout for Neuronal Networks Generating Behavior in the Nematode Caenorhabditis Elegans.” <i>Optogenetics</i>, edited by Peter Hegemann and Stephan Sigrist, Walter de Gruyter, 2013, pp. 61–78.","short":"M. de Bono, W.R. Schafer, A. Gottschalk, in:, P. Hegemann, S. Sigrist (Eds.), Optogenetics, Walter de Gruyter, 2013, pp. 61–78.","ieee":"M. de Bono, W. R. Schafer, and A. Gottschalk, “Optogenetic actuation, inhibition, modulation and readout for neuronal networks generating behavior in the nematode Caenorhabditis elegans,” in <i>Optogenetics</i>, P. Hegemann and S. Sigrist, Eds. Walter de Gruyter, 2013, pp. 61–78.","chicago":"Bono, Mario de, W.R. Schafer, and A. Gottschalk. “Optogenetic Actuation, Inhibition, Modulation and Readout for Neuronal Networks Generating Behavior in the Nematode Caenorhabditis Elegans.” In <i>Optogenetics</i>, edited by Peter Hegemann and Stephan Sigrist, 61–78. Walter de Gruyter, 2013.","ama":"de Bono M, Schafer WR, Gottschalk A. Optogenetic actuation, inhibition, modulation and readout for neuronal networks generating behavior in the nematode Caenorhabditis elegans. In: Hegemann P, Sigrist S, eds. <i>Optogenetics</i>. Walter de Gruyter; 2013:61-78.","apa":"de Bono, M., Schafer, W. R., &#38; Gottschalk, A. (2013). Optogenetic actuation, inhibition, modulation and readout for neuronal networks generating behavior in the nematode Caenorhabditis elegans. In P. Hegemann &#38; S. Sigrist (Eds.), <i>Optogenetics</i> (pp. 61–78). Walter de Gruyter."},"date_updated":"2021-01-12T08:06:16Z","type":"book_chapter","date_published":"2013-08-28T00:00:00Z","day":"28","publication_identifier":{"isbn":["9783110270723; 9783110270716"]}},{"volume":110,"ddc":["570"],"extern":"1","day":"27","doi":"10.1073/pnas.1217428110","abstract":[{"lang":"eng","text":"cGMP signaling is widespread in the nervous system. However, it has proved difficult to visualize and genetically probe endogenously evoked cGMP dynamics in neurons in vivo. Here, we combine cGMP and Ca2+ biosensors to image and dissect a cGMP signaling network in a Caenorhabditis elegans oxygen-sensing neuron. We show that a rise in O2 can evoke a tonic increase in cGMP that requires an atypical O2-binding soluble guanylate cyclase and that is sustained until oxygen levels fall. Increased cGMP leads to a sustained Ca2+ response in the neuron that depends on cGMP-gated ion channels. Elevated levels of cGMP and Ca2+ stimulate competing negative feedback loops that shape cGMP dynamics. Ca2+-dependent negative feedback loops, including activation of phosphodiesterase-1 (PDE-1), dampen the rise of cGMP. A different negative feedback loop, mediated by phosphodiesterase-2 (PDE-2) and stimulated by cGMP-dependent kinase (PKG), unexpectedly promotes cGMP accumulation following a rise in O2, apparently by keeping in check gating of cGMP channels and limiting activation of Ca2+-dependent negative feedback loops. Simultaneous imaging of Ca2+ and cGMP suggests that cGMP levels can rise close to cGMP channels while falling elsewhere. O2-evoked cGMP and Ca2+ responses are highly reproducible when the same neuron in an individual animal is stimulated repeatedly, suggesting that cGMP transduction has high intrinsic reliability. However, responses vary substantially across individuals, despite animals being genetically identical and similarly reared. This variability may reflect stochastic differences in expression of cGMP signaling components. Our work provides in vivo insights into the architecture of neuronal cGMP signaling."}],"year":"2013","citation":{"chicago":"Couto, A., S. Oda, V. O. Nikolaev, Z. Soltesz, and Mario de Bono. “In Vivo Genetic Dissection of O2-Evoked CGMP Dynamics in a Caenorhabditis Elegans Gas Sensor.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1217428110\">https://doi.org/10.1073/pnas.1217428110</a>.","ieee":"A. Couto, S. Oda, V. O. Nikolaev, Z. Soltesz, and M. de Bono, “In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor,” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 35. Proceedings of the National Academy of Sciences, pp. E3301–E3310, 2013.","apa":"Couto, A., Oda, S., Nikolaev, V. O., Soltesz, Z., &#38; de Bono, M. (2013). In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1217428110\">https://doi.org/10.1073/pnas.1217428110</a>","ama":"Couto A, Oda S, Nikolaev VO, Soltesz Z, de Bono M. In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor. <i>Proceedings of the National Academy of Sciences</i>. 2013;110(35):E3301-E3310. doi:<a href=\"https://doi.org/10.1073/pnas.1217428110\">10.1073/pnas.1217428110</a>","ista":"Couto A, Oda S, Nikolaev VO, Soltesz Z, de Bono M. 2013. In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor. Proceedings of the National Academy of Sciences. 110(35), E3301–E3310.","short":"A. Couto, S. Oda, V.O. Nikolaev, Z. Soltesz, M. de Bono, Proceedings of the National Academy of Sciences 110 (2013) E3301–E3310.","mla":"Couto, A., et al. “In Vivo Genetic Dissection of O2-Evoked CGMP Dynamics in a Caenorhabditis Elegans Gas Sensor.” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 35, Proceedings of the National Academy of Sciences, 2013, pp. E3301–10, doi:<a href=\"https://doi.org/10.1073/pnas.1217428110\">10.1073/pnas.1217428110</a>."},"date_updated":"2021-01-12T08:06:16Z","external_id":{"pmid":["23940325"]},"publisher":"Proceedings of the National Academy of Sciences","quality_controlled":"1","page":"E3301-E3310","file_date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-20T14:05:06Z","publication_status":"published","intvolume":"       110","title":"In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor","pmid":1,"_id":"6133","issue":"35","author":[{"full_name":"Couto, A.","first_name":"A.","last_name":"Couto"},{"full_name":"Oda, S.","first_name":"S.","last_name":"Oda"},{"last_name":"Nikolaev","first_name":"V. O.","full_name":"Nikolaev, V. O."},{"first_name":"Z.","last_name":"Soltesz","full_name":"Soltesz, Z."},{"last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"}],"file":[{"date_created":"2019-03-20T14:07:53Z","file_size":2198763,"checksum":"3ee28a694f74a49f0d098970ae391a91","date_updated":"2020-07-14T12:47:20Z","content_type":"application/pdf","file_name":"2013_PNAS_Couto.pdf","access_level":"open_access","relation":"main_file","file_id":"6134","creator":"kschuh"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"issn":["0027-8424","1091-6490"]},"oa":1,"type":"journal_article","date_published":"2013-08-27T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Published Version","month":"08","has_accepted_license":"1","publication":"Proceedings of the National Academy of Sciences"},{"date_updated":"2021-01-12T08:06:17Z","citation":{"ista":"Rodriguez M, Snoek LB, de Bono M, Kammenga JE. 2013. Worms under stress: C. elegans stress response and its relevance to complex human disease and aging. Trends in Genetics. 29(6), 367–374.","mla":"Rodriguez, Miriam, et al. “Worms under Stress: C. Elegans Stress Response and Its Relevance to Complex Human Disease and Aging.” <i>Trends in Genetics</i>, vol. 29, no. 6, Elsevier, 2013, pp. 367–74, doi:<a href=\"https://doi.org/10.1016/j.tig.2013.01.010\">10.1016/j.tig.2013.01.010</a>.","short":"M. Rodriguez, L.B. Snoek, M. de Bono, J.E. Kammenga, Trends in Genetics 29 (2013) 367–374.","ieee":"M. Rodriguez, L. B. Snoek, M. de Bono, and J. E. Kammenga, “Worms under stress: C. elegans stress response and its relevance to complex human disease and aging,” <i>Trends in Genetics</i>, vol. 29, no. 6. Elsevier, pp. 367–374, 2013.","chicago":"Rodriguez, Miriam, L. Basten Snoek, Mario de Bono, and Jan E. Kammenga. “Worms under Stress: C. Elegans Stress Response and Its Relevance to Complex Human Disease and Aging.” <i>Trends in Genetics</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tig.2013.01.010\">https://doi.org/10.1016/j.tig.2013.01.010</a>.","apa":"Rodriguez, M., Snoek, L. B., de Bono, M., &#38; Kammenga, J. E. (2013). Worms under stress: C. elegans stress response and its relevance to complex human disease and aging. <i>Trends in Genetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tig.2013.01.010\">https://doi.org/10.1016/j.tig.2013.01.010</a>","ama":"Rodriguez M, Snoek LB, de Bono M, Kammenga JE. Worms under stress: C. elegans stress response and its relevance to complex human disease and aging. <i>Trends in Genetics</i>. 2013;29(6):367-374. doi:<a href=\"https://doi.org/10.1016/j.tig.2013.01.010\">10.1016/j.tig.2013.01.010</a>"},"year":"2013","date_published":"2013-06-01T00:00:00Z","type":"journal_article","doi":"10.1016/j.tig.2013.01.010","day":"01","publication_identifier":{"issn":["0168-9525"]},"abstract":[{"text":"Many organisms have stress response pathways, components of which share homology with players in complex human disease pathways. Research on stress response in the nematode worm Caenorhabditis elegans has provided detailed insights into the genetic and molecular mechanisms underlying complex human diseases. In this review we focus on four different types of environmental stress responses – heat shock, oxidative stress, hypoxia, and osmotic stress – and on how these can be used to study the genetics of complex human diseases. All four types of responses involve the genetic machineries that underlie a number of complex human diseases such as cancer and neurodegenerative diseases, including Alzheimer's and Parkinson's. We highlight the types of stress response experiments required to detect the genes and pathways underlying human disease and suggest that studying stress biology in worms can be translated to understanding human disease and provide potential targets for drug discovery.","lang":"eng"}],"volume":29,"extern":"1","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Trends in Genetics","_id":"6135","author":[{"full_name":"Rodriguez, Miriam","first_name":"Miriam","last_name":"Rodriguez"},{"last_name":"Snoek","first_name":"L. Basten","full_name":"Snoek, L. Basten"},{"orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kammenga","first_name":"Jan E.","full_name":"Kammenga, Jan E."}],"issue":"6","publication_status":"published","oa_version":"None","date_created":"2019-03-20T14:17:42Z","title":"Worms under stress: C. elegans stress response and its relevance to complex human disease and aging","month":"06","intvolume":"        29","page":"367-374","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Elsevier"}]