Coarse grained gather and scatter operations with applications-Reference-Cited by-同舟云学术

Coarse grained gather and scatter operations with applications

Published:2004-11 Issue:11 Volume:64 Page:1297-1310
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Boxer Laurence,Miller Russ

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference36 articles.

1. Approximate matching of polygonal shapes;Alt,1991

2. The Boyer–Moore–Galil string searching strategies revisited;Apostolico;SIAM J. Comput.,1986

3. A linear time algorithm for the Hausdorff distance between convex polygons;Atallah;Inform. Process. Lett.,1983

4. On Hausdorff-like metrics for fuzzy sets;Boxer;Pattern Recognition Lett.,1997

5. L. Boxer, R. Haralick, Even faster point set pattern matching in 3-d, Technical Report 2001-01, SUNY, Buffalo Department of Computer Science and Engineering.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hyperspaces and function graphs in digital topology;Filomat;2023

2. Beyond the Hausdorff metric in digital topology;Applied General Topology;2022-04-01

3. Coarse Grained Parallel Selection;Parallel Processing Letters;2021-02-24

4. Practical, distributed, low overhead algorithms for irregular gather and scatter collectives;Parallel Computing;2018-07

5. Practical, linear-time, fully distributed algorithms for irregular gather and scatter;Proceedings of the 24th European MPI Users' Group Meeting on - EuroMPI '17;2017