Doug Ierardi

Papers

Total Citations

H-Index

About

Doug Ierardi is a computer scientist whose foundational work in symbolic computation has shaped parallel algorithm design across multiple disciplines. His primary research areas include computational algebra, parallel algorithms, and computational geometry, with a focus on developing efficient methods for polynomial systems. Ierardi’s most influential contribution is his seminal 1990 paper on “Parallel Resultant Computation,” which has garnered 17 citations and introduced a purely algebraic criterion for determining whether a finite collection of polynomials share a common zero. This resultant-based approach proved to be a powerful tool, enabling the creation of both efficient parallel and sequential algorithms that have been applied in symbolic algebra, computational geometry, and computational number theory. Beyond this landmark work, Ierardi’s research has advanced the theoretical foundations of algorithmic problem-solving, bridging the gap between abstract algebraic concepts and practical computational methods. His contributions continue to inspire researchers working at the intersection of algebra and computation, demonstrating how elegant mathematical ideas can drive innovation in parallel and high-performance computing.