Barcode Computation
Barcode Computation is a computational method in persistent homology that represents the lifespan of topological features across a filtration by encoding each feature's birth and death parameters as an interval in a barcode diagram.
12
Publications
1.2K
Citations
27
Authors
16
Institutions
Publications per year
2017–2026
5
Parents
12
Topological pattern recognition for point cloud data
Gunnar Carlsson · Acta Numerica · 2014 · 241 citations · Full text
Jerry Gao, Rajini Jagatesan · Proceedings - International Computer Software & Applications Conference · 2007 · 138 citations
Interactive Visualization of 2-D Persistence Modules
Michael Lesnick, Matthew Wright · arXiv (Cornell University) · 2015 · 103 citations · Full text
1–5 of 12
27
1
h-index
Indian Institute of Science Bangalore, India
1 publications · 12 citations
1
h-index
1
h-index
University at Albany, State University of New York, United States
1 publications · 103 citations
1
h-index
1
h-index
1–5 of 27
16
Max Planck Institute for Mathematics
Bonn, Germany
1 h-index
1 publications
15 citations

University of Notre Dame
Notre Dame, United States
1 h-index
1 publications
15 citations
Stanford University
Stanford, United States
1 h-index
1 publications
241 citations
San Jose State University
San Jose, United States
1 h-index
3 publications
414 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
1 publications
15 citations
Technical University of Munich
Munich, Germany
1 h-index
1 publications
260 citations
University of Kalyani
Kalyani, India
1 h-index
1 publications
12 citations

University of Minnesota
Minneapolis, United States
1 h-index
1 publications
25 citations
1–8 of 16
Repository · 2 publications · 121 citations
2
h-index
2 publications · 275 citations
2
h-index
1 publications · 241 citations
1
h-index
1 publications · 138 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5