{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:31Z","timestamp":1725467911837},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387968186"},{"type":"electronic","value":"9780387347707"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988]]},"DOI":"10.1007\/bfb0040368","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T20:03:50Z","timestamp":1154549030000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel algorithms for evaluating sequences of set-manipulation operations"],"prefix":"10.1007","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Rao","family":"Kosaraju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, 1974."},{"key":"1_CR2","unstructured":"M. Atallah, R. Cole, and M. Goodrich, \u201cCascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms,\u201d 28th IEEE Symp. on Found. of Comp. Sci., 151\u2013160 (1987)."},{"key":"1_CR3","unstructured":"G. Bilardi and A. Nicolau, \u201cAdaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines,\u201d TR 86-769, Dept. of Comp. Sci., Cornell Univ., August 1986."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"R. Cole, \u201cParallel Merge Sort,\u201d 27th IEEE Symp. on Found. of Comp. Sci., 1986, 511\u2013516.","DOI":"10.1109\/SFCS.1986.41"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"E. Dekel and S. Sahni, \u201cBinary Trees and Parallel Scheduling Algorithms\u201d, IEEE Trans. on Computers, 307\u2013315, March 1983.","DOI":"10.1109\/TC.1983.1676223"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"E. Dekel and S. Sahni, \u201cA Parallel Matching Algorithm for Convex Bipartite Graphs and Applications to Scheduling\u201d, J. of Par. and Dist. Comp., 185\u2013205, 1984.","DOI":"10.1016\/0743-7315(84)90004-2"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"P.W. Dymond and S.A. Cook, \u201cHardware Complexity and Parallel Comp.,\u201d 21st IEEE Symp. on Found. of Comp. Sci., 1980, 360\u2013372.","DOI":"10.1109\/SFCS.1980.22"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"F. Glover, \u201cMaximum Matching in a Convex Bipartite Graph\u201d, Naval Res. Logist. Quart., 313\u2013316 (1967).","DOI":"10.1002\/nav.3800140304"},{"key":"1_CR9","unstructured":"M.T. Goodrich, \u201cEfficient Parallel Techniques for Computational Geometry,\u201d Ph.D. thesis, Dept. of Comp. Sci., Purdue Univ., August 1987."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"T. Leighton and P. Shor, \u201cTight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms,\u201d 18th ACM Symp. on Theory of Comp., 91\u2013103 (1986).","DOI":"10.1145\/12130.12140"},{"key":"1_CR11","unstructured":"C.P. Kruskal, L. Rudolph, and M. Snir, \u201cThe Power of Parallel Prefix,\u201d 1985 Int. Conf. on Parallel Processing, 180\u2013185."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"R.E. Ladner and M.J. Fischer, \u201cParallel Prefix Computation,\u201d J. ACM, October 1980, 831\u2013838.","DOI":"10.1145\/322217.322232"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W.L. Ruzzo","year":"1981","unstructured":"W.L. Ruzzo, \u201cOn Uniform Circuit Complexity,\u201d J. of Comp. and Sys. Sci., Vol. 22, No. 3, June 1981, 365\u2013383.","journal-title":"J. of Comp. and Sys. Sci."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:47:15Z","timestamp":1578494835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040368"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780387968186","9780387347707"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0040368","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}