Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
264 Publications
2014 | Book Chapter | IST-REx-ID: 2044 | 
Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in Chunks.” Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:10.1007/978-3-319-04099-8_7.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2153 |
Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2156 |
Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2155 |
Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2177
Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.
View
| DOI