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.

337 Publications


2011 | Published | Conference Paper | IST-REx-ID: 3336
Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.
View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3337
Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. 2011. Learning anticipation policies for robot table tennis. IROS: Intelligent Robots and Systems, 332–337.
View | DOI
 

2011 | Submitted | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. Bounded rationality in concurrent parity games. arXiv, 1–51, 1107.2146.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Submitted | Preprint | IST-REx-ID: 3339 | OA
Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, 1107.2132.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

earlier version | 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: 3343 | OA
Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. 5th International Workshop on Reachability Problems. RP: Reachability Problems, LNCS, vol. 6945, 1–1.
View | DOI
 

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 | 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.) | WoS | arXiv
 

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: 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: 335
Ibáñez M, Fan J, Li W, Cadavid D, Nafria R, Carrete A, Cabot A. 2011. Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. Chemistry of Materials. 23(12), 3095–3104.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.
View | DOI
 

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 | Journal Article | IST-REx-ID: 3352
Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.
View | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3355 | OA
Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3358 | OA
Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 

Filters and Search Terms

year=2011

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed