Author:
Demaine Erik D.,Landau Gad M.,Weimann Oren
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Agarwal, P.K., Arge, L., Danner, A., Holland-Minkley, B.: Cache-oblivious data structures for orthogonal range searching. In: Proceedings of the 19th annual ACM Symposium on Computational Geometry (SCG), pp. 237–245 (2003)
2. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
3. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report, TR-71/87, Institute of Computer Science, Tel Aviv University (1987)
4. Alstrup, S., Spork, M.: Optimal on-line decremental connectivity in trees. Information Processing Letters 64(4), 161–164 (1997)
5. Lecture Notes in Computer Science;A. Amir,2007
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems;String Processing and Information Retrieval;2023
2. Uniqueness of best proximity pairs and rigidity of semimetric spaces;Journal of Fixed Point Theory and Applications;2022-12-23
3. Bipartite graphs and best proximity pairs;Journal of Mathematical Sciences;2022-07
4. Optimal vertex connectivity oracles;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Minimum Spanning Paths and Hausdorff Distance in Finite Ultrametric Spaces;p-Adic Numbers, Ultrametric Analysis and Applications;2022-05-23