Author:
Crauser A.,Mehlhorn K.,Meyer U.,Sanders P.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. Wiley, 1992.
2. L. Arge. Efficient external-memory data structures and applications. PhD thesis, University of Aarhus, BRICS-DS-96-3, 1996.
3. G. S. Brodal, J. L. Träff, and C. D. Zaroliagis. A parallel priority queue with constant time operation. In 11th IPPS, pages 689–693. IEEE, 1997.
4. A. Clementi, L. Kučera, and J. D. P. Rolim. A randomized parallel search strategy. In A. Ferreira and J. D. P. Rolim, editors, Parallel Algorithms for Irregular Problems: State of the Art, pages 213–227. Kluwer, 1994.
5. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths. In 26th STOC, pages 16–26. ACM, 1994.
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献