{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:47:53Z","timestamp":1765993673673},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1007\/bf00128644","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T13:49:12Z","timestamp":1099403352000},"page":"87-98","source":"Crossref","is-referenced-by-count":46,"title":["Parallel heap: An optimal parallel priority queue"],"prefix":"10.1007","volume":"6","author":[{"given":"Narsingh","family":"Deo","sequence":"first","affiliation":[]},{"given":"Sushil","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(84)90128-5","volume":"19","author":"S.G. Akl","year":"1984","unstructured":"Akl, S.G. 1984. An optimal algorithm for parallel selection. Inf. Proc. Letters, 19, 1 (July):47?50.","journal-title":"Inf. Proc. Letters"},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","volume":"18","author":"G. Bilardi","year":"1989","unstructured":"Bilardi, G., and Nicolau, A. 1989. Adaptive bitonic sorting: An optimal algorithm for shared-memory machines. SIAM J. Computing, 18, 2 (Apr.):216?228.","journal-title":"SIAM J. Computing"},{"key":"CR3","first-page":"124","volume-title":"Proc., 1987 Internat. Conf. on Parallel Processing (Aug.)","author":"J. Biswas","year":"1987","unstructured":"Biswas, J., and Browne, J.C. 1987. Simultaneous update of priority structures. In Proc., 1987 Internat. Conf. on Parallel Processing (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 124?131."},{"key":"CR4","series-title":"Ultracomputer Note #97","volume-title":"An optimal selection algorithm","author":"R. Cole","year":"1986","unstructured":"Cole, R. 1986. An optimal selection algorithm. Ultracomputer Note #97, Courant Institute of Math. Sci., New York Univ., N.Y. (Mar.)."},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"Cole, R. 1988. Parallel merge sort. SIAM J. Computing, 17, 4 (Aug.):770?785.","journal-title":"SIAM J. Computing"},{"key":"CR6","first-page":"270","volume-title":"Proc., Parallel Lang, and Arch. Europe, Lecture Notes in Computer Science, vol. 505","author":"S.K. Das","year":"1991","unstructured":"Das, S.K., and Horng, W.-B. 1991. Managing a parallel heap efficiently. In Proc., Parallel Lang, and Arch. Europe, Lecture Notes in Computer Science, vol. 505, Springer-Verlag, Berlin, pp. 270?287."},{"key":"CR7","first-page":"169","volume-title":"Proc., 1990 Internat. Conf. on Parallel Processing, vol. 3 (Aug.)","author":"N. Deo","year":"1990","unstructured":"Deo, N., and Prasad, S. 1990. Parallel heap. In Proc., 1990 Internat. Conf. on Parallel Processing, vol. 3 (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 169?172."},{"issue":"9","key":"CR8","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/TC.1980.1675680","volume":"C-29","author":"C.S. Ellis","year":"1980","unstructured":"Ellis, C.S. 1980. Concurrent search and insertion in AVL trees. IEEE Trans. Comps., C-29, 9 (Sept.):811?817.","journal-title":"IEEE Trans. Comps."},{"key":"CR9","first-page":"95","volume-title":"Proc., 1989 Internat. Conf. on Parallel Processing, vol. 1 (Aug.)","author":"Z. Fan","year":"1989","unstructured":"Fan, Z., and Cheng, K.H. 1989. A simultaneous access priority queue. In Proc., 1989 Internat. Conf. on Parallel Processing, vol. 1 (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 95?98."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/84537.84545","volume":"33","author":"R.M. Fujimoto","year":"1990","unstructured":"Fujimoto, R.M. 1990. Parallel discrete event simulation. CACM, 33 (Oct.):31?53.","journal-title":"CACM"},{"issue":"4","key":"CR11","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G.H. Gonnet","year":"1986","unstructured":"Gonnet, G.H., and Munro, J.I. 1986. Heaps on heaps. SIAM J. Computing, 15, 4 (Nov.):964?971.","journal-title":"SIAM J. Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"Hagerup, T., and Rub, C. 1989. Optimal merging and sorting on the EREW PRAM. Inf. Process. Letters, 33 (Dec.): 181?185.","journal-title":"Inf. Process. Letters"},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/63238.63249","volume":"32","author":"D.W. Jones","year":"1989","unstructured":"Jones, D.W. 1989. Concurrent operations on priority queues. CACM, 32, 1 (Jan.):132?137.","journal-title":"CACM"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M., and Ramachandran, V. 1990. Parallel algorithms for shared-memory machines. Handbook on Theoretical Computer Science, vol. A: Algorithms and Complexity (J. van Leeuwen, ed.), MIT Press, pp. 869?941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"CR15","series-title":"Ph.D. diss.","volume-title":"Area-efficient computation","author":"C.E. Leiserson","year":"1981","unstructured":"Leiserson, C.E. 1981. Area-efficient computation. Ph.D. diss., Carnegie-Mellon Univ., Penn."},{"issue":"6","key":"CR16","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TSE.1984.5010306","volume":"SE-10","author":"U. Manber","year":"1984","unstructured":"Manber, U. 1984. Concurrent maintenance of binary search trees. IEEE Trans. Software Engineering, SE-10, 6 (Nov.):777?784.","journal-title":"IEEE Trans. Software Engineering"},{"key":"CR17","first-page":"191","volume-title":"Proc., 1983 Internat. Conf. on Parallel Processing (Aug.)","author":"J. Mohan","year":"1983","unstructured":"Mohan, J. 1983. Experience with two parallel programs solving the traveling salesman problem. In Proc., 1983 Internat. Conf. on Parallel Processing (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 191?193."},{"key":"CR18","first-page":"597","volume-title":"Proc., ICALP, Lecture Notes in Computer Science, vol. 154","author":"W. Paul","year":"1983","unstructured":"Paul, W., Vishkin, U., and Wagner, H. 1983. Parallel dictionaries on 2?3 trees. In Proc., ICALP, Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, pp. 597?609."},{"key":"CR19","volume-title":"Parallel priority queues. TR 91-016","author":"M.C. Pinotti","year":"1991","unstructured":"Pinotti, M.C., and Pucci, G. 1991. Parallel priority queues. TR 91?016, ICSI, Berkeley (Mar.) (to appear in Inf. Proc. Letters)."},{"key":"CR20","series-title":"Ph.D. diss.","volume-title":"Efficient parallel algorithms and data structures for discrete-event simulation","author":"S. Prasad","year":"1990","unstructured":"Prasad, S. 1990. Efficient parallel algorithms and data structures for discrete-event simulation. Ph.D. diss., Comp. Sci. Dept., Univ. Central Fl., Orlando (Dec.)."},{"key":"CR21","first-page":"350","volume-title":"Proc., Simulation Technology (SIMTEC)","author":"S. Prasad","year":"1991","unstructured":"Prasad, S. 1991. A scalable and efficient optimistic algorithm for parallel discrete-event simulation. In Proc., Simulation Technology (SIMTEC) (Orlando, Oct. 21?23), The Soc. for Comp. Simulation, pp. 350?355."},{"key":"CR22","first-page":"652","volume-title":"Proc., Winter Simulation Conf.","author":"S. Prasad","year":"1991","unstructured":"Prasad, S., and Deo, N. 1991. An efficient and scalable parallel algorithm for discrete-event simulation. In Proc., Winter Simulation Conf. (Phoenix, Ariz., Dec. 8?11), The Soc. for Comp. Simulation, pp. 652?658."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/IPPS.1992.223004","volume-title":"Proc., Internat. Parallel Processing Symp. (Beverly Hills, California, Mar. 23?26)","author":"S. Prasad","year":"1992","unstructured":"Prasad, S., and Deo, N. 1992. Parallel heap: Improved and simplified. In Proc., Internat. Parallel Processing Symp. (Beverly Hills, California, Mar. 23?26), IEEE Comp. Soc. Press, Los Alamitos, California, pp. 448?451."},{"issue":"3","key":"CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"M.J. Quinn","year":"1984","unstructured":"Quinn, M.J., and Deo, N. 1984. Parallel graph algorithms. Computing Surveys, 16, 3 (Sept.):319?348.","journal-title":"Computing Surveys"},{"key":"CR25","first-page":"431","volume-title":"Proc., 1984 Internat. Conf. on Parallel Processing (Aug.)","author":"M.J. Quinn","year":"1984","unstructured":"Quinn, M.J., and Yoo, Y.B. 1984. Data structure for the efficient solution of graph theoretic problems on tightly-coupled MIMD computers. In Proc., 1984 Internat. Conf. on Parallel Processing (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 431?438."},{"issue":"12","key":"CR26","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/12.9744","volume":"37","author":"V.N. Rao","year":"1988","unstructured":"Rao, V.N., and Kumar, V. 1988. Concurrent access of priority queues. IEEE Trans. Comps., 37, 12 (Dec.): 1657?1665.","journal-title":"IEEE Trans. Comps."},{"key":"CR27","series-title":"Tech. rept. AI TR87-45","volume-title":"Parallel heuristic search on a shared memory multiprocessor","author":"V.N. Rao","year":"1987","unstructured":"Rao, V.N., Kumar, V., and Ramesh, K. 1987. Parallel heuristic search on a shared memory multiprocessor. Tech. rept. AI TR87?45, Univ. of Tex. at Austin, Tex. (Jan.)."},{"issue":"7","key":"CR28","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/32.29490","volume":"15","author":"L.M. Wegner","year":"1989","unstructured":"Wegner, L.M., and Teuhola, J.I. 1989. The external heapsort. IEEE Trans. Software Engineering, 15, 7 (July):917?925.","journal-title":"IEEE Trans. Software Engineering"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00128644.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00128644\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00128644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T00:50:34Z","timestamp":1554252634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00128644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF00128644"],"URL":"https:\/\/doi.org\/10.1007\/bf00128644","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}