Parallel Matching Algorithms
Parallel Matching Algorithms is a class of parallel algorithms designed to efficiently solve matching problems in graphs by simultaneously exploring multiple potential matches, thereby reducing computational time compared to sequential approaches.
165
Publications
6.4K
Citations
364
Authors
181
Institutions
Publications per year
2017–2026
22
Parents
165
Ruth Nussinov, George Pieczenik, Jerrold R. Griggs et al. · SIAM Journal on Applied Mathematics · 1978 · 603 citations
Real-time correlative scan matching
Edwin Olson · 2009 · 358 citations
1–5 of 165
364
10
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 364
181

Tel Aviv University
Tel Aviv, Israel
11 h-index
13 publications
666 citations
Columbia University
New York, United States
7 h-index
10 publications
331 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
16 publications
945 citations
University of Maryland, College Park
College Park, United States
6 h-index
10 publications
633 citations
University of California, Berkeley
Berkeley, United States
6 h-index
9 publications
547 citations
Stanford University
Stanford, United States
6 h-index
13 publications
452 citations
Purdue University West Lafayette
West Lafayette, United States
6 h-index
11 publications
371 citations
IBM (United States)
Armonk, United States
5 h-index
5 publications
172 citations
1–8 of 181
12 publications · 349 citations
11
h-index
7 publications · 469 citations
7
h-index
Repository · 5 publications · 103 citations
5
h-index
TPDS · 4 publications · 283 citations
4
h-index
4 publications · 123 citations
4
h-index
1–5