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.

7131 Publications


2011 | Published | Journal Article | IST-REx-ID: 3353 | OA
Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3362 | OA
Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Technical Report | IST-REx-ID: 5387 | OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
[Published Version] View | Files available | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5382 | OA
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3329 | OA
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2011 | Published | Journal Article | IST-REx-ID: 3374 | OA
Tkačik G, Walczak A. 2011. Information transmission in genetic regulatory networks a review. Journal of Physics: Condensed Matter. 23(15), 153102.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2011 | Published | Journal Article | IST-REx-ID: 3391 | OA
de Vladar H, Barton NH. 2011. The contribution of statistical physics to evolutionary biology. Trends in Ecology and Evolution. 26(8), 424–432.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed