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 E, Masny D, Pietrzak KZ. Simple chosen-ciphertext security from low noise LPN. In: Vol 8383. Springer; 2014: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 | OA
Jetchev D, Pietrzak KZ. How to fake auxiliary input. In: Lindell Y, ed. Vol 8349. Springer; 2014:566-590. 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 TD, Jones M. Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. 2014;163(3):271-298. doi:10.4064/aa163-3-6
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 254
Browning TD. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2014;2015(7):1987-2019. doi:10.1093/imrn/rnt350
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2905 | OA
Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3
[Submitted Version] View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2141 | OA
Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 2014;61(3). doi:10.1145/2597631
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 |Published| Conference Paper | IST-REx-ID: 2054
Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 348
Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. International Journal of Nanotechnology. 2014;11(9-11):773-784. doi:10.1504/IJNT.2014.063787
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 358
Herranz T, Ibáñez M, Gómez De La Fuente J, et al. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 2014;1(5):885-895. doi:10.1002/celc.201300254
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 10892
Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 1903
Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2211 | OA
Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2). doi:10.1145/2579821
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. 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 | OA
Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Vol 8412. Springer; 2014:242-257. 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 K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:10.1007/978-3-642-54830-7_14
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in Computer Science. Vol 8573. Springer; 2014:110-121. 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 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 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 | OA
Chatterjee K, Ibsen-Jensen R. 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 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 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 | OA
Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria; 2014.
[Published Version] View | Files available
 

Filters and Search Terms

isbn%3D978-3-95977-087-3

Search

Filter Publications