Please note that IST 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.

2972 Publications


2010 | Conference Paper | IST-REx-ID: 3850
Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.
View
 

2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2010 | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.25.6
View | Files available | DOI | arXiv
 

2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
View | Files available | DOI | Download Preprint (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
View | Files available | DOI
 

2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | Files available | DOI
 

Filters and Search Terms

extern<>1

Search

Filter Publications