F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” Theoretical Computer Science, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.

N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor,” European Journal of Neuroscience, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.

A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source software library for biomedical signal processing,” Computational Intelligence and Neuroscience, vol. 2011. Hindawi Publishing Corporation, 2011.

A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,” Science Signaling, vol. 4, no. 198. American Association for the Advancement of Science, 2011.

D. Schraivogel et al., “CAMT is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells,” EMBO Journal, vol. 30, no. 20. Wiley-Blackwell, pp. 4309–4322, 2011.

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.

K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.

K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.

K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.

K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.

K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.

C. Chen, D. Freedman, and C. Lampert, Enforcing topological constraints in random field image segmentation. IST Austria, 2011.

T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.

K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.

C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, United States, 2011, pp. 2089–2096.

T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocaw, Poland, 2011, vol. 6803, pp. 476–491.

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.

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.