Author:
Kawarabayashi Ken-ichi,Klein Philip N.,Sommer Christian
Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorithms, pp. 531–540 (2004)
2. Abraham, I., Gavoille, C.: Object location using path separators. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 188???197 (2006);
3. Details in LaBRI Research Report RR-1394-06
4. Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1(2), 243–264 (2005)
5. Bartal, Y., Gottlieb, L.-A., Kopelowitz, T., Lewenstein, M., Roditty, L.: Fast, precise and dynamic distance queries. CoRR, abs/1008.1480 (2010) (to appear in SODA 2011)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献