Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




4978 Publications

2014 | Journal Article | IST-REx-ID: 468 | OA
A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9. Public Library of Science, 2014.
[Published Version] View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 475 | OA
B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
[Published Version] View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 10892
T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 537 | OA
R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.
[Published Version] View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 2211 | OA
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2014 | Journal Article | IST-REx-ID: 2038 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
[Submitted Version] View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2162 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2213 | OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 

Filters and Search Terms

type<>research_data

Search

Filter Publications