Author:
Clementi A.,Kučera L.,Rolim J. D. P.
Reference12 articles.
1. L. Babai, Fortnow L. Levin L and M. Szegedy, “Checking computation in polylogarithmic time”, Proc. of 23th Annual ACM STOC 21-, 1991.
2. B. Bollobas, Random Graphs, Academic Press, 1985.
3. A. Clementi, L. Kucera and J. Rolim, “A Note on Parallel Randomized Algorithms for Searching Problems”, DIMACS - Workshop on Parallel Processing of Discrete Optimization Problems, DIMACS Center, New Jersey - USA, 1994.
4. E. Cohen, “Polylog-time and near-linear work approximation scheme for undirected shortest paths”, Proc. of the 26th Annual ACM STOC, 16–26, 1994.
5. D. Coppersmith, P. Raghavan and M. Tompa, “Parallel Graph Algorithms that are Efficient on Average”, Proc. of the 28th Annual IEEE FOCS, 260269, 1987.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A parallelization of Dijkstra's shortest path algorithm;Mathematical Foundations of Computer Science 1998;1998