The Power of Dynamic Distance Oracles-Reference-Cited by-同舟云学术

The Power of Dynamic Distance Oracles

Published:2015-06-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
language:
Short-container-title:

Author:

Łącki Jakub¹,Oćwieja Jakub¹,Pilipczuk Marcin²,Sankowski Piotr¹,Zych Anna¹

Affiliation:

1. University of Warsaw, Warsaw, Poland

2. University of Warwick, Warwick, United Kingdom

Funder

Google

Foundation For Polish Science

Narodowe Centrum Nauki

European Research Council

Publisher

ACM

Link

Reference34 articles.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time;2023 Eleventh International Symposium on Computing and Networking (CANDAR);2023-11-28

3. Chasing Positive Bodies;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs;2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW);2022-11

5. Improved dynamic algorithms for longest increasing subsequence;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15