Algorithms and Techniques for Parallel Computers

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 30, 1989
Accession Number
ADA252780

Entities

People

  • Zvi Kedem

Organizations

  • New York University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • California
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Information Processing
  • Language
  • Machines
  • Models
  • Parallel Computing
  • Patent Applications
  • Prototypes
  • Theoretical Computer Science
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.