A variance decomposition approach to the analysis of genetic algorithms
T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852.

Optical control of ligand-gated ion channels
S. Szobota, C. Mckenzie, H.L. Janovjak, Methods in Molecular Biology 998 (2013) 417–435.

ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip
E. Remy, P. Baster, J. Friml, P. Duque, Plant Signaling &; Behavior 8 (2013).

Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.

Digital signatures with minimal overhead from indifferentiable random invertible functions
E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.

Multi-objective discounted reward verification in graphs and MDPs
K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.

Infinite-state games with finitary conditions
K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.

Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.

Faster algorithms for Markov decision processes with low treewidth
K. Chatterjee, J. aCki, 8044 (2013) 543–558.

The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.

Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.

The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.

Quantitative reactive modeling and verification
T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.

Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.

Quantitative abstraction refinement
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.

Nondeterminism in the presence of a diverse or unknown future
U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.

P: Safe asynchronous event-driven programming
A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.

Elementary modal logics over transitive structures
J. Michaliszyn, J. Otop, 23 (2013) 563–577.

Local shape analysis for overlaid data structures
C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.

Synthesizing multiple boolean functions using interpolation on a single proof
G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.