Parallel restructuring and evaluation of expressions
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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
(9)- Lenient evaluation and parallelism
- Balancing Expression Dags for More Efficient Lazy Adaptive Evaluation
- scientific article; zbMATH DE number 1552516 (Why is no real title available?)
- scientific article; zbMATH DE number 440476 (Why is no real title available?)
- scientific article; zbMATH DE number 4139290 (Why is no real title available?)
- scientific article; zbMATH DE number 4172382 (Why is no real title available?)
- Evaluation of linear, quadratic and cubic expressions on a binary tree
- Expressibility and Parallel Complexity
- On the parallel evaluation of division-free arithmetic expressions with fan-in of three
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)