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
Simple chosen-ciphertext security from low noise LPN
E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 |Published| Conference Paper | IST-REx-ID: 2236 | OA
How to fake auxiliary input
D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 |Published| Journal Article | IST-REx-ID: 252
Counting rational points on del Pezzo surfaces with a conic bundle structure
T.D. Browning, M. Jones, Acta Arithmetica 163 (2014) 271–298.
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 254
The polynomial sieve and equal sums of like polynomials
T.D. Browning, International Mathematics Research Notices 2015 (2014) 1987–2019.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2905 | OA
Persistent homology: Theory and practice
H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.
[Submitted Version] View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2141 | OA [Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 |Published| Conference Paper | IST-REx-ID: 2054
Qualitative concurrent parity games: Bounded rationality
K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.
View | Files available | DOI
 

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

2014 |Published| Journal Article | IST-REx-ID: 358
In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles
T. Herranz, M. Ibáñez, J. Gómez De La Fuente, F. Pérez Alonso, M. Peña, A. Cabot, S. Rojas, ChemElectroChem 1 (2014) 885–895.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 10892
Planar matchings for weighted straight skeletons
T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 1903
Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
View | Files available | DOI
 

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

2014 |Published| Conference Paper | IST-REx-ID: 2162 | OA
The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Conference Paper | IST-REx-ID: 2213 | OA
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Conference Paper | IST-REx-ID: 2212
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2163 | OA
Games with a weak adversary
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Technical Report | IST-REx-ID: 5419 | OA
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, 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 | OA
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, 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 | OA
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, 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 | OA
Optimal cost almost-sure reachability in POMDPs
1 Anonymous, 2 Anonymous, 3 Anonymous, 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