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.

1850 Publications


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

2011 |Published| Conference Paper | IST-REx-ID: 3344
K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
View | DOI
 

2011 |Published| Conference Paper | IST-REx-ID: 3343 | OA
K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 |Published| Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 

2011 |Published| Journal Article | IST-REx-ID: 531 | OA
R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 |Published| Technical Report | IST-REx-ID: 5379 | OA
K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

2011 |Published| Technical Report | IST-REx-ID: 5381 | OA
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

2011 |Published| Technical Report | IST-REx-ID: 5380 | OA
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

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

2011 |Published| Conference Paper | IST-REx-ID: 3323
T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.
View | Files available | DOI
 

2011 |Published| Conference Paper | IST-REx-ID: 3366 | OA
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
[Submitted Version] View | Files available | DOI
 

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

2011 |Published| Journal Article | IST-REx-ID: 6298 | OA
N. S. Baranova et al., “The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers,” Journal of Biological Chemistry, vol. 286, no. 29. American Society for Biochemistry & Molecular Biology, pp. 25675–25686, 2011.
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 |Published| Conference Paper | IST-REx-ID: 757
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast indulgent algorithms,” presented at the ICDCN: International Conference on Distributed Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.
View | DOI
 

2011 |Published| Conference Paper | IST-REx-ID: 760
D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS, pp. 97–109.
View | DOI
 

2011 |Published| Journal Article | IST-REx-ID: 8025 | OA
A. R. Woodruff, L. M. McGarry, T. P. Vogels, M. Inan, S. A. Anderson, and R. Yuste, “State-dependent function of neocortical chandelier cells,” Journal of Neuroscience, vol. 31, no. 49. Society for Neuroscience, pp. 17872–17886, 2011.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

2011 |Published| Conference Paper | IST-REx-ID: 9648 | OA
R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in Computer Analysis of Images and Patterns, Seville, Spain, 2011, vol. 6854, pp. 286–293.
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 |Published| Conference Paper | IST-REx-ID: 9943 | OA
C. M. Sommer, C. Straehle, U. Köthe, and F. A. Hamprecht, “Ilastik: Interactive learning and segmentation toolkit,” in 2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro, Chicago, Illinois, USA, 2011.
[Preprint] View | DOI | Download Preprint (ext.)
 

2011 |Published| Conference Paper | IST-REx-ID: 10907
N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in Graph-Based Representations in Pattern Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
View | DOI
 

2011 |Published| Conference Paper | IST-REx-ID: 3238
E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.
View | Files available | DOI
 

Filters and Search Terms

isbn%3D978-3-030-00150-6

Search

Filter Publications