{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:54:30Z","timestamp":1756385670428},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_28","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"336-344","source":"Crossref","is-referenced-by-count":19,"title":["A Faster CREW PRAM Algorithm for Computing Cartesian Trees"],"prefix":"10.1007","author":[{"given":"Chung Keung","family":"Poon","sequence":"first","affiliation":[]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O. Berkman","year":"1993","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms\u00a014, 371\u2013380 (1993)","journal-title":"Journal of Algorithms"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Shun, J.: A simple parallel cartesian tree algorithm and its application to suffix tree construction. In: ALENEX 2011, pp. 48\u201358 (2011)","DOI":"10.1137\/1.9781611972917.5"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-02927-1_29","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On Cartesian trees and range minimum queries. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 341\u2013353. Springer, Heidelberg (2009)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for goemetry problems. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 135\u2013143. ACM (1984)","DOI":"10.1145\/800057.808675"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"28_CR6","unstructured":"Iliopoulos, C., Rytter, W.: On parallel transformations of suffix arrays into suffix trees. In: 15th Australasian Workshop on Combinatorial Algorithms (2004)"},{"key":"28_CR7","unstructured":"Jaja, J.: An introduction to parallel algorithms. Addison-Wesley Professional (1992)"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Vishkin, U.: Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms\u00a02(1), 88\u2013102 (1981)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Communications of the ACM\u00a023(4), 229\u2013239 (1980)","journal-title":"Communications of the ACM"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Yuan, H., Atallah, M.J.: Data structures for range minimum queries in multidimensional arrays. In: Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 150\u2013160 (2010)","DOI":"10.1137\/1.9781611973075.14"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T17:00:56Z","timestamp":1563037256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}