Decomposable searching problems-Reference-Cited by-同舟云学术

Decomposable searching problems

Published:1979-06 Issue:5 Volume:8 Page:244-251
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bentley Jon Louis

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. J.L. Bentley, D. Detig, L. Guibas and J.B. Saxe, An optimal data structure for minimal-storage dynamic member searching to appear.

2. J.L. Bentley and J.B. Saxe, Decomposable searching problems, to appear.

3. An Alphard specification of a correct and efficient transformation on data structures;Bentley;Proc. IEEE Conference on Specifications of Reliable Software,1979

4. A problem in multivariate statistics: algorithm, data structure, and applications;Bentley;Proc. Fifteenth Allerton Conference on Communication, Control and Computing,1977

5. Multidimensional searching problems;Dobkin;SIAM J. Comput.,1976

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

1. Hierarchical categories in colored searching;Computational Geometry;2024-08

2. Competitive Data-Structure Dynamization;ACM Transactions on Algorithms;2024-06-28

3. SWAT: A System-Wide Approach to Tunable Leakage Mitigation in Encrypted Data Stores;Proceedings of the VLDB Endowment;2024-06

4. Computing All Restricted Skyline Probabilities on Uncertain Datasets;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Sum-of-Local-Effects Data Structures for Separable Graphs;Lecture Notes in Computer Science;2023-12-09