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 | OA
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.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5425 | OA
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.
View | Files available
 

2014 | Technical Report | IST-REx-ID: 5426 | OA
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.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5427 | OA
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.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5428 | OA
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
View | Files available | DOI
 

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

2013 | Technical Report | IST-REx-ID: 5400 | OA
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.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5402 | OA
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5403 | OA
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5404 | OA
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5405 | OA
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.
View | Files available | DOI
 

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

2013 | Technical Report | IST-REx-ID: 5408 | OA
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.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5409 | OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5410 | OA
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.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 6440 | OA
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.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5377 | OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5378 | OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5396 | OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5379 | OA
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
View | Files available | DOI
 

Filters and Search Terms

issn=2664-1690

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed