2 papers
math.AT2025
Expected Complexity of Persistence Barcode Computation via Matrix Reduction
Barbara Giunti, Guillaume Houry, Michael Kerber +1
We study the algorithmic complexity of computing the persistence barcode of a randomly generated filtration. We provide a general technique to bound the expected complexity of redu…
cs.CG2024
Keeping it sparse: Computing Persistent Homology revisited
Ulrich Bauer, Talha Bin Masood, Barbara Giunti +3
In this work, we study several variants of matrix reduction via Gaussian elimination that try to keep the reduced matrix sparse. The motivation comes from the growing field of topo…