{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:38:17Z","timestamp":1743043097031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319040981"},{"type":"electronic","value":"9783319040998"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04099-8_5","type":"book-chapter","created":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T15:30:30Z","timestamp":1398180630000},"page":"73-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computational Topology via Functional Programming: A Baseline Analysis"],"prefix":"10.1007","author":[{"given":"David","family":"Duke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamish","family":"Carr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,19]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/978-3-642-10631-6_116","volume":"5878","author":"L. Arge","year":"2009","unstructured":"L. Arge, M. Revsbaek, Robust on-line computation of reeb graphs: simplicity and speed. Algorithms Comput. 5878, 1155\u20131165 (2009)","journal-title":"Algorithms Comput."},{"issue":"8","key":"5_CR2","first-page":"75","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus, Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21(8), 75\u201394 (1978)","journal-title":"A functional style and its algebra of programs. Commun. ACM"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0925-7721(02)00093-7","volume":"24","author":"H. Carr","year":"2003","unstructured":"H. Carr, J. Snoeyink, U. Axen, Computing contour trees in all dimensions. Comput. Geom. 24(2), 75\u201394 (2003)","journal-title":"Comput. Geom."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Chakravarty, G. Keller, S. Lee, T. McDonell, V. Grover, Accelerating haskell array codes with multicore GPUs, in Proceedings of the Declarative Aspects of Multicore Programming, Austin (ACM, 2011), pp.\u00a03\u201314","DOI":"10.1145\/1926354.1926358"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"C. Chiw, G. Kindlmann, J. Reppy, L. Samuels, N. Seltzer, Diderot: a parallel DSL for image analysis and visualization, in Proceedings of the Conference on Programming Language Design and Implementation, Beijing (ACM, 2012), pp.\u00a0111\u2013120","DOI":"10.1145\/2345156.2254079"},{"key":"5_CR6","unstructured":"Data.IntMap, www.haskell.org\/ghc\/docs\/7.4-latest\/html\/libraries\/containers-0.4.2.1\/Data-IntMap.html. Last accessed Nov 2012"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"D. Duke, R. Borgo, C. Runciman, M. Wallace, Huge data but small programs: visualization design via multiple embedded DSLs, in Proceedings of the Practical Applications of Declarative Languages, Savannah, vol.\u00a05418 (Springer, 2009), pp.\u00a031\u201345","DOI":"10.1007\/978-3-540-92995-6_3"},{"issue":"12","key":"5_CR8","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1109\/TVCG.2012.287","volume":"18","author":"D. Duke","year":"2012","unstructured":"D. Duke, H. Carr, A. Knoll, N. Schunck, H. Nam, A. Staszczak, Visualizing nuclear scission through a multifield extension of topological analysis. Trans. Vis. Comput. Graph. 18(12), 2033\u20132040 (2012)","journal-title":"Trans. Vis. Comput. Graph."},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TVCG.2006.145","volume":"12","author":"D. Duke","year":"2006","unstructured":"D. Duke, M. Wallace, R. Borgo, C. Runciman, Fine-grained visualization pipelines and lazy functional languages. Trans. Vis. Comput. Graph. 12(5), 973\u2013980 (2006)","journal-title":"Trans. Vis. Comput. Graph."},{"issue":"10","key":"5_CR10","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s00371-012-0726-8","volume":"28","author":"D. G\u00fcnther","year":"2012","unstructured":"D. G\u00fcnther, J. Reininghaus, H. Wagner, I. Hotz, Efficient computation of 3D morse-smale complexes and persistent homology using discrete morse theory. Vis. Comput. 28(10), 959\u2013969 (2012)","journal-title":"Vis. Comput."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"B. Lippmeier, M. Chakravarty, G. Keller, S. Peyton\u00a0Jones, Guiding parallel array fusion with indexed types, in Proceedings of the Haskell Symposium, Copenhagen (ACM, 2012), pp.\u00a025\u201336","DOI":"10.1145\/2430532.2364511"},{"key":"5_CR12","volume-title":"A hybrid parallel algorithm for computing and tracking level set topology, in International Conference on High Performance Computing, Pune (IEEE","author":"S. Maadasamy","year":"2012","unstructured":"S. Maadasamy, H. Doraiswamy, V. Natarajan, A hybrid parallel algorithm for computing and tracking level set topology, in International Conference on High Performance Computing, Pune (IEEE, 2012)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"S. Marlow, P. Maier, H.W. Loidl, M. Aswad, P. Trinder, Seq no more: better strategies for parallel haskell, in Proceedings of the Haskell Symposium, Baltimore (ACM, 2010), pp.\u00a091\u2013102","DOI":"10.1145\/2088456.1863535"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"S. Marlow, R. Newton, S. Peyton Jones, A monad for deterministic parallelism, in Proceedings of the Haskell Symposium, Tokyo (ACM, 2011), pp.\u00a071\u201382","DOI":"10.1145\/2096148.2034685"},{"key":"5_CR15","unstructured":"J. Meredith, S. Ahern, D. Pugmire, R. Sisneros, EAVL: the extreme-scale analysis and visualization library, in Eurographics Symposium on Parallel Graphics and Visualization, Cagliari, 2012"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"K. Moreland, U. Ayachit, B. Geveci, K.L. Ma, Dax toolkit: a proposed framework for data analysis and visualization at extreme scale, in Symposium on Large Data Analysis and Visualization, Providence (IEEE Computer Society, 2011), pp.\u00a097\u2013104","DOI":"10.1109\/LDAV.2011.6092323"},{"key":"5_CR17","volume-title":"Real World Haskell","author":"B. O\u2019Sullivan","year":"2008","unstructured":"B. O\u2019Sullivan, J. Goerzen, D. Stewart, Real World Haskell (O\u2019Reilly Media, Sebastopol, 2008)"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-003-1052-3","volume":"38","author":"V. Pascucci","year":"2004","unstructured":"V. Pascucci, K. Cole-McLaughlin, Parallel computation of the topology of level sets. Algorithmica 38(1), 249\u2013268 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR19","first-page":"58","volume":"26","author":"V. Pascucci","year":"2007","unstructured":"V. Pascucci, G. Scorzelli, P.T. Bremer, A. Mascarenhas, Robust on-line computation of reeb graphs: simplicity and speed. Trans. Graph. 26(3), 58 (2007)","journal-title":"Robust on-line computation of reeb graphs: simplicity and speed. Trans. Graph."},{"issue":"10","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/TVCG.2011.284","volume":"18","author":"N. Shivashankar","year":"2012","unstructured":"N. Shivashankar, M. Senthilnathan, V. Natarajan, Parallel computation of 2D morse-smale complexes. Trans. Vis. Comput. Graph. 18(10), 1757\u20131770 (2012)","journal-title":"Trans. Vis. Comput. Graph."},{"key":"5_CR21","unstructured":"The Haskell Programming Language, www.haskell.org. Last accessed Nov 2012"}],"container-title":["Mathematics and Visualization","Topological Methods in Data Analysis and Visualization III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04099-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T06:39:36Z","timestamp":1674542376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-04099-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319040981","9783319040998"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04099-8_5","relation":{},"ISSN":["1612-3786","2197-666X"],"issn-type":[{"type":"print","value":"1612-3786"},{"type":"electronic","value":"2197-666X"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}