{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:25Z","timestamp":1725663685515},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_165","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:00Z","timestamp":1330262400000},"page":"487-495","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A simple optimal parallel algorithm for reporting paths in a tree"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. Parallel merge sort. SIAM J. Computing, 17, (1988), pp. 770\u2013785.","journal-title":"SIAM J. Computing"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3 (1988), pp. 329\u2013346.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"A. Datta, A. Maheshwari, J.-R. Sack. Optimal parallel algorithms for direct dominance problems. First Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 726, pp. 109\u2013120, Springer-Verlag, 1993.","key":"39_CR3","DOI":"10.1007\/3-540-57273-2_48"},{"doi-asserted-by":"crossref","unstructured":"H.N. Djidjev, G.E. Pantziou and C.D. Zaroliagis. Computing Shortest Paths and Distances in Planar Graphs. Proceedings 18th ICALP, Madrid, 1991, LNCS 510, pp. 327\u2013338, Springer Verlag.","key":"39_CR4","DOI":"10.1007\/3-540-54233-7_145"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1137\/0220047","volume":"20","author":"M. T. Goodrich","year":"1991","unstructured":"M. T. Goodrich. Intersecting line segments in parallel with an output-sensitive number of processors. SIAM J. Computing, 20, (1991), pp. 737\u2013755.","journal-title":"SIAM J. Computing"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L. J. Guibas","year":"1989","unstructured":"L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. of Computer and System Sciences 39, pp. 126\u2013152, 1989.","journal-title":"J. of Computer and System Sciences"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0196-6774(89)90011-4","volume":"10","author":"R. G\u00fcting","year":"1989","unstructured":"R. G\u00fcting, O. Nurmi and T. Ottmann. Fast algorithms for direct enclosures and direct dominances. J. Algorithms 10 (1989), pp. 170\u2013186.","journal-title":"J. Algorithms"},{"unstructured":"J. J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.","key":"39_CR8"},{"doi-asserted-by":"crossref","unstructured":"R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, Handbook of Theoretical Computer Science, Edited by J. van Leeuwen, Volume 1, Elsevier Science Publishers B.V., 1990.","key":"39_CR9","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"issue":"4","key":"39_CR10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fisher. Parallel prefix computation, JACM, 27(4) (1980), pp. 831\u2013838.","journal-title":"JACM"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BFb0036940","volume":"154","author":"W. Paul","year":"1983","unstructured":"W. Paul, U. Vishkin and H. Wagener. Parallel dictionaries on 2\u20133 trees. Proc. 10th ICALP Lecture Notes in Computer Science, Vol. 154, pp. 597\u2013609, 1983.","journal-title":"Lecture Notes in Computer Science"},{"key":"39_CR12","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. Computing, 17 (1988), pp. 1253\u20131262.","journal-title":"SIAM. J. Computing"},{"key":"39_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983."},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Computing, 14 (1985), pp. 862\u2013874.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:09:36Z","timestamp":1558267776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_165","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}