Fast and efficient operations on Parallel Priority Queues-Reference-Cited by-同舟云学术

Fast and efficient operations on Parallel Priority Queues

Published:1994 Issue: Volume: Page:279-287
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Chen Danny Z.,Hu Xiaobo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58325-4_191

Reference25 articles.

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. “A simple parallel tree contraction algorithm”, J. of Algorithms, 10 (2) (1989), pp. 287–302.

2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

3. F. Bauernoppel and H. Jung. “Implementing abstract data structures in hardware”, Proc. 13th Conf. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 324, 1988, Springer, Berlin, pp. 172–179.

4. G. Bilardi and A. Nicolau. “Adaptive bitonic sorting: An optimal parallel algorithm for sharedmemory machines”, SIAM J. Comput., 18 (1989), pp. 216–228.

5. J. Biswas and J. C. Browne. “Simultaneous update of priority structures,” Proc. Int. Conf. Parallel Processing, 1987, pp. 124–131.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer;Parallel and Distributed Processing and Applications;2006

2. Parallel priority queues based on binomial heaps;Parallel Computing;2000-10

3. Priority queues on parallel machines;Parallel Computing;1999-09

4. Priority queues on parallel machines;Algorithm Theory — SWAT'96;1996