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.
1790 Publications
2014 |Published| Conference Paper | IST-REx-ID: 2236 | 
D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2905 |
H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.
[Submitted Version]
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2141 |
K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 348
D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, and A. Cabot, “Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites,” International Journal of Nanotechnology, vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 773–784, 2014.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 10892
T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2211 |
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2163 |
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Technical Report | IST-REx-ID: 5419 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5420 |
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 |Published| 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.
[Published Version]
View
| Files available
| DOI
2014 |Published| 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.
[Published Version]
View
| Files available