U. Bauer, M. Kerber, and J. Reininghaus, Clear and Compress: Computing Persistent Homology in Chunks, 2013.
DOI : 10.1007/978-3-319-04099-8_7

J. Boissonnat and C. Maria, The simplex tree: An efficient data structure for general simplicial complexes, ESA, pp.731-742, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01108416

O. Busaryev, S. Cabello, C. Chen, T. K. Dey, and Y. Wang, Annotating Simplices with a Homology Basis and Its Applications, SWAT, pp.189-200, 2012.
DOI : 10.1007/978-3-642-31155-0_17

C. Chen and M. Kerber, Persistent homology computation with a twist, Proceedings 27th European Workshop on Computational Geometry, 2011.

C. Chen and M. Kerber, An output-sensitive algorithm for persistent homology, Computational Geometry, vol.46, issue.4, pp.435-447, 2013.
DOI : 10.1016/j.comgeo.2012.02.010

D. Cohen-steiner, H. Edelsbrunner, and J. Harer, Stability of Persistence Diagrams, Discrete & Computational Geometry, vol.37, issue.1, pp.103-120, 2007.
DOI : 10.1007/s00454-006-1276-5

V. De-silva, D. Morozov, and M. Vejdemo-johansson, Dualities in persistent (co)homology, Inverse Problems, vol.27, issue.12, p.124003, 2011.
DOI : 10.1088/0266-5611/27/12/124003

V. De-silva, D. Morozov, and M. Vejdemo-johansson, Persistent Cohomology and Circular Coordinates, Discrete & Computational Geometry, vol.33, issue.2, pp.737-759, 2011.
DOI : 10.1007/s00454-011-9344-x

K. Tamal, F. Dey, Y. Fan, and . Wang, Computing topological persistence for simplicial maps. CoRR, abs, 1208.

H. Edelsbrunner and J. Harer, Computational Topology -an Introduction, 2010.

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological Persistence and Simplification, Discrete & Computational Geometry, vol.28, issue.4, pp.511-533, 2002.
DOI : 10.1007/s00454-002-2885-2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Milosavljevic, D. Morozov, and P. Skraba, Zigzag persistent homology in matrix multiplication time, Proceedings of the 27th annual ACM symposium on Computational geometry, SoCG '11, 2011.
DOI : 10.1145/1998196.1998229

URL : https://hal.archives-ouvertes.fr/inria-00520171

D. Morozov, Persistence algorithm takes cubic time in worst case, BioGeometry News, Dept. Comput. Sci, 2005.

A. Zomorodian and G. Carlsson, Computing Persistent Homology, Discrete & Computational Geometry, vol.33, issue.2, pp.249-274, 2005.
DOI : 10.1007/s00454-004-1146-y

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=