{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:33Z","timestamp":1725663693334},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535041"},{"type":"electronic","value":"9783540466772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53504-7_100","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:08:26Z","timestamp":1330189706000},"page":"425-432","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for path-min queries in trees"],"prefix":"10.1007","author":[{"given":"Sung Kwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D.G. Kirkpatrick and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms, 10, 287\u2013302 (1989).","journal-title":"J. Algorithms"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BFb0040376","volume":"319","author":"R.J. Anderson","year":"1988","unstructured":"R.J. Anderson and G.L. Miller, Deterministic parallel list ranking, Proc. 3rd AWOC. (Lecture Notes in Computer Sciences, vol. 319) 81\u201390 (1988).","journal-title":"Lecture Notes in Computer Sciences"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"R.P. Brent, The parallel evaluation of general arithmetic expressions, J. ACM, 21, 201\u2013206 (1974).","journal-title":"J. ACM"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"O. Berkman, D. Breslauer, Z. Galil, B. Schieber and U. Vishkin, Highly parallelizable problems, Proc. ACM Symp. on Theory of Computing, 309\u2013319 (1989)","DOI":"10.1145\/73007.73036"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle, Computing on a free tree via complexity-preserving mappings, Algorithmica, 2, 337\u2013361 (1987).","journal-title":"Algorithmica"},{"key":"45_CR6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin, Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput., 17, 128\u2013142 (1988).","journal-title":"SIAM J. Comput."},{"key":"45_CR7","volume-title":"The art of programming: Fundamental algorithms","author":"D. Knuth","year":"1968","unstructured":"D. Knuth, The art of programming: Fundamental algorithms, Addison-Wesley, Reading, Mass. (1968)."},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Sch\u00e4ffer","year":"1989","unstructured":"A.A. Sch\u00e4ffer, Optimal node ranking of trees in linear time, Inform. Process. Lett., 33, 91\u201396 (1989).","journal-title":"Inform. Process. Lett."},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput., 17, 1253\u20131262 (1988).","journal-title":"SIAM J. Comput."},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. Tarjan","year":"1985","unstructured":"R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput., 14, 862\u2013874 (1985).","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing and Information \u2014 ICCI '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53504-7_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:13:49Z","timestamp":1619558029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53504-7_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540535041","9783540466772"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-53504-7_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}