{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:47:38Z","timestamp":1757540858118,"version":"3.41.2"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1109\/tc.1983.1676223","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"307-315","source":"Crossref","is-referenced-by-count":55,"title":["Binary Trees and Parallel Scheduling Algorithms"],"prefix":"10.1109","volume":"C-32","author":[{"family":"Dekel","sequence":"first","affiliation":[{"name":"Program in Computer Science, University of Texas"}]},{"family":"Sahni","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675280"},{"journal-title":"Parallel algorithms for graph theoretic problems","year":"1978","author":"savage","key":"ref32"},{"journal-title":"Machine Scheduling Problems Classfication Complexity and Computations","year":"1976","author":"kan","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675167"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80784-8_26"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.1.24"},{"journal-title":"Parallel graph processing using depth-first search and breadth first search","year":"1977","author":"eckstein","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803631"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359582"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800210113"},{"journal-title":"Fundamentals of Computer Algorithms","year":"1978","author":"horowitz","key":"ref15"},{"journal-title":"Scheduling a production line to minimize tardiness","year":"1955","author":"jackson","key":"ref16"},{"journal-title":"Complexity of Computer Computations","year":"1972","author":"karp","key":"ref17"},{"journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching","year":"1973","author":"knuth","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674637"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322329"},{"key":"ref4","first-page":"307","article-title":"sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"Proc AFIPS Spring Joint Comput Conf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/322169.322172"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800210112"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90015-1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676004"},{"key":"ref5","first-page":"249","article-title":"mppa massively parallel processor","author":"batcher","year":"1979","journal-title":"Proc IEEE Int Conf Parallel Process"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.14"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"journal-title":"A study of parallelism in graph theory","year":"1975","author":"arjomandi","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0210049"},{"key":"ref1","first-page":"116","article-title":"communication in parallel algorithms for boolean matrix multiplication","author":"agerwala","year":"1978","journal-title":"Proc IEEE Int Conf Parallel Process"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.5009205"},{"journal-title":"Mathematical Centre Tract 69","year":"1977","author":"lenstra","key":"ref22"},{"key":"ref21","first-page":"27","article-title":"sequencing to minimize the weighted number of tardy jobs","volume":"10 5","author":"lawler","year":"1976","journal-title":"Rev Francaise Automat Informat Recherche Operationalle"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"an n job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"moore","year":"1968","journal-title":"Management Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675216"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80043-1"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35225\/01676223.pdf?arnumber=1676223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:04:41Z","timestamp":1753121081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":38,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.1983.1676223","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}