Guillaume Houry
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Expected Complexity of Persistent Homology Computation via Matrix Reduction (available as arXiv preprint) | N/A | Paper |
| Expected complexity of barcode reduction Journal of Applied and Computational Topology | 2025-12-03 | Paper |
| Average complexity of matrix reduction for clique filtrations | 2025-01-17 | Paper |
| Keeping it sparse: computing persistent homology revisited CGT. Computing in Geometry and Topology | 2024-09-10 | Paper |
Research outcomes over time
This page was built for person: Guillaume Houry
