메뉴 건너뛰기




Volumn 3, Issue , 1998, Pages 7-

Implementing Radixsort

Author keywords

adaptive radixsort; Algorithms; forward radixsort; radix sorting; Sorting; String sorting

Indexed keywords


EID: 85009166635     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/297096.297136     Document Type: Article
Times cited : (31)

References (16)
  • 6
    • 33646133959 scopus 로고
    • A fast radix sort
    • Davis, I. J. 1992. A fast radix sort. The Computer Journal 35, 6, 636-642.
    • (1992) The Computer Journal , vol.35 , Issue.6 , pp. 636-642
    • Davis, I.J.1
  • 8
  • 9
    • 0002755598 scopus 로고
    • Searching and sorting real numbers
    • Ehelich, G. 1981. Searching and sorting real numbers. Journal of Algorithms 2, 1, 1-12.
    • (1981) Journal of Algorithms , vol.2 , Issue.1 , pp. 1-12
    • Ehelich, G.1
  • 12
    • 0347669813 scopus 로고
    • of Data Structures and Algorithms. Springer-Verlag
    • Mehlhoen, K. 1984. Sorting and Searching, Volume 1 of Data Structures and Algorithms. Springer-Verlag.
    • (1984) Sorting and Searching , vol.1
    • Mehlhoen, K.1
  • 13
    • 0023566630 scopus 로고
    • Three partition refinement algorithms
    • Paige, R. and Taejan, R. E. 1987. Three partition refinement algorithms. SIAM Journal on Computing 16, 6, 973-989.
    • (1987) SIAM Journal on Computing , vol.16 , Issue.6 , pp. 973-989
    • Paige, R.1    Taejan, R.E.2
  • 15
    • 0344058547 scopus 로고
    • Two levels are as good as any
    • Tamminen, M. 1985. Two levels are as good as any. Journal of Algorithms 6, 1, 138-144.
    • (1985) Journal of Algorithms , vol.6 , Issue.1 , pp. 138-144
    • Tamminen, M.1


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