Parallel restructuring and evaluation of expressions

DOI10.1016/0022-0000(92)90003-2MaRDI QIDQ1185242zbMATH OpenOpenAlexFDO

Authors David E. Muller, F. P. Preparata

Publication date 28 June 1992

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/74232

zbMATH Keywords

boolean networklogarithmic-depth evaluatorsroutingtree-structured expressionsuniversal evaluator

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 4213451
• scientific article; zbMATH DE number 515222
• scientific article; zbMATH DE number 4172382
• Parallel computation of arithmetic expressions involving unary functions
• scientific article; zbMATH DE number 3958731

Cites work

• Bounds to Complexities of Networks for Sorting and for Switching
• Efficient Parallel Evaluation of Boolean Expressions
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• scientific article; zbMATH DE number 4011928 (Why is no real title available?)
• scientific article; zbMATH DE number 4064466 (Why is no real title available?)
• scientific article; zbMATH DE number 4064467 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• scientific article; zbMATH DE number 3430129 (Why is no real title available?)
• scientific article; zbMATH DE number 3304493 (Why is no real title available?)
• New lower bound techniques for VLSI
• On the Parallel Evaluation of Polynomials
• Optimal parallel generation of a computation tree form
• Parallel Prefix Computation
• Restructuring of Arithmetic Expressions For Parallel Evaluation
• The Parallel Evaluation of Arithmetic Expressions Without Division
• The Parallel Evaluation of General Arithmetic Expressions
• Time Bounds on the Parallel Evaluation of Arithmetic Expressions

Cited in

(13)

• On the parallel evaluation of division-free arithmetic expressions with fan-in of three
• Lenient evaluation and parallelism
• Evaluation of linear, quadratic and cubic expressions on a binary tree
• scientific article; zbMATH DE number 440476 (Why is no real title available?)
• scientific article; zbMATH DE number 4172382 (Why is no real title available?)
• scientific article; zbMATH DE number 4205977 (Why is no real title available?)
• scientific article; zbMATH DE number 4213451 (Why is no real title available?)
• scientific article; zbMATH DE number 4139290 (Why is no real title available?)
• Expressibility and Parallel Complexity
• Evaluating uniform expressions within two steps of minimum parallel time
• scientific article; zbMATH DE number 1552516 (Why is no real title available?)
• Balancing Expression Dags for More Efficient Lazy Adaptive Evaluation
• Parallel computation of arithmetic expressions involving unary functions

This page was built for publication: Parallel restructuring and evaluation of expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185242)