{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T06:46:36Z","timestamp":1770705996380,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642404498","type":"print"},{"value":"9783642404504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_59","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"695-706","source":"Crossref","is-referenced-by-count":21,"title":["The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology"],"prefix":"10.1007","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","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Bauer, U., Kerber, M., Reininghaus, J.: Clear and compress: Computing persistent homology in chunks. arXiv\/1303.0477 (2013)","DOI":"10.1007\/978-3-319-04099-8_7"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-642-33090-2_63","volume-title":"Algorithms \u2013 ESA 2012","author":"J.-D. Boissonnat","year":"2012","unstructured":"Boissonnat, J.-D., Maria, C.: The simplex tree: An efficient data structure for general simplicial complexes. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 731\u2013742. Springer, Heidelberg (2012)"},{"key":"59_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-31155-0_17","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"O. Busaryev","year":"2012","unstructured":"Busaryev, O., Cabello, S., Chen, C., Dey, T.K., Wang, Y.: Annotating simplices with a homology basis and its applications. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 189\u2013200. Springer, Heidelberg (2012)"},{"key":"59_CR4","unstructured":"Chen, C., Kerber, M.: Persistent homology computation with a twist. In: Proceedings 27th European Workshop on Computational Geometry (2011)"},{"issue":"4","key":"59_CR5","doi-asserted-by":"publisher","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.\u00a046(4), 435\u2013447 (2013)","journal-title":"Comput. Geom."},{"issue":"1","key":"59_CR6","doi-asserted-by":"publisher","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 & Computational Geometry\u00a037(1), 103\u2013120 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"124003","DOI":"10.1088\/0266-5611\/27\/12\/124003","volume":"27","author":"V. Silva de","year":"2011","unstructured":"de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Dualities in persistent (co)homology. Inverse Problems\u00a027, 124003 (2011)","journal-title":"Inverse Problems"},{"key":"59_CR8","doi-asserted-by":"publisher","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.\u00a045, 737\u2013759 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"59_CR9","unstructured":"Dey, T.K., Fan, F., Wang, Y.: Computing topological persistence for simplicial maps. CoRR, abs\/1208.5018 (2012)"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology - an Introduction. American Mathematical Society (2010)","DOI":"10.1090\/mbk\/069"},{"issue":"4","key":"59_CR11","doi-asserted-by":"publisher","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.\u00a028(4), 511\u2013533 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Milosavljevic, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Symposium on Comp. Geom. (2011)","DOI":"10.1145\/1998196.1998229"},{"key":"59_CR13","unstructured":"Morozov, D.: Persistence algorithm takes cubic time in worst case. In: BioGeometry News, Dept. Comput. Sci., Duke Univ. (2005)"},{"issue":"2","key":"59_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","volume":"33","author":"A. Zomorodian","year":"2005","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete & Computational Geometry\u00a033(2), 249\u2013274 (2005)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:43:57Z","timestamp":1558010637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}