论文信息 - Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems - 字舞流文

Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems

Jan van Leeuwen | Mark H. Overmars | M. Overmars | J. V. Leeuwen

[1] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[2] Mark H. Overmars. Dynamization of Order Decomposable Set Problems , 1981, J. Algorithms.

[3] Kurt Mehlhorn,et al. Optimal Dynamization of Decomposable Searching Problems , 1981, Inf. Process. Lett..

[4] Jan van Leeuwen,et al. Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds , 1981, Theoretical Computer Science.

[5] Mark H. Overmars. Transforming Semi-Dynamic Data Structures into Dynamic Structures , 1981, WG.

[6] Jan van Leeuwen,et al. Dynamization of Decomposable Searching Problems , 1980, Inf. Process. Lett..

[7] Jon Louis Bentley,et al. Transforming static data structures to dynamic structures , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8] Jon Louis Bentley,et al. Decomposable Searching Problems , 1979, Inf. Process. Lett..

[9] D. Willard,et al. The Super-B-Tree Algorithm. , 1979 .

[10] George S. Lueker,et al. A transformation for adding range restriction capability to dynamic data structures for decomposable , 1979 .