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.

4895 Publications


2016 | Journal Article | IST-REx-ID: 1148
C. Schilling, S. Bogomolov, T. A. Henzinger, A. Podelski, and J. Ruess, “Adaptive moment closure for parameter inference of biochemical reaction networks,” Biosystems, vol. 149. Elsevier, pp. 15–25, 2016.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1705 | OA
S. Bogomolov et al., “Guided search for hybrid systems based on coarse-grained space abstractions,” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4. Springer, pp. 449–467, 2016.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1707
J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.
View | DOI
 

2016 | Journal Article | IST-REx-ID: 1833 | OA
A. Klimova and T. Rudas, “On the closure of relational models,” Journal of Multivariate Analysis, vol. 143. Elsevier, pp. 440–452, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1881 | OA
J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed Wigner matrices,” Probability Theory and Related Fields, vol. 164, no. 1–2. Springer, pp. 165–241, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1411 | OA
J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” Israel Journal of Mathematics, vol. 212, no. 1. Springer, pp. 37–79, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1479 | OA
S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3. Springer, pp. 567–605, 2016.
[Submitted Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 478 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 479
Y. Jiang et al., “Use runtime verification to improve the quality of medical care practice,” in Proceedings of the 38th International Conference on Software Engineering Companion , Austin, TX, USA, 2016, pp. 112–121.
View | DOI
 

2016 | Conference Paper | IST-REx-ID: 480 | OA
K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1379 | OA
B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.
[Published Version] View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1477 | OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Journal Article | IST-REx-ID: 1529 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Technical Report | IST-REx-ID: 5445 | OA
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 

2016 | Technical Report | IST-REx-ID: 5449 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
[Updated Version] View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5446 | OA
1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis of recursive programs. IST Austria, 2016.
[Published Version] View | Files available
 

2016 | Technical Report | IST-REx-ID: 5447 | OA
1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.
[Published Version] View | Files available
 

2016 | Technical Report | IST-REx-ID: 5453 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5451 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

extern<>1

Search

Filter Publications