Please note that ISTA 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.
78 Publications
2014 | Technical Report | IST-REx-ID: 5426 | 
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5423 |
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5427 |
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5425 |
Optimal cost almost-sure reachability in POMDPs
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014.
[Published Version]
View
| Files available
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5415 |
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5421 |
The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
2014 | Technical Report | IST-REx-ID: 5428 |
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
2013 | Technical Report | IST-REx-ID: 5399 |
TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
2013 | Technical Report | IST-REx-ID: 5403 |
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
2013 | Technical Report | IST-REx-ID: 5402 |
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.