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

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 26, Issue 3, 1983, Pages 362-391

A data structure for dynamic trees

(2) Sleator, Daniel D a Endre Tarjan, Robert a

a LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING;

EID: 0020766586 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(83)90006-5 Document Type: Article

Times cited : (847)

References (23)

1
- 0012583137
- On finding lowest common ancestors in trees
- (1975) SIAM Journal on Computing , vol.5 , pp. 115-132
- Aho¹ Hopcroft² Ullman³

2
- 0019244405
- Biased 2–3 trees
- (1980) Proc. Twenty-First Annual IEEE Symp. on Foundations of Computer Science , pp. 248-254
- Bent¹ Sleator² Tarjan³

3
- 84915623619
- S. W. Bent, D. D. Sleator and R.E. Tarjan, “Biased Search Trees”SIAM J. Comput., to appear.

4
- 0004139889
- Freeman, San Francisco, to appear
- (1983) Linear Programming
- Chvatal¹

5
- 0004253669
- Prentice-Hall, Englewood Cliffs, N.J
- (1976) A Discipline of Programming
- Dijkstra¹

6
- 0000891810
- An algorithm for the solution of a problem of maximal flow in a network with power estimation
- (1970) Soviet Math. Dokl. , vol.11 , pp. 1277-1280
- Dinits¹

7
- 84915623618
- H. N. Gabow and R. E. Tarjan, Efficient algorithms for a family of matroid problems, J. Algorithms, to appear.

8
- 84989696344
- 2 V) algorithm for the maximal flow problem
- (1980) Journal of Computer and System Sciences , vol.21 , pp. 203-217
- Galil¹ Naamad²

9
- 85039153497
- A dichromatic framework for balanced trees
- (1978) Proc. Nineteenth Annual IEEE Symp. on Foundations of Computer Science , pp. 8-21
- Guibas¹ Sedcewick²

10
- 84915623617
- D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., to appear.

11
- 0001137959
- Determining the maximal flow in a network by the method of preflows
- (1974) Soviet Math. Dokl. , vol.15 , pp. 434-437
- Karzanov¹

12
- 77950860356
- Addison-Wesley, Reading, Mass
- (1974) The Art of Computer Programming, Vol. 3: Sorting and Searching
- Knuth¹

13
- 70349858609
- An efficient method for storing ancestor information in trees
- (1979) SIAM Journal on Computing , vol.8 , pp. 599-618
- Maier¹

14
- 0000327844
- 3) algorithm for maximum flows in networks
- (1978) Inform. Proc. Lett. , vol.7 , pp. 277-278
- Malhotra¹ Kumar² Maheshwari³

15
- 0007082977
- Binary search trees of bounded balance
- (1973) SIAM Journal on Computing , vol.2 , pp. 33-43
- Nievergelt¹ Reingold²

16
- 84874566091
- 2 I) Maximum-Flow Algorithm
- Computer Science Department, Stanford University, Stanford, Calif
- (1978) Tech. Rep. STAN-CS-78-702
- Shiloach¹

17
- 84874577918
- An O(nm log n) Algorithm for Maximum Network Flow
- Computer Science Department, Stanford University, Stanford, Calif
- (1980) Tech. Rep. STAN-CS80-831
- Sleator¹

18
- 84974568193
- A data structure for dynamic trees
- (1981) Proc. Thirteenth Annual ACM Symp. on Theory of Computing , pp. 114-122
- Sleator¹ Tarjan²

19
- 0016495233
- Efficiency of a good but not linear set union algorithm
- (1975) J. Assoc. Comput. Mach. , vol.22 , pp. 215-225
- Tarjan¹

20
- 0018533367
- Applications of path compression on balanced trees
- (1979) J. Assoc. Comput. Mach. , vol.26 , pp. 690-715
- Tarjan¹

21
- 84915623616
- R. E. Tarjan and J. van Leeuwen, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., to appear.

22
- 0020902050
- Self-adjusting binary trees
- (1983) Proc. Fifteenth Annual ACM Symp. on Theory of Computing , pp. 235-245
- Sleator¹ Tarjan²

23
- 84915623615
- R. E. Tarjan, “Data Structures and Network Algorithms,” Society for Industrial and Applied Mathematics, Philadelphia, Penn., to appear.

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