Prefix-based Sorting

Prefix-Based Sorting is a parallel sorting algorithm that organizes elements by distributing them across processors based on the prefix of their keys, where the distribution and comparison logic are determined by the lexicographic ordering of key prefixes to enable efficient, scalable sorting in distributed memory systems.

26

Publications

1.5K

Citations

44

Authors

31

Institutions

Publications per year

2017–2026

0

Authors

44

  1. SD
    Sarang Dharmapurikar

    Washington University in St. Louis, United States

    3 publications · 548 citations

    3

    h-index

  2. DE
    David E. Taylor

    Washington University in St. Louis, United States

    3 publications · 548 citations

    3

    h-index

  3. PT
    Praveen Thaggikuppe Krishnamurthy

    JSS Academy of Higher Education and Research, India

    3 publications · 548 citations

    3

    h-index

  4. NY
    Nuri Yazdani

    ETH Zurich, Switzerland

    2 publications · 72 citations

    2

    h-index

  5. DS
    David S. L. Wei

    Fordham University, United States

    2 publications · 37 citations

    2

    h-index

1–5 of 44

Venues

  1. Journal of Parallel and Distributed Computing

    3 publications · 48 citations

    3

    h-index

  2. Theoretical Computer Science

    2 publications · 110 citations

    2

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 136 citations

    2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 13 citations

    1

    h-index

  5. Parallel Computing

    1 publications · 11 citations

    1

    h-index

1–5