Communication-Avoiding Search is a parallel search strategy that belongs to the class of communication-avoiding algorithms, distinguished by its explicit minimization of data movement and inter-process communication overhead during the search process to enhance scalability and efficiency in distributed-memory systems.
3
Publications
108
Citations
12
Authors
7
Institutions
Publications per year
2017–2026
1
Parents
Publications
3
1–3 of 3
Authors
12
- MA
1
h-index
- FH
1
h-index
- CA
1
h-index
- MM
1
h-index
- SP
1
h-index
1–5 of 12
Institutions
7
Technische Universität Braunschweig
Braunschweig, Germany
1 h-index
1 publications
43 citations
Knox College
Galesburg, United States
1 h-index
1 publications
43 citations
Sandia National Laboratories California
Livermore, United States
1 h-index
2 publications
86 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
43 citations
Roosevelt Institute for American Studies
Middelburg, The Netherlands
1 h-index
1 publications
43 citations
Pennsylvania State University
State College, United States
1 h-index
2 publications
100 citations
Stony Brook University
Stony Brook, United States
1 h-index
1 publications
43 citations
1–7 of 7
Venues
- SIAM Journal on Optimization
1 publications · 15 citations
1
h-index
- Algorithmica
1 publications · 43 citations
1
h-index
1–2