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.

6561 Publications


2015 | Published | Journal Article | IST-REx-ID: 1789 | OA
Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome
Kuechler A, Zink A, Wieland T, Lüdecke H, Cremer K, Salviati L, Magini P, Najafi K, Zweier C, Czeschik J, Aretz S, Endele S, Tamburrino F, Pinato C, Clementi M, Gundlach J, Maylahn C, Mazzanti L, Wohlleber E, Schwarzmayr T, Kariminejad R, Schlessinger A, Wieczorek D, Strom T, Novarino G, Engels H. 2015. Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of Human Genetics. 23(6), 753–760.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2015 | Published | Journal Article | IST-REx-ID: 1793 | OA
DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots
O. Symonova, C. Topp, H. Edelsbrunner, PLoS One 10 (2015).
[Published Version] View | Files available | DOI
 

2015 | Published | Journal Article | IST-REx-ID: 2271 | OA
The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Journal Article | IST-REx-ID: 257 | OA
Pairs of diagonal quadratic forms and linear correlations among sums of two squares
T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050.
View | DOI | Download (ext.)
 

2015 | Submitted | Journal Article | IST-REx-ID: 271 | OA
Improvements in Birch's theorem on forms in many variables
T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik 2017 (n.d.) 203–234.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Journal Article | IST-REx-ID: 473 | OA
Derivation of nonlinear gibbs measures from many-body quantum mechanics
M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.
[Published Version] View | Files available | DOI
 

2015 | Published | Journal Article | IST-REx-ID: 523 | OA
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Published | Journal Article | IST-REx-ID: 524 | OA
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Technical Report | IST-REx-ID: 5429 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5434 | OA
Optimal cost indefinite-horizon reachability in goal DEC-POMDPs
1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.
[Published Version] View | Files available
 

2015 | Published | Technical Report | IST-REx-ID: 5435 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5436 | OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5439 | OA
The target discounted-sum problem
U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5443 | OA
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

oa=1

Search

Filter Publications

Display / Sort

Export / Embed