SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Information Processing Letters

Volumn 12, Issue 4, 1981, Pages 168-173

Worst-case optimal insertion and deletion methods for decomposable searching problems

(2) Overmars, Mark H a van Leeuwen, Jan a

a UTRECHT UNIVERSITY (Netherlands)

Author keywords

Decomposable searching problems; deletion; dynamization; insertion; nearest neighbor searching; range querying; worst case bound

Indexed keywords

EID: 0042008956 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(81)90093-4 Document Type: Article

Times cited : (82)

References (15)

1
- 0018480594
- Decomposable searching problems
- (1979) Information Processing Lett. , vol.8 , Issue.5 , pp. 244-251
- Bentley¹

2
- 84909560799
- Dept. of Computer Science, UBC, Vancouver, Canada, preprint
- (1979) Optimal search in planar subdivisions
- Kirkpatrick¹

3
- 85035805199
- A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems
- Dept. of Information and Computer Science, University of California, Irvine
- (1978) Techn. Rep.
- Lueker¹

4
- 84914842047
- Inst. für Informationsverarbeit, TU Graz
- (1979) Dynamic solutions of decomposable searching problems , vol.33 Bericht
- Maurer¹ Ottman²

5
- 84914840099
- Lowerbounds on the efficiency of static to dynamic transformations of data structures
- Universität des Saarlandes, Saarbrücken
- (1980) Techn. Rep. A 80/05 , vol.10 Fachbereich
- Mehlhorn¹

6
- 0038593225
- Optimal dynamization of decomposable searching problems
- (1981) Information Processing Lett. , vol.12 , Issue.2 , pp. 93-98
- Mehlhorn¹ Overmars²

7
- 84914862163
- Dynamization of order decomposable set problems
- University of Utrecht, Utrecht, (To appear in J. Algorithms.)
- (1980) Techn. Rep. RUU-CS-80-9
- Overmars¹

8
- 67949105313
- (in preparation)
- (1981) Transforming semi-dynamic data structures into dynamic structures
- Overmars¹

9
- 0039527687
- Two general methods for dynamizing decomposable searching problems
- (1981) Computing , vol.26 , pp. 155-166
- Overmars¹ van Leeuwen²

10
- 0346395008
- Dynamizations of decomposable searching problems yielding good worst-case bounds
- Springer Lecture Notes in Computer Science, Springer-Verlag
- (1981) Proc. 5th GI Fachtagung Theoretische Informatik , vol.104 , pp. 224-233
- Overmars¹ van Leeuwen²

11
- 0018683298
- Transforming static data structures to dynamic structures
- (1979) Proc. 20th Annual IEEE Symposium on Foundations of Computer Science , pp. 148-168
- Saxe¹ Bentley²

12
- 0004229086
- Computational geometry
- Yale University, (to be published)
- (1978) Ph.D. thesis
- Shamos¹

13
- 84914833889
- Inst. für Informationsverarbeit, TU Graz
- (1980) Dynamic systems of static data structures , vol.42 Bericht
- van Leeuwen¹ Maurer²

14
- 0346648512
- Dynamization of decomposable searching problems
- (1980) Information Processing Lett. , vol.10 , Issue.2 , pp. 51-56
- van Leeuwen¹ Wood²

15
- 24744463163
- Aiken Computer Laboratory, Harvard University, Cambridge, U.S.A, TR-03-79
- (1979) The super B-tree algorithm
- Willard¹

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