Concepedia

Distribution Sweeping

Distribution Sweeping is an external memory algorithmic technique that belongs to the class of distribution-based sorting and searching methods, distinguished by its use of recursive data partitioning across multiple levels of a memory hierarchy to minimize I/O operations through balanced block distribution and localized sweeping passes.

4

Publications

257

Citations

11

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

4

1–4 of 4

Authors

11

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    1 publications · 181 citations

    1

    h-index

  2. HH
    Herman Haverkort

    Eindhoven University of Technology, Netherlands

    1 publications · 51 citations

    1

    h-index

  3. LA
    Lars Arge

    Aarhus University, Denmark

    1 publications · 181 citations

    1

    h-index

  4. YC
    Yi‐Jen Chiang

    New York University, United States

    1 publications · 15 citations

    1

    h-index

  5. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    1 publications · 10 citations

    1

    h-index

1–5 of 11

Institutions

5

  1. Nokia (United States)

    Coppell, United States

    1 h-index

    2 publications

    362 citations

  2. Duke University

    Durham, United States

    1 h-index

    3 publications

    543 citations

  3. Eindhoven University of Technology

    Eindhoven, The Netherlands

    1 h-index

    1 publications

    51 citations

  4. Bowdoin College

    Brunswick, United States

    1 h-index

    2 publications

    102 citations

  5. Brown University

    Providence, United States

    1 h-index

    1 publications

    15 citations

1–5 of 5

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 51 citations

    1

    h-index

  2. BRICS Report Series

    1 publications · 10 citations

    1

    h-index

  3. Computational Geometry

    1 publications · 15 citations

    1

    h-index

1–3