Accession Number : ADA116290

Title :   Parallel Generation of Postfix and Tree Forms.

Descriptive Note : Technical rept.,

Corporate Author : MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE

Personal Author(s) : Dekel,Eliezer ; Sahni,Sartaj

PDF Url : ADA116290

Report Date : Apr 1981

Pagination or Media Count : 21

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)

Descriptors :   *Algorithms, *Parallel processing, Time sharing, Memory devices, Computations, Mathematical analysis, Operators(Mathematics), Trees, Efficiency

Subject Categories : Theoretical Mathematics
      Computer Hardware
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE