Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
76 Publications
2014 | Technical Report | IST-REx-ID: 5424 |

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5425 |

1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Optimal cost almost-sure reachability in POMDPs. IST Austria, 2014.
View
| Files available
2014 | Technical Report | IST-REx-ID: 5426 |

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5427 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5428 |

K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5399 |

J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5400 |

K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5402 |

T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent data structure? IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5403 |

K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5404 |

K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5405 |

K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5406 |

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5408 |

K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5409 |

K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5410 |

U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative starting positions for traditional board games. IST Austria, 2013.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 6440 |

T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5377 |

K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |

K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5396 |

F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5379 |

K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
View
| Files available
| DOI