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

메뉴 건너뛰기

Acta Informatica

Volumn 33, Issue 6, 1996, Pages 547-557

Chromatic binary search trees: A structure for concurrent rebalancing

(2) Nurmi, Otto a Soisalon Soininen, Eljas b

a UNIVERSITY OF HELSINKI (Finland)

b AALTO UNIVERSITY (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030502221 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050057 Document Type: Article

Times cited : (40)

References (15)

1
- 0001276534
- An algorithm for the organization of information
- Adel'son-Vels'kii, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet Math. Dokl. 3, 1259-1262 (1962)
- (1962) Soviet Math. Dokl. , vol.3 , pp. 1259-1262
- Adel'son-Vels'kii, G.M.¹ Landis, E.M.²

2
- 0015475519
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Bayer, R.A.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inform. 1, 290-306 (1972)
- (1972) Acta Inform. , vol.1 , pp. 290-306
- Bayer, R.A.¹

3
- 0018030792
- On-the-fly garbage collection: An exercise in cooperation
- Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S., Steffens, E.F.M.: On-the-fly garbage collection: An exercise in cooperation. Comm. ACM 21, 699-975 (1978)
- (1978) Comm. ACM , vol.21 , pp. 699-975
- Dijkstra, E.W.¹ Lamport, L.² Martin, A.J.³ Scholten, C.S.⁴ Steffens, E.F.M.⁵

4
- 0019056762
- Concurrent search in AVL-trees
- Ellis, C.S.: Concurrent search in AVL-trees. IEEE Trans. Computers C-29, 811-817 (1980)
- (1980) IEEE Trans. Computers , vol.C-29 , pp. 811-817
- Ellis, C.S.¹

5
- 0019027623
- Concurrent search and insertions in 2-3 trees
- Ellis, C.S.: Concurrent search and insertions in 2-3 trees. Acta Inform. 14, 63-86 (1980)
- (1980) Acta Inform. , vol.14 , pp. 63-86
- Ellis, C.S.¹

6
- 85039153497
- A dichromatic framework for balanced trees
- Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the 19th IEEE Symp. Foundations of Computer Science, 1978, 8-21.
- (1978) Proceedings of the 19th IEEE Symp. Foundations of Computer Science , pp. 8-21
- Guibas, L.J.¹ Sedgewick, R.²

7
- 0020847841
- On-the-fly optimization of data structures
- Kessels, J.L.W.: On-the-fly optimization of data structures. Comm. ACM 26, 895-901 (1983)
- (1983) Comm. ACM , vol.26 , pp. 895-901
- Kessels, J.L.W.¹

8
- 0039503334
- A concurrent database manipulation problem: Binary search trees
- Kung, H.T., Lehman, P.L.: A concurrent database manipulation problem: Binary search trees. ACM Trans. Database Syst. 5, 339-353 (1980)
- (1980) ACM Trans. Database Syst. , vol.5 , pp. 339-353
- Kung, H.T.¹ Lehman, P.L.²

9
- 0021500156
- Concurrency control in a dynamic search structure
- Manber, U, Ladner, R.E.: Concurrency control in a dynamic search structure. ACM Trans. Database Syst. 9, 439-455 (1984)
- (1984) ACM Trans. Database Syst. , vol.9 , pp. 439-455
- Manber, U.¹ Ladner, R.E.²

10
- 0022060134
- Priority search trees
- McCreight, E.M.: Priority search trees. SIAM J. Comput. 14, 257-276 (1985)
- (1985) SIAM J. Comput. , vol.14 , pp. 257-276
- McCreight, E.M.¹

11
- 0023602666
- Concurrency control in database structures with relaxed balance
- Nurmi, O., Soisalon-Soininen, E., Wood, D.: Concurrency control in database structures with relaxed balance. In: Proceedings of the 6th ACM Conf. Principles of Database Systems, 1987, 170-176.
- (1987) Proceedings of the 6th ACM Conf. Principles of Database Systems , pp. 170-176
- Nurmi, O.¹ Soisalon-Soininen, E.² Wood, D.³

12
- 84976669340
- Planar point location using persistent search trees
- Samak, N., Tarjan, R.E.: Planar point location using persistent search trees. Comm. ACM 29, 669-679 (1986)
- (1986) Comm. ACM , vol.29 , pp. 669-679
- Samak, N.¹ Tarjan, R.E.²

13
- 0022772402
- Tree rebalancing in optimal time and space
- Stout, Q.F., Warren, B.L.: Tree rebalancing in optimal time and space. Comm. ACM 29, 902-908 (1986)
- (1986) Comm. ACM , vol.29 , pp. 902-908
- Stout, Q.F.¹ Warren, B.L.²

14
- 0020763964
- Updating a balanced search tree in O(1) rotations
- Tarjan, R.E.: Updating a balanced search tree in O(1) rotations. Inf. Proc. Lett. 16, 253-257 (1983)
- (1983) Inf. Proc. Lett. , vol.16 , pp. 253-257
- Tarjan, R.E.¹

15
- 0003237296
- Data structures and network algorithms
- Philadelphia, Pa.
- Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa. 1983.
- (1983) Society for Industrial and Applied Mathematics
- Tarjan, R.E.¹

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