Expected Complexity of Barcode Reduction

Barbara Giunti, Guillaume Houry, Michael Kerber, Matthias Söls

Open source

DOI
10.1007/s41468-025-00218-8
Published
2025-11-25
Container
Journal of Applied and Computational Topology
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s41468-025-00218-8,
  title = {Expected Complexity of Barcode Reduction},
  author = {Barbara Giunti and Guillaume Houry and Michael Kerber and Matthias Söls},
  year = {2025},
  journal = {Journal of Applied and Computational Topology},
  doi = {10.1007/s41468-025-00218-8},
  url = {https://doi.org/10.1007/s41468-025-00218-8}
}

RIS

TY  - JOUR
TI  - Expected Complexity of Barcode Reduction
AU  - Barbara Giunti
AU  - Guillaume Houry
AU  - Michael Kerber
AU  - Matthias Söls
PY  - 2025
JO  - Journal of Applied and Computational Topology
DO  - 10.1007/s41468-025-00218-8
UR  - https://doi.org/10.1007/s41468-025-00218-8
ER  - 

APA

Giunti, B., Houry, G., Kerber, M., & Söls, M. (2025). Expected Complexity of Barcode Reduction. Journal of Applied and Computational Topology. https://doi.org/10.1007/s41468-025-00218-8

Source records