Internal Sorting

Internal Sorting is a sorting method that operates entirely within the main memory of a computer, distinguishing it from external sorting techniques by not requiring data to be stored or accessed from external storage during the sorting process.

18

Publications

633

Citations

39

Authors

24

Institutions

Publications per year

2017–2026

2

Authors

39

  1. SW
    Samuel W. Reynolds

    IBM (United States), United States

    1 publications · 10 citations

    1

    h-index

  2. TO
    Timo O. Alanko

    University of Helsinki, Finland

    1 publications · 14 citations

    1

    h-index

  3. JT
    Jukka Teuhola

    University of Turku, Finland

    1 publications · 28 citations

    1

    h-index

  4. HE
    Hannu Erkiö

    University of Helsinki, Finland

    1 publications · 14 citations

    1

    h-index

  5. BH
    Brad Hope

    University of Saskatchewan, Canada

    1 publications · 12 citations

    1

    h-index

1–5 of 39

Venues

  1. Communications of the ACM

    3 publications · 322 citations

    3

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 49 citations

    2

    h-index

  3. IEEE Transactions on Computers

    2 publications · 68 citations

    2

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 2 publications · 42 citations

    2

    h-index

  5. Social Policy and Society

    1 publications · 17 citations

    1

    h-index

1–5