Algorithms and Techniques for Parallel Computers

reportActive / Technical Report | Accession Number: ADA252780 | Open PDF

Abstract:

Many new paradigms and techniques were developed to aid the design of parallel algorithms. The results include the deterministic coin tossing method for breaking symmetries, the cascading divide and conquer paradigm which gave a new algorithm for parallel sort, the Ear-Decomposition search method for graphs, the strongest results so far for parallel graph connectivity, finding lowest common ancestors in trees, two methods for parallel string matching and methods for string matching in the presence of errors.

Author(s):
Kedem, Zvi
Author Organization(s):
NEW YORK UNIV NY COURANT INST OF MATHEMATICAL SCIENCES
Descriptive Note:
Final rept. 15 Oct 1984-30 Nov 1989
Supplementary Note:
DOI: 10.21236/ADA252780
Pagination:
0007

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.

RECORD

Collection: TR
Identifying Numbers
Contract/Grant Number(s):
N00014-85-K-0046
Monitor Series:
OCNR
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*ALGORITHMS, *PARALLEL PROCESSORS, METHODOLOGY, ABSTRACTS, SYSTEMS ENGINEERING, BIBLIOGRAPHIES
Field(s)/Group(s):
Computer Hardware
Report Date:
1989 Nov 30