Parallel restructuring and evaluation of expressions
From MaRDI portal
Publication:1185242
DOI10.1016/0022-0000(92)90003-2zbMath0743.68068OpenAlexW2047057182MaRDI QIDQ1185242
Franco P. Preparata, David E. Muller
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
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
- Optimal parallel generation of a computation tree form
- Parallel Prefix Computation
- New lower bound techniques for VLSI
- Time Bounds on the Parallel Evaluation of Arithmetic Expressions
- Efficient Parallel Evaluation of Boolean Expressions
- Bounds to Complexities of Networks for Sorting and for Switching
- Restructuring of Arithmetic Expressions For Parallel Evaluation
- The Parallel Evaluation of General Arithmetic Expressions
- On the Parallel Evaluation of Polynomials
- The Parallel Evaluation of Arithmetic Expressions Without Division
This page was built for publication: Parallel restructuring and evaluation of expressions