Distributed Processing and A Parallel Algorithm for Merging Relaxed Min-Max Heaps
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 5, pp. 1162-1171, May. 1998
10.3745/KIPSTE.1998.5.5.1162, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
M. Y. Sik, "Distributed Processing and A Parallel Algorithm for Merging Relaxed Min-Max Heaps," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 5, pp. 1162-1171, 1998. DOI: 10.3745/KIPSTE.1998.5.5.1162.
[ACM Style]
Min Yong Sik. 1998. Distributed Processing and A Parallel Algorithm for Merging Relaxed Min-Max Heaps. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 5, (1998), 1162-1171. DOI: 10.3745/KIPSTE.1998.5.5.1162.