메뉴 건너뛰기




Volumn 1, Issue , 1996, Pages 255-262

Parallel and distributed meldable priority queues based on binomial heaps

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; QUEUEING THEORY;

EID: 84947990476     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1996.537167     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 5
    • 0037537068 scopus 로고
    • An optimal parallel priority queue
    • N. Deo and S. Prasad, "An Optimal Parallel Priority Queue", Journal of Supercomputing, Vol. 6, 1992, pp. 87-98.
    • (1992) Journal of Supercomputing , vol.6 , pp. 87-98
    • Deo, N.1    Prasad, S.2
  • 8
    • 0026231041 scopus 로고
    • Optimal initialization algorithms for a class of priority queue
    • S. Olariu and Z. Wen, "Optimal Initialization Algorithms for a Class of Priority Queue", IEEE Trans. on Parallel and Distributed Systems, Vol. 2, No. 4, 1991, pp. 423-430.
    • (1991) IEEE Trans. on Parallel and Distributed Systems , vol.2 , Issue.4 , pp. 423-430
    • Olariu, S.1    Wen, Z.2
  • 10
    • 0001313082 scopus 로고
    • Parallel algorithms for priority queue operations
    • M.C. Pinotti and G. Pucci, "Parallel Algorithms for Priority Queue Operations", Theoretical Computer Science, Vol. 148, 1995, pp. 171-180.
    • (1995) Theoretical Computer Science , vol.148 , pp. 171-180
    • Pinotti, M.C.1    Pucci, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.