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.
79 Publications
2014 |Published| Technical Report | IST-REx-ID: 5424 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5426 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5423 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5427 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5425 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5415 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5421 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5428 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5399 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5403 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Technical Report | IST-REx-ID: 5402 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
2013 |Published| Technical Report | IST-REx-ID: 5400 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5404 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5405 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5409 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5406 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5408 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 5410 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
2013 |Published| Technical Report | IST-REx-ID: 6440 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Replacing competition with cooperation to achieve scalable lock-free FIFO queues
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
2012 |Published| Technical Report | IST-REx-ID: 5377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.