{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:23:28Z","timestamp":1730237008684,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1109\/iccta.2007.34","type":"proceedings-article","created":{"date-parts":[[2007,4,19]],"date-time":"2007-04-19T20:38:58Z","timestamp":1177015138000},"page":"20-26","source":"Crossref","is-referenced-by-count":1,"title":["Cache-Oblivious Computation: Algorithms and Experimental Evaluation"],"prefix":"10.1109","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"journal-title":"Ninth DIMACS Implementation Challenge - Shortest Paths","year":"2006","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"article-title":"Cache-oblivious string algorithms for bioinformatics","year":"2006","author":"chowdhury","key":"13"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109622"},{"year":"0","key":"12"},{"key":"21","first-page":"433","article-title":"Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phy logenetic Tree","author":"knudsen","year":"2003","journal-title":"Proc of WABI"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36574-5_4"},{"key":"22","first-page":"169","article-title":"Improved algorithms and data structures for solving graph problems in external memory","author":"kumar","year":"1996","journal-title":"Proceedings of the IEEE Symposium on Parallel and Distributed Processing"},{"journal-title":"Algorithms for Identification of Patterns in Biogeography and Median Alignment of Three Sequences in Bioinformatics","year":"2006","author":"le","key":"23"},{"key":"24","first-page":"434","article-title":"I\/O-efficient undirected shortest paths","volume":"2832","author":"meyer","year":"2003","journal-title":"Proceedings of the European Symposium on Algorithms LNCS"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.2000.2177"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384249"},{"year":"0","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_15"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509950"},{"key":"10","first-page":"735","article-title":"External-memory exact and approximate all-pairs shortest paths in undirected graphs","author":"chowdhury","year":"2005","journal-title":"Proc 14th ACM-SIAM Symp Discrete Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"journal-title":"Implementation and Experimental Evaluation of the Cache-oblivious Buffer Heap","year":"2006","author":"tong","key":"30"},{"key":"7","first-page":"49","article-title":"Cache efficient simple dynamic programming","author":"cherng","year":"2005","journal-title":"Proc Int Conf Analysis of Algorithms"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_41"},{"key":"5","first-page":"219","article-title":"Funnel heap - a cache oblivious priority queue","volume":"2518","author":"brodal","year":"2002","journal-title":"LNCS"},{"year":"0","key":"31"},{"journal-title":"Dynamic Programming","year":"1957","author":"bellman","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007949"},{"key":"8","first-page":"139","article-title":"External-memory graph algorithms","author":"chiang","year":"1995","journal-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms"}],"event":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","start":{"date-parts":[[2007,3,5]]},"location":"Kolkata, India","end":{"date-parts":[[2007,3,7]]}},"container-title":["2007 International Conference on Computing: Theory and Applications (ICCTA'07)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4127325\/4127326\/04127337.pdf?arnumber=4127337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T22:35:33Z","timestamp":1489617333000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4127337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/iccta.2007.34","relation":{},"subject":[],"published":{"date-parts":[[2007,3]]}}}