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.
1953 Publications
2014 |Published| Conference Paper | IST-REx-ID: 2219 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383, 1–18.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2227
Cires Rodriguez E, Baltisberger M, Cuesta C, Vargas P, Prieto J. 2014. Allopolyploid origin of the Balkan endemic Ranunculus wettsteinii (Ranunculaceae) inferred from nuclear and plastid DNA sequences. Organisms Diversity and Evolution. 14(1), 1–10.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2236 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349, 566–590.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2716 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
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: 475 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.
[Published Version]
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| Journal Article | IST-REx-ID: 2038 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[Submitted Version]
View
| Files available
| DOI
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