Publisher
Zhejiang University Press
Reference26 articles.
1. Aggarwal, A., Park, J., 1988. Notes on Searching Dimensional Monotone Arrays. Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, p. 496–512.
2. Alon, N., Galil, Z., 1991. On the Exponent of the All Pairs Shortest Path Problem. Proc. 32th Annual IEEE Symposium on Foundations of Computer Sciences,32: 569–575.
3. Apostolico, A., Atallah, M.J., Larmore, L., Mc Faddin, H.S., 1990. Efficient parallel algorithms for editing and related problems.SIAM Journal on Computing,19: 968–988.
4. Atallah, M.J., 1990. A Faster Parallel Algorithm for A Matrix Searching Problem. Proc. 2th Scandinaviam Workshop on Algorithm Theory, p. 193–200.
5. Bellman, R., 1958. On a routing problem.Quarterly Journal of Applied Mathematics,16: 87–90.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献