Load-balanced Search

Load-Balanced Search is a parallel search strategy that distributes search tasks evenly across processing units to minimize idle time and maximize resource utilization, thereby improving overall search efficiency.

16

Publications

434

Citations

46

Authors

21

Institutions

Publications per year

2017–2026

3

Authors

46

  1. VK
    Vipin Kumar

    University of Minnesota, United States

    2 publications · 25 citations

    2

    h-index

  2. GK
    George Karypis

    University of Minnesota, United States

    2 publications · 25 citations

    2

    h-index

  3. RB
    Ricardo Baeza‐Yates

    University of Chile, Chile

    2 publications · 52 citations

    2

    h-index

  4. LV
    Laxmikant V. Kalé

    University of Illinois Urbana-Champaign, United States

    1 publications · 12 citations

    1

    h-index

  5. VS
    Volker Schnecke

    AstraZeneca (Sweden), Sweden

    1 publications · 35 citations

    1

    h-index

1–5 of 46

Venues

  1. Journal of Geology & Geosciences

    1 publications · 12 citations

    1

    h-index

  2. Computer Networks and ISDN Systems

    1 publications · 102 citations

    1

    h-index

  3. Scalable Information Systems

    Conference · 1 publications · 17 citations

    1

    h-index

  4. 1

    h-index

  5. International Journal of Computing Science and Mathematics

    IJCSM · 1 publications · 10 citations

    1

    h-index

1–5