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

메뉴 건너뛰기

Acta Informatica

Volumn 35, Issue 9, 1998, Pages 775-793

A tree-based Mergesort

(3) Moffat, Alistair a Petersson, Ola b,c Wormald, Nicholas C a

a UNIVERSITY OF MELBOURNE (Australia)

b LUND UNIVERSITY (Sweden)

c LINNAEUS UNIVERSITY (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032382714 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050142 Document Type: Article

Times cited : (9)

References (13)

1
- 0027693789
- Engineering a sorting function
- J.L. Bentley, M.D. McIlroy: Engineering a sorting function. Softw. Pract. Exper. 23, 1249-1265 (1993)
- (1993) Softw. Pract. Exper. , vol.23 , pp. 1249-1265
- Bentley, J.L.¹ McIlroy, M.D.²

2
- 0038438697
- Design and analysis of a data structure for representing sorted lists
- M.R. Brown, R.E. Tarjan: Design and analysis of a data structure for representing sorted lists. SIAM J. Comput. 9, 594-614 (1980)
- (1980) SIAM J. Comput. , vol.9 , pp. 594-614
- Brown, M.R.¹ Tarjan, R.E.²

3
- 0027606875
- Sublinear merging and natural mergesort
- S. Carlsson, C. Levcopoulos, O. Petersson: Sublinear merging and Natural Mergesort. Algorithmica 9, 629-648 (1993)
- (1993) Algorithmica , vol.9 , pp. 629-648
- Carlsson, S.¹ Levcopoulos, C.² Petersson, O.³

4
- 0019080236
- Best sorting algorithms for nearly sorted lists
- C.R. Cook, D.J. Kim: Best sorting algorithms for nearly sorted lists. Comm. ACM 23, 620-624 (1980)
- (1980) Comm. ACM , vol.23 , pp. 620-624
- Cook, C.R.¹ Kim, D.J.²

5
- 0003026625
- Big omega and big omicron and big theta
- D.E. Knuth: Big omega and big omicron and big theta. SIGACT News 8, 18-24 (1976)
- (1976) SIGACT News , vol.8 , pp. 18-24
- Knuth, D.E.¹

6
- 38149146539
- Sorting shuffled monotone sequences
- C. Levcopoulos, O. Petersson: Sorting shuffled monotone sequences. Inf. Comput. 112, 37-50 (1994)
- (1994) Inf. Comput. , vol.112 , pp. 37-50
- Levcopoulos, C.¹ Petersson, O.²

7
- 38249004027
- Adaptive heapsort
- C. Levcopoulos, O. Petersson: Adaptive Heapsort. J. Algorithms 14, 395-413 (1993)
- (1993) J. Algorithms , vol.14 , pp. 395-413
- Levcopoulos, C.¹ Petersson, O.²

8
- 0022043849
- Measures of presortedness and optimal sorting algorithms
- H. Mannila: Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput. C-34, 318-325 (1985)
- (1985) IEEE Trans. Comput. , vol.34 C , pp. 318-325
- Mannila, H.¹

9
- 0004047313
- Berlin: Springer
- K. Mehlhorn: Data Structures and Algorithms, Vol. I: Sorting and Searching. Berlin: Springer 1984.
- (1984) Data Structures and Algorithms, Vol. I: Sorting and Searching , vol.1
- Mehlhorn, K.¹

10
- 0030193158
- Splaysort: Fast, versatile, practical
- A. Moffat, G. Eddy, O. Petersson: Splaysort: fast, versatile, practical. Softw. Pract. Exper. 26, 781-797 (1996)
- (1996) Softw. Pract. Exper. , vol.26 , pp. 781-797
- Moffat, A.¹ Eddy, G.² Petersson, O.³

11
- 0039594102
- A framework for adaptive sorting
- O. Petersson, A. Moffat: A framework for adaptive sorting. Discrete Appl Math. 59, 153-179 (1995)
- (1995) Discrete Appl Math. , vol.59 , pp. 153-179
- Petersson, O.¹ Moffat, A.²

12
- 0025436383
- Skip lists: A probabilistic alternative to balanced trees
- W. Pugh: Skip lists: a probabilistic alternative to balanced trees. Comm. ACM 33, 668-676 (1990)
- (1990) Comm. ACM , vol.33 , pp. 668-676
- Pugh, W.¹

13
- 0000402933
- Amortized computational complexity
- R.E. Tarjan: Amortized computational complexity. SIAM J. Algebraic Discrete Met 6, 306-318 (1985)
- (1985) SIAM J. Algebraic Discrete Met , vol.6 , pp. 306-318
- Tarjan, R.E.¹

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