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.
1621 Publications
2014 |Published| Conference Paper | IST-REx-ID: 2219 | 
Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2236 |
Jetchev, Dimitar, and Krzysztof Z. Pietrzak. How to Fake Auxiliary Input. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:10.1007/978-3-642-54242-8_24.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 252
Browning, Timothy D., and Michael Jones. “Counting Rational Points on Del Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica, vol. 163, no. 3, Instytut Matematyczny, 2014, pp. 271–98, doi:10.4064/aa163-3-6.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 254
Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” International Mathematics Research Notices, vol. 2015, no. 7, Oxford University Press, 2014, pp. 1987–2019, doi:10.1093/imrn/rnt350.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2905 |
Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.
[Submitted Version]
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2141 |
Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2054
Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 348
Cadavid, Doris, et al. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” International Journal of Nanotechnology, vol. 11, no. 9–11, Inderscience Enterprises Limited , 2014, pp. 773–84, doi:10.1504/IJNT.2014.063787.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 358
Herranz, Tirma, et al. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem, vol. 1, no. 5, Wiley-Blackwell, 2014, pp. 885–95, doi:10.1002/celc.201300254.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 10892
Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 1903
Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2211 |
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2212
Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2163 |
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Technical Report | IST-REx-ID: 5419 |
Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5420 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5427 |
Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5425 |
Anonymous, 1, et al. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria, 2014.
[Published Version]
View
| Files available