Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference38 articles.
1. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing. 28(4), 1167–1181 (1999)
2. Alon, N., Galil, Z., Margalit, O.: On the exponet of the all pairs shortest path problem. In: Proc. 32st IEEE Symposium on Foundations of Computer Science, pp. 569–575 (1991)
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences. 58(1), 137–147 (1999)
4. Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1), 263–277 (1998)
5. Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.: Adapting to asynchronous dynamic networks. In: Proc. 24th ACM Symposium on Theory of Computing, pp. 557–570 (1992)
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献