Parallel Generation of Postfix and Tree Forms.

Abstract

Efficient parallel algorithms to obtain the postfix and tree forms of an infix arithmetic expression are developed. The shared memory model of parallel computing is used. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1981
Accession Number
ADA116290

Entities

People

  • Eliezer Dekel
  • Sartaj Sahni

Organizations

  • University of Minnesota

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Computations
  • Computer Science
  • Computers
  • Demographic Cohorts
  • Digital Information
  • Instructions
  • Iterations
  • Lists (Data Structures)
  • Mathematics
  • Parallel Computing
  • Test And Evaluation
  • Trees (Data Structures)

Readers

  • Computational Linguistics
  • Parallel and Distributed Computing.