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
Parents
16
New Algorithms for Load Balancing in Peer-to-Peer Systems
David R. Karger, Matthias Rühl · 2003 · 41 citations · Full text
1–5 of 16
46
2
h-index
2
h-index
2
h-index
University of Illinois Urbana-Champaign, United States
1 publications · 12 citations
1
h-index
1
h-index
1–5 of 46
21

University of Minnesota
Minneapolis, United States
2 h-index
4 publications
50 citations
University of California, Berkeley
Berkeley, United States
2 h-index
5 publications
129 citations

Paderborn University
Paderborn, Germany
1 h-index
2 publications
70 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
1 h-index
3 publications
51 citations
Tsinghua University
Beijing, China
1 h-index
1 publications
12 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
82 citations
Laboratório Nacional de Computação Científica
Petrópolis, Brazil
1 h-index
1 publications
35 citations
Google (United States)
Mountain View, United States
1 h-index
6 publications
102 citations
1–8 of 21
1 publications · 12 citations
1
h-index
1 publications · 102 citations
1
h-index
Conference · 1 publications · 17 citations
1
h-index
1 publications · 24 citations
1
h-index
IJCSM · 1 publications · 10 citations
1
h-index
1–5