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 | OA
Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext Security from Low Noise LPN,” 8383:1–18. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 |Published| Conference Paper | IST-REx-ID: 2236 | OA
Jetchev, Dimitar, and Krzysztof Z Pietrzak. “How to Fake Auxiliary Input.” edited by Yehuda Lindell, 8349:566–90. Springer, 2014. https://doi.org/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. Instytut Matematyczny, 2014. https://doi.org/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. Oxford University Press, 2014. https://doi.org/10.1093/imrn/rnt350.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2905 | OA
Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.
[Submitted Version] View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2141 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/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.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 348
Cadavid, Doris, Maria Ibáñez, Umberto Anselmi Tamburini, Oscar Durá, Marco De La Torre, and Andreu Cabot. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” International Journal of Nanotechnology. Inderscience Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063787.
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 358
Herranz, Tirma, Maria Ibáñez, José Gómez De La Fuente, Francisco Pérez Alonso, Miguel Peña, Andreu Cabot, and Sergio Rojas. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem. Wiley-Blackwell, 2014. https://doi.org/10.1002/celc.201300254.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 10892
Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/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,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2211 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/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 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/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, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14.
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/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 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5425 | OA
Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria, 2014.
[Published Version] View | Files available
 

Filters and Search Terms

isbn%3D978-364254630-3

Search

Filter Publications