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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 237, Issue 1-2, 2000, Pages 159-181

Asymptotically efficient in-place merging

(3) Geffert, Viliam a Katajainen, Jyrki b Pasanen, Tomi c

a P J AFÁRIK UNIVERSITY (Slovakia)

b UNIVERSITY OF COPENHAGEN (Denmark)

c TURKU CENTRE FOR COMPUTER SCIENCE (Finland)

Author keywords

In place algorithms; Merging; Sorting

Indexed keywords

EID: 0038299745 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(98)00162-5 Document Type: Article

Times cited : (43)

References (16)

1
- 0019527987
- On stable minimum storage merging algorithm
- K. Dudziński, A. Dydek, On stable minimum storage merging algorithm, Inform. Process. Lett. 12 (1981) 5-8.
- (1981) Inform. Process. Lett. , vol.12 , pp. 5-8
- Dudziński, K.¹ Dydek, A.²

2
- 24844479258
- Towards an efficient merging
- Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science, Springer, Berlin
- S. Dvořák, B. Ďurian, Towards an efficient merging, Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 233, Springer, Berlin, 1986, pp. 290-298.
- (1986) Lecture Notes in Computer Science , vol.233 , pp. 290-298
- Dvořák, S.¹ Ďurian, B.²

3
- 0023983459
- Practical in-place merging
- B-C. Huang, M.A. Langston, Practical in-place merging, Comm. ACM 31 (1988) 348-352.
- (1988) Comm. ACM , vol.31 , pp. 348-352
- Huang, B.-C.¹ Langston, M.A.²

4
- 0037624274
- Fast stable merging and sorting in constant extra space
- B-C. Huang, M.A. Langston, Fast stable merging and sorting in constant extra space, Comput. J. 35 (1992) 643-650.
- (1992) Comput. J. , vol.35 , pp. 643-650
- Huang, B.-C.¹ Langston, M.A.²

5
- 0008521852
- A simple algorithm for merging two disjoint linearly ordered sets
- F.K. Hwang, S. Lin, A simple algorithm for merging two disjoint linearly ordered sets, SIAM J. Comput. 1 (1972) 31-39.
- (1972) SIAM J. Comput. , vol.1 , pp. 31-39
- Hwang, F.K.¹ Lin, S.²

6
- 0002229171
- Practical in-place mergesort
- J. Katajainen, T. Pasanen, J. Teuhola, Practical in-place mergesort, Nordic J. Comput. 3 (1996) 27-40.
- (1996) Nordic J. Comput. , vol.3 , pp. 27-40
- Katajainen, J.¹ Pasanen, T.² Teuhola, J.³

7
- 0003657590
- Addison-Wesley, Reading, MA
- D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
- (1973) The Art of Computer Programming, Vol. 3: Sorting and Searching , vol.3
- Knuth, D.E.¹

8
- 0037962596
- Optimal ordering algorithm without operational field
- M.A. Kronrod, Optimal ordering algorithm without operational field, Soviet Math. Dokl. 10 (1969) 744-746.
- (1969) Soviet Math. Dokl. , vol.10 , pp. 744-746
- Kronrod, M.A.¹

9
- 0021422088
- A simple linear-time algorithm for in situ merging
- H. Mannila, E. Ukkonen, A simple linear-time algorithm for in situ merging, Inform. Process. Lett. 18 (1984) 203-208.
- (1984) Inform. Process. Lett. , vol.18 , pp. 203-208
- Mannila, H.¹ Ukkonen, E.²

10
- 38249010040
- Sorting with minimum data movement
- J.I. Munro, V. Raman, Sorting with minimum data movement, J. Algorithms 13 (1992) 374-393.
- (1992) J. Algorithms , vol.13 , pp. 374-393
- Munro, J.I.¹ Raman, V.²

11
- 0030258040
- Selection from read-only memory and sorting with minimum data movement
- J.I. Munro, V. Raman, Selection from read-only memory and sorting with minimum data movement, Theoret. Comput. Sci. 165 (1996) 311-323.
- (1996) Theoret. Comput. Sci. , vol.165 , pp. 311-323
- Munro, J.I.¹ Raman, V.²

12
- 0346909881
- M.Sc. Thesis T-93-3, Department of Computer Science, University of Turku, Turku
- T. Pasanen, Lajittelu minimitilassa, M.Sc. Thesis T-93-3, Department of Computer Science, University of Turku, Turku, 1993.
- (1993) Lajittelu Minimitilassa
- Pasanen, T.¹

13
- 38249035275
- Simplified stable merging tasks
- J.S. Salowe, W.L. Steiger, Simplified stable merging tasks, J. Algorithms 8 (1987) 557-571.
- (1987) J. Algorithms , vol.8 , pp. 557-571
- Salowe, J.S.¹ Steiger, W.L.²

14
- 0344179951
- On the optimality of linear merge
- P.K. Stockmeyer, F.F. Yao, On the optimality of linear merge, SIAM J. Comput. 9 (1980) 85-90.
- (1980) SIAM J. Comput. , vol.9 , pp. 85-90
- Stockmeyer, P.K.¹ Yao, F.F.²

15
- 0038299747
- Optimal stable merging
- A. Symvonis, Optimal stable merging, Comput. J. 38 (1995) 681-690.
- (1995) Comput. J. , vol.38 , pp. 681-690
- Symvonis, A.¹

16
- 0038299744
- Stable sorting and merging with optimal space and time bounds
- L. Trabb Pardo, Stable sorting and merging with optimal space and time bounds, SIAM J. Comput. 6 (1977) 351-372.
- (1977) SIAM J. Comput. , vol.6 , pp. 351-372
- Trabb Pardo, L.¹

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