{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:27:31Z","timestamp":1725593251481},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_23","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"261-272","source":"Crossref","is-referenced-by-count":1,"title":["On the Weak Prefix-Search Problem"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-15775-2_37","volume-title":"Algorithms \u2013 ESA 2010","author":"D. Belazzougui","year":"2010","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Fast prefix search in little space, with applications. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 427\u2013438. Springer, Heidelberg (2010)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M., Farach-Colton, M., Kuszmaul, B.: Cache-oblivious string B-trees. In: Procs. ACM PODS, pp. 233\u2013242 (2006)","DOI":"10.1145\/1142351.1142385"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Brodal, G., Fagerberg, R.: Cache-oblivious string dictionaries. In: ACM-SIAM SODA, pp. 581\u2013590 (2006)","DOI":"10.1145\/1109557.1109621"},{"key":"23_CR4","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Procs. ACM-SIAM SODA, pp. 383\u2013391 (1996)"},{"key":"23_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"23_CR6","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Worst-case optimal tree layout in a memory hierarchy (2004), available on arXiv:cs.DS\/0410048 (manuscript)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15781-3_1","volume-title":"Algorithms \u2013 ESA 2010","author":"P. Ferragina","year":"2010","unstructured":"Ferragina, P.: Data structures: Time, I\/Os, entropy, joules! In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06347, pp. 1\u201316. Springer, Heidelberg (2010)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. J. ACM\u00a046(2), 236\u2013280 (1999)","journal-title":"J. ACM"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: Procs. ACM PODS, pp. 181\u2013190 (2008)","DOI":"10.1145\/1376916.1376943"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Procs. IEEE FOCS, pp. 285\u2013298 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/11780441_8","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2006","unstructured":"Ko, P., Aluru, S.: Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 72\u201383. Springer, Heidelberg (2006)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-36574-5_3","volume-title":"Algorithms for Memory Hierarchies","author":"A. Maheshwari","year":"2003","unstructured":"Maheshwari, A., Zeh, N.: A survey of techniques for designing I\/O-efficient algorithms. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625, pp. 36\u201361. Springer, Heidelberg (2003)"},{"key":"23_CR13","unstructured":"Vitter, J.: Algorithms and Data Structures for External Memory. Series on Foundations and Trends in Theoretical Computer Science. Now Publishers (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T09:53:03Z","timestamp":1553853183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}