메뉴 건너뛰기




Volumn 1, Issue 1-4, 1986, Pages 133-162

Fractional cascading: I. A data structuring technique

Author keywords

B tree; Binary search; Dynamization of data structures; Iterative search; Multiple look up; Range query

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; INFORMATION SCIENCE - INFORMATION RETRIEVAL; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

EID: 0023010037     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01840440     Document Type: Article
Times cited : (367)

References (12)
  • 3
    • 84936681481 scopus 로고    scopus 로고
    • B. Chazelle. Filtering search: A new approach to query-answering. Proc. 24th Ann. Symp. Found. Comp. Sci. (1983), pp. 122–132. To appear in SIAM J. Comput. (1986).
  • 4
    • 84936681486 scopus 로고    scopus 로고
    • B. Chazelle and L. J. Guibas. Fractional cascading II: applications. To appear in Algorithmica (1986).
  • 6
    • 84936681487 scopus 로고    scopus 로고
    • O. Fries, K. Mehlhorn, and St. Näher. Dynamization of geometric data structures. Proc. 1st ACM Computational Geometry Symposium, 1985, pp. 168–176.
  • 7
    • 84936681484 scopus 로고    scopus 로고
    • H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. To appear in SIAM J. Comput. Also DEC/SRC Research Report No. 2, 1984.
  • 8
    • 84936681485 scopus 로고    scopus 로고
    • H. Imai and T. Asano. Dynamic segment intersection search with applications, Proc. of 25th FOCS Sumposium, 1984, pp. 393–402.
  • 9
    • 84936681478 scopus 로고    scopus 로고
    • H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Proc. of 24th FOCS Symposium, 1983, pp. 246–251.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.