Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), https://doi.org/10.1007/978-94-007-7687-6_1__Cellular and Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer.https://doi.org/10.1007/978-94-007-7687-6_1 

Olsson, C., Ulen, J., Boykov, Y., &; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE.https://doi.org/10.1109/ICCV.2013.365 

Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &; Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. Wiley-Blackwell.https://doi.org/10.1002/hipo.22214 

Erdös, L., Bourgade, P., &; Yau, H. (2014). Universality of general ;2-ensembles. Duke Mathematical Journal. Duke University Press.https://doi.org/10.1215/00127094-2649752 

Chatterjee, K., Randour, M., &; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0182-6 

Edelsbrunner, H., &; Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House.https://doi.org/10.4171/120-1/3 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 

Chatterjee, K., &; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM.https://doi.org/10.1145/2597631 

Tkadik, G., Ghosh, A., Schneidman, E., &; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0085841 

Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_37 

Fischlin, M., Lehmann, A., &; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-013-9148-7 

Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B.,https://doi.org/10.1371/journal.pone.0107518__Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0107518 

Aminof, B., &; Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association.https://doi.org/10.4204/EPTCS.146.11 

Biedl, T., Huber, S., &; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature.https://doi.org/10.1007/978-3-319-13075-0_10 

Prizak, R., Ezard, T., &; Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell.https://doi.org/10.1002/ece3.1150 

Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer.https://doi.org/10.1007/978-3-662-44522-8_1 

Chatterjee, K., &; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2579821 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_11 

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_16