{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:48Z","timestamp":1725664248175},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590712"},{"type":"electronic","value":"9783540491835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59071-4_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:01:37Z","timestamp":1330275697000},"page":"193-205","source":"Crossref","is-referenced-by-count":0,"title":["Time-optimal tree computations on sparse meshes"],"prefix":"10.1007","author":[{"given":"D.","family":"Bhagavathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Bokka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Gurla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. L.","family":"Schwing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/71.296326","volume":"5","author":"D. Bhagavathi","year":"1994","unstructured":"D. Bhagavathi, P. J. Looges, S. Olariu, J. L. Schwing, and J. Zhang, A fast selection algorithm on meshes with multiple broadcasting, IEEE Transactions on Parallel and Distributed Systems, 5, (1994), 772\u2013778.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1006\/jpdc.1994.1074","volume":"22","author":"D. Bhagavathi","year":"1994","unstructured":"D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, A time-optimal multiple search algorithm on enhanced meshes, with Applications, Journal of Parallel and Distributed Computing, 22, (1994), 113\u2013120.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1142\/S0129626492000386","volume":"2","author":"D. Bhagavathi","year":"1992","unstructured":"D. Bhagavathi, S. Olariu, J. L. Schwing, and J. Zhang, Convex polygon problems on meshes with multiple broadcasting, Parallel Processing Letters, 2 (1992) 249\u2013256.","journal-title":"Parallel Processing Letters"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. A. Cook","year":"1986","unstructured":"S. A. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM Journal on Computing, 15 (1986) 87\u201397.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR5","volume-title":"An introduction to parallel algorithms","author":"J. J\u00e1J\u00e1","year":"1991","unstructured":"J. J\u00e1J\u00e1, An introduction to parallel algorithms, Addison-Wesley, Reading, MA, 1991."},{"key":"16_CR6","volume-title":"The Art of Computer Programming: Fundamental Algorithms, vol. 1","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The Art of Computer Programming: Fundamental Algorithms, vol. 1, 2nd edition, Addison-Wesley, Reading, MA, 1973.","edition":"2nd edition"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","volume":"2","author":"V. P. Kumar","year":"1987","unstructured":"V. P. Kumar and C. S. Raghavendra, Array processor with multiple broadcasting, Journal of Parallel and Distributed Computing, 2, (1987) 173\u2013190.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1109\/34.42857","volume":"11","author":"V. P. Kumar","year":"1989","unstructured":"V. P. Kumar and D. I. Reisis, Image computations on meshes with multiple broadcast, IEEE Trans. on Pattern Analysis and Machine Intelligence, 11, (1989), 1194\u20131201.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0129626493000095","volume":"3","author":"R. Lin","year":"1993","unstructured":"R. Lin, S. Olariu, J. L. Schwing, and J. Zhang, Simulating enhanced meshes, with applications, Parallel Processing Letters, 3 (1993) 59\u201370.","journal-title":"Parallel Processing Letters"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0743-7315(89)90022-1","volume":"7","author":"M. Maresca","year":"1989","unstructured":"M. Maresca and H. Li, Connection autonomy in SIMD computers: a VLSI implementation, Journal of Parallel and Distributed Computing, 7, (1989), 302\u2013320.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054192000024","volume":"3","author":"S. Olariu","year":"1992","unstructured":"S. Olariu, J. L. Schwing, and J. Zhang, Optimal parallel encoding and decoding algorithms for trees, International Journal of Foundations of Computer Science, 3 (1992), 1\u201310.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"S. Olariu, J. L. Schwing, and J. Zhang, Time-optimal sorting and applications on n\u00d7n enhanced meshes, Proc. IEEE Internat. Conf. on Computer Systems and Software Engineering, The Hague, May 1992.","DOI":"10.1109\/CMPEUR.1992.218501"},{"key":"16_CR13","unstructured":"S. Olariu, C. M. Overstreet, and Z. Wen, Parallel reconstruction of binary trees, Journal of Parallel and Distributed Computing, to appear."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"D. Parkinson, D. J. Hunt, and K. S. MacQueen, The AMT DAP 500, 33rd IEEE Comp. Soc. International Conf., 1988, 196\u2013199.","DOI":"10.1109\/CMPCON.1988.4858"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S. Zaks","year":"1980","unstructured":"S. Zaks, Lexicographic generation of ordered trees, Theoretical Computer Science, 10 (1980), 63\u201382.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59071-4_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:30Z","timestamp":1605648330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59071-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590712","9783540491835"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-59071-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}