{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T09:54:35Z","timestamp":1770544475746,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T00:00:00Z","timestamp":1429315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00453-015-9999-4","type":"journal-article","created":{"date-parts":[[2015,4,17]],"date-time":"2015-04-17T13:36:37Z","timestamp":1429277797000},"page":"607-619","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology"],"prefix":"10.1007","volume":"73","author":[{"given":"Jean-Daniel","family":"Boissonnat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamal K.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9ment","family":"Maria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,18]]},"reference":[{"key":"9999_CR1","unstructured":"Bauer, U., Kerber, M., Reininghaus, J.: PHAT. https:\/\/code.google.com\/p\/phat\/ (2013)"},{"key":"9999_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, U., Kerber, M., Reininghaus, J.: Clear and compress: computing persistent homology in chunks. In: Topological Methods in Data Analysis and Visualization III, pp. 103\u2013117 (2014)","DOI":"10.1007\/978-3-319-04099-8_7"},{"key":"9999_CR3","unstructured":"Bauer, U., Kerber, M., Reininghaus, J., Wagner, H.: PHAT\u2014persistent homology algorithms toolbox. In: Mathematical Software\u2014ICMS 2014\u20144th International Congress, Seoul, South Korea, August 5\u20139, 2014. Proceedings, pp. 137\u2013143 (2014)"},{"issue":"3","key":"9999_CR4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/s00453-014-9887-3","volume":"70","author":"J-D Boissonnat","year":"2014","unstructured":"Boissonnat, J.-D., Maria, C.: The simplex tree: an efficient data structure for general simplicial complexes. Algorithmica 70(3), 406\u2013427 (2014)","journal-title":"Algorithmica"},{"key":"9999_CR5","doi-asserted-by":"crossref","unstructured":"Busaryev, O., Cabello, S., Chen, C., Dey, T.K., Wang, Y.: Annotating simplices with a homology basis and its applications. In: SWAT, pp. 189\u2013200 (2012)","DOI":"10.1007\/978-3-642-31155-0_17"},{"key":"9999_CR6","unstructured":"Chen, C., Kerber, M.: Persistent homology computation with a twist. In: Proceedings 27th European Workshop on Computational Geometry (2011)"},{"issue":"4","key":"9999_CR7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.comgeo.2012.02.010","volume":"46","author":"C Chen","year":"2013","unstructured":"Chen, C., Kerber, M.: An output-sensitive algorithm for persistent homology. Comput. Geom. 46(4), 435\u2013447 (2013)","journal-title":"Comput. Geom."},{"issue":"1","key":"9999_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103\u2013120 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9999_CR9","doi-asserted-by":"crossref","unstructured":"de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Dualities in persistent (co)homology. CoRR arXiv:1107.5665 (2011)","DOI":"10.1088\/0266-5611\/27\/12\/124003"},{"issue":"4","key":"9999_CR10","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00454-011-9344-x","volume":"45","author":"V Silva de","year":"2011","unstructured":"de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Persistent cohomology and circular coordinates. Discrete Comput. Geom. 45(4), 737\u2013759 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"9999_CR11","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Fan, F., Wang, Y.: Computing topological persistence for simplicial maps. In: Symposium on Computational Geometry, p. 345 (2014)","DOI":"10.1145\/2582112.2582165"},{"key":"9999_CR12","volume-title":"Computational Topology\u2014An Introduction","author":"H Edelsbrunner","year":"2010","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology\u2014An Introduction. American Mathematical Society, Providence, RI (2010)"},{"issue":"4","key":"9999_CR13","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511\u2013533 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"9999_CR14","unstructured":"Maria, C.: Gudhi, Simplicial Complexes and Persistent Homology Packages. https:\/\/project.inria.fr\/gudhi\/software\/"},{"key":"9999_CR15","doi-asserted-by":"crossref","unstructured":"Maria, C., Boissonnat, J.-D., Glisse, M., Yvinec, M.: The Gudhi library: Simplicial complexes and persistent homology. In: International Congress on Mathematical Software, pp. 167\u2013174 (2014)","DOI":"10.1007\/978-3-662-44199-2_28"},{"key":"9999_CR16","doi-asserted-by":"crossref","unstructured":"Milosavljevic, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Symposium on Computational Geometry (2011)","DOI":"10.1145\/1998196.1998229"},{"key":"9999_CR17","unstructured":"Morozov, D.: Dionysus. http:\/\/www.mrzv.org\/software\/dionysus\/"},{"key":"9999_CR18","unstructured":"Morozov, D.: Persistence algorithm takes cubic time in worst case. In: BioGeometry News, Department of Computer Science, Duke University (2005)"},{"issue":"2","key":"9999_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","volume":"33","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A., Carlsson, G.E.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249\u2013274 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9999-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9999-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9999-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T17:20:52Z","timestamp":1566580852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9999-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,18]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9999"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9999-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,18]]}}}