Integrating CNF and BDD based SAT solvers. - Sivaram Gopalakrishnan; Vijay Durairaj; Priyank Kalla (HLDVT, 2003)

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)

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)

Optimization of polynomial datapaths using finite ring algebra. - Sivaram Gopalakrishnan; Priyank Kalla (ACM Trans. Design Autom. Electr. Syst., 2007)

Verification of arithmetic datapaths using polynomial function models and congruence solving. - Neal Tew; Priyank Kalla; Namrata Shekhar; Sivaram Gopalakrishnan (ICCAD, 2008)

Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis. - Sivaram Gopalakrishnan; Priyank Kalla (DATE, 2009)

2009 ACM TODAES best paper award: Optimization of polynomial datapaths using finite ring algebra. - Sivaram Gopalakrishnan; Priyank Kalla (ACM Trans. Design Autom. Electr. Syst., 2009)