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.
1850 Publications
2014 |Published| Conference Paper | IST-REx-ID: 2905 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.
[Submitted Version]
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2141 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 10892
Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2211 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2212
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2163 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Technical Report | IST-REx-ID: 5419 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5420 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5427 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5425 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2014. Optimal cost almost-sure reachability in POMDPs, IST Austria, 22p.
[Published Version]
View
| Files available
2014 |Published| Conference Paper | IST-REx-ID: 6740 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric channels. 52nd Annual Allerton Conference on Communication, Control, and Computing. Allerton Conference on Communication, Control, and Computing, 789–796.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 10885
Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
[Preprint]
View
| Files available
| DOI
| arXiv