| 2025 | ASPDAC | An Algebraic Approach to Partial Synthesis of Arithmetic Circuits. | Bhavani Sampathkumar, Ritaja Das, Bailey Martin, Florian Enescu, Priyank Kalla |
| 2021 | ICCD | Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques. | Vikas Rao, Haden Ondricek, Priyank Kalla, Florian Enescu |
| 2019 | ETS | Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Grbner Bases. | Utkarsh Gupta, Priyank Kalla, Irina Ilioaea, Florian Enescu |
| 2018 | FMCAD | 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 |
| 2016 | CP | Finding Unsatisfiable Cores of a Set of Polynomials Using the Grbner Basis Algorithm. | Xiaojun Sun, Irina Ilioaea, Priyank Kalla, Florian Enescu |
| 2015 | DATE | Formal verification of sequential Galois field arithmetic circuits using algebraic geometry. | Xiaojun Sun, Priyank Kalla, Tim Pruss, Florian Enescu |
| 2014 | DAC | Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Grbner Bases. | Tim Pruss, Priyank Kalla, Florian Enescu |
| 2012 | DATE | Efficient Grbner basis reductions for formal verification of galois field multipliers. | Jinpeng Lv, Priyank Kalla, Florian Enescu |
| 2007 | ASPDAC | Optimization of Arithmetic Datapaths with Finite Word-Length Operands. | Sivaram Gopalakrishnan, Priyank Kalla, Florian Enescu |
| 2007 | ICCAD | Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors. | Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon Meredith, Florian Enescu |
| 2006 | DATE | Equivalence verification of arithmetic datapaths with multiple word-length operands. | Namrata Shekhar, Priyank Kalla, Florian Enescu |
| 2006 | FMCAD | Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. | Namrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu |
| 2005 | ICCAD | Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. | Namrata Shekhar, Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan |
| 2005 | ICCD | Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. | Namrata Shekhar, Priyank Kalla, Sivaram Gopalakrishnan, Florian Enescu |