Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. - Namrata Shekhar; Priyank Kalla; Florian Enescu; Sivaram Gopalakrishnan (ICCAD, 2005)

Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. - Namrata Shekhar; Priyank Kalla; Sivaram Gopalakrishnan; Florian Enescu (ICCD, 2005)

Equivalence verification of arithmetic datapaths with multiple word-length operands. - Namrata Shekhar; Priyank Kalla; Florian Enescu (DATE, 2006)

Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. - Namrata Shekhar; Priyank Kalla; M. Brandon Meredith; Florian Enescu (FMCAD, 2006)

Optimization of Arithmetic Datapaths with Finite Word-Length Operands. - Sivaram Gopalakrishnan; Priyank Kalla; Florian Enescu (ASP-DAC, 2007)

Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors. - Sivaram Gopalakrishnan; Priyank Kalla; M. Brandon Meredith; Florian Enescu (ICCAD, 2007)

Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing. - Namrata Shekhar; Sudhakar Kalla; Florian Enescu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007)

Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra. - Namrata Shekhar; Priyank Kalla; M. Brandon Meredith; Florian Enescu (IEEE Trans. Very Large Scale Integr. Syst., 2008)

Verification of composite Galois field multipliers over GF ((2m)n) using computer algebra techniques. - Jinpeng Lv; Priyank Kalla; Florian Enescu (HLDVT, 2011)

Efficient Gröbner basis reductions for formal verification of galois field multipliers. - Jinpeng Lv; Priyank Kalla; Florian Enescu (DATE, 2012)

Efficient Gröbner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits. - Jinpeng Lv; Priyank Kalla; Florian Enescu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013)

Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases. - Tim Pruss; Priyank Kalla; Florian Enescu (DAC, 2014)

Formal verification of sequential Galois field arithmetic circuits using algebraic geometry. - Xiaojun Sun; Priyank Kalla; Tim Pruss; Florian Enescu (DATE, 2015)

Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm. - Xiaojun Sun; Irina Ilioaea; Priyank Kalla; Florian Enescu (CP, 2016)

Word-level traversal of finite state machines using algebraic geometry. - Xiaojun Sun; Priyank Kalla; Florian Enescu (HLDVT, 2016)

Efficient Symbolic Computation for Word-Level Abstraction From Combinational Circuits for Verification Over Finite Fields. - Tim Pruss; Priyank Kalla; Florian Enescu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2016)

Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques. - Vikas Rao; Utkarsh Gupta; Irina Ilioaea; Arpitha Srinath; Priyank Kalla; Florian Enescu (FMCAD, 2018)

On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields. - Utkarsh Gupta; Irina Ilioaea; Vikas Rao; Arpitha Srinath; Priyank Kalla; Florian Enescu (VLSI-SoC, 2018)

Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields. - Utkarsh Gupta; Irina Ilioaea; Vikas Rao; Arpitha Srinath; Priyank Kalla; Florian Enescu (VLSI-SoC (Selected Papers), 2018)

Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases. - Utkarsh Gupta; Priyank Kalla; Irina Ilioaea; Florian Enescu (ETS, 2019)

Computing the invariants of intersection algebras of principal monomial ideals. - Florian Enescu; Sandra Spiroff (Int. J. Algebra Comput., 2019)

Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques. - Vikas Rao; Haden Ondricek; Priyank Kalla; Florian Enescu (ICCD, 2021)

Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits. - Vikas Rao; Irina Ilioaea; Haden Ondricek; Priyank Kalla; Florian Enescu (ISQED, 2021)

Algebraic Techniques for Rectification of Finite Field Circuits. - Vikas Rao; Haden Ondricek; Priyank Kalla; Florian Enescu (VLSI-SoC, 2021)

Logic Synthesis from Polynomials with Coefficients in the Field of Rationals. - Bhavani Sampathkumar; Bailey Martin; Ritaja Das; Priyank Kalla; Florian Enescu (ISMVL, 2023)

An Algebraic Approach to Partial Synthesis of Arithmetic Circuits. - Bhavani Sampathkumar; Ritaja Das; Bailey Martin; Florian Enescu; Priyank Kalla (ASP-DAC, 2025)