Computing on a free tree via complexity-preserving mappings-Reference-Cited by-同舟云学术

Computing on a free tree via complexity-preserving mappings

Published:1987-11 Issue:1-4 Volume:2 Page:337-361
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Chazelle Bernard

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01840366.pdf

Reference18 articles.

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

2. J. L. Bentley, Multidimensional divide and conquer,Comm. ACM,23 (1980), 214–229.

3. B. Chazelle, A functional approach to data structures and its use in multidimensional searching,SIAM J. Comput. (in press). Preliminary version inProceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 165–174.

4. B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique,Algorithmica,1 (1986), 133–162.

5. H. Edelsbrunner, A new approach to rectangle intersections, Part II,Internat. J. Comput. Math.,13 (1983) 221–229.

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

1. Shortest Beer Path Queries in Outerplanar Graphs;Algorithmica;2022-12-15

2. Low Treewidth Embeddings of Planar and Minor-Free Metrics;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. Can't See the Forest for the Trees;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

4. Optimal vertex connectivity oracles;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Tree path majority data structures;Theoretical Computer Science;2020-09