Pages that link to "Item:Q2559140"
From MaRDI portal
The following pages link to Optimal algorithms for parallel polynomial evaluation (Q2559140):
Displaying 15 items.
- Limited width parallel prefix circuits (Q547485) (← links)
- A parallel method for fast and practical high-order Newton interpolation (Q920539) (← links)
- Minimal parallelism for associative computations under time constraints (Q1137382) (← links)
- New algorithms for polynomial and trigonometric interpolation on parallel computers (Q1198975) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Parallel evaluation of Chebyshev and trigonometric series (Q1975694) (← links)
- Berechnungen in partiellen Algebren endlichen Typs (Q2561967) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION (Q4820096) (← links)
- PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM (Q4820172) (← links)
- Fast Parallel Algorithm for Polynomial Evaluation (Q4820805) (← links)
- On the Parallel Evaluation of Dwba Integrals (Q4844588) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- Stability of parallel algorithms to evaluate Chebyshev series (Q5948792) (← links)