Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Spindlerfv Mlýn, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-27660-6_9 

Edelsbrunner, H., &; Kerber, M. (2012). Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9382-4 

Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2011.11.004 

Bouajjani, A., Dragoi, C., Enea, C., &; Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer.https://doi.org/10.1007/978-3-642-27940-9_1 

Ion, A., Carreira, J., &; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126486