{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:37:21Z","timestamp":1648885041306},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5829,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0166-218x(97)00135-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"201-220","source":"Crossref","is-referenced-by-count":0,"title":["Time-optimal tree computations on sparse meshes"],"prefix":"10.1016","volume":"77","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":"78","reference":[{"key":"10.1016\/S0166-218X(97)00135-2_BIB1","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/71.296326","article-title":"A fast selection algorithm on meshes with multiple broadcasting","volume":"5","author":"Bhagavathi","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jpdc.1995.1078","article-title":"Convexity problems on meshes with multiple broadcasting","volume":"27","author":"Bhagavathi","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1006\/jpdc.1994.1074","article-title":"A time-optimal multiple search algorithm on enhanced meshes, with Applications","volume":"22","author":"Bhagavathi","year":"1994","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB5","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1991"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB6","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","article-title":"Array processor with multiple broadcasting","volume":"2","author":"Kumar","year":"1987","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB8","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1109\/34.42857","article-title":"Image computations on meshes with multiple broadcast","volume":"11","author":"Kumar","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0129626493000095","article-title":"Simulating enhanced meshes, with applications","volume":"3","author":"Lin","year":"1993","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0743-7315(89)90022-1","article-title":"Connection autonomy in SIMD computers: a VLSI implementation","volume":"7","author":"Maresca","year":"1989","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jpdc.1995.1075","article-title":"Reconstructing binary trees in doubly logarithmic CREW time","volume":"27","author":"Olariu","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054192000024","article-title":"Optimal parallel encoding and decoding algorithms for trees","volume":"3","author":"Olariu","year":"1992","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00135-2_BIB13","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BF01990523","article-title":"Optimal convex hull algorithms on enhanced meshes","volume":"33","author":"Olariu","year":"1993","journal-title":"BIT"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB14","series-title":"Proceedings of the 33rd IEEE Comp. Soc. International Conference","first-page":"196","article-title":"The AMT DAP 500","author":"Parkinson","year":"1988"},{"key":"10.1016\/S0166-218X(97)00135-2_BIB15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","article-title":"Lexicographic generation of ordered trees","volume":"10","author":"Zaks","year":"1980","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:21Z","timestamp":1556130561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0166218X97001352"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00135-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}