메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3221, Issue , 2004, Pages 556-567
On adaptive integer sorting
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTERS;
EID: 35048891479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_50     Document Type: Article
Times cited : (6)
References (14)
  • 1
    • 0001286367 scopus 로고    scopus 로고
    • Improved parallel integer sorting without concurrent writing
    • S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. Inf. Comput., 136:25-51, 1997.
    • (1997) Inf. Comput. , vol.136 , pp. 25-51
    • Albers, S.1    Hagerup, T.2
  • 3
    • 0033691875 scopus 로고    scopus 로고
    • Tight(er) worst-case bounds on dynamic searching and priority queues
    • nd STOC, pages 335-342, 2000.
    • (2000) nd STOC , pp. 335-342
    • Andersson, A.1    Thorup, M.2
  • 4
    • 0032633728 scopus 로고    scopus 로고
    • Optimal bounds for the predecessor problem
    • st STOC, pages 295-304, 1999.
    • (1999) st STOC , pp. 295-304
    • Beame, P.1    Fich, F.2
  • 6
    • 0000743608 scopus 로고
    • Surpassing the information theoretic bound with fusion trees
    • Announced at STOC'90
    • M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993. Announced at STOC'90.
    • (1993) J. Comput. Syst. Sci. , vol.47 , pp. 424-436
    • Fredman, M.L.1    Willard, D.E.2
  • 7
    • 0028459904 scopus 로고
    • Trans-dichotomous algorithms for minimum spanning trees and shortest paths
    • M. L. Predman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533-551, 1994.
    • (1994) J. Comput. Syst. Sci. , vol.48 , pp. 533-551
    • Predman, M.L.1    Willard, D.E.2
  • 9
    • 0036038992 scopus 로고    scopus 로고
    • Deterministic sorting in O(n log log n) time and linear space
    • th STOC, pages 602-608, 2002.
    • (2002) th STOC , pp. 602-608
    • Han, Y.1
  • 10
    • 0036954324 scopus 로고    scopus 로고
    • Integer sorting in O(n √log logn) expected time and linear space
    • rd FOCS, pages 135-144, 2002.
    • (2002) rd FOCS , pp. 135-144
    • Han, Y.1    Thorup, M.2
  • 13
    • 0004244040 scopus 로고
    • Garland Pub. Co., New York
    • R. Sedgewick. Quicksort. Garland Pub. Co., New York, 1980.
    • (1980) Quicksort
    • Sedgewick, R.1
  • 14
    • 0036954494 scopus 로고    scopus 로고
    • Equivalence between priority queues and sorting
    • rd FOCS, pages 125-134, 2002.
    • (2002) rd FOCS , pp. 125-134
    • Thorup, M.1

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