U. Bauer. Ripser: efficient computation of Vietoris–Rips persistence barcodes. J. Appl. Comput. Topol. 5 (2021).
Clearing with cohomology, apparent and emergent pairs, recomputing columns.
U. Bauer, M. Kerber, J. Reininghaus, H. Wagner. PHAT – Persistent Homology Algorithms Toolbox. J. Symb. Comput. 78
(2017). Twist reduction, bit-tree pivot columns.
C. Chen, M. Kerber. Persistent homology computation with a twist. EuroCG (2011). Clearing.
T. Chaplin, H. A. Harrington, U. Tillmann. Grounded persistent path homology: a stable, topological descriptor for
weighted digraphs. Found. Comput. Math. (2024).
M. Čufar. Ripserer.jl: flexible and efficient persistent homology computation in Julia. JOSS 5 (2020). Involuted
persistence for representatives.
V. de Silva, D. Morozov, M. Vejdemo-Johansson. Dualities in persistent (co)homology. Inverse Problems 27 (2011).
H. Edelsbrunner, J. Harer. Computational Topology: An Introduction. AMS (2010).
H. Edelsbrunner, D. Letscher, A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom.
28 (2002). The standard algorithm.
D. Morozov, A. Nigmetov. Towards lockfree persistent homology. SPAA (2020). The parallel reduction.
N. Otter, M. A. Porter, U. Tillmann, P. Grindrod, H. A. Harrington. A roadmap for the computation of persistent
homology. EPJ Data Science 6 (2017).
J. Pérez, S. Hauke, U. Lupo, M. Caorsi, A. Dassatti. giotto-ph: a Python library for high-performance computation of
persistent homology of Vietoris–Rips filtrations. arXiv:2107.05412 (2021). Parallel apparent pairs and bases.