The following publications are possibly variants of this publication:
- Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length OperandsNamrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu. FMCAD 2006: 179-186 [doi]
- Optimization of Arithmetic Datapaths with Finite Word-Length OperandsSivaram Gopalakrishnan, Priyank Kalla, Florian Enescu. aspdac 2007: 511-516 [doi]
- Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic DatapathsNamrata Shekhar, Priyank Kalla, Sivaram Gopalakrishnan, Florian Enescu. iccd 2005: 215-220 [doi]
- Equivalence Verification of Polynomial Datapaths Using Ideal Membership TestingNamrata Shekhar, Sudhakar Kalla, Florian Enescu. tcad, 26(7):1320-1330, 2007. [doi]
- Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring AlgebraNamrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu. tvlsi, 16(4):376-387, 2008. [doi]