Algebraic Techniques to Enhance Common Sub-Expression Extraction for Polynomial System Synthesis, by Sivaram Gopalakrishnan, and Priyank Kalla, in Design Automation and Test in Europe, (DATE) 2009.

Verification of Arithmetic Datapaths using Polynomial Function Models and Congruence Solving, by Neal Tew, Priyank Kalla, Namrata Shekhar and Sivaram Gopalakrishnan, in  Proc. International Conference on Computer-Aided Design (ICCAD) 2008.

Integrating Common Sub-Expression Elimination with Algebraic Methods for Polynomial System Synthesis, by Sivaram Gopalakrishnan, and Priyank Kalla, in International Workshop on Logic and Synthesis, (IWLS) 2008.

Finding Linear Building-Blocks for RTL Synthesis of Polynomial Datapaths with Fixed-Size Bit-Vectors, by Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon Meredith and Florian Enescu, in  Proc. International Conference on Computer-Aided Design (ICCAD) 2007.

Optimization of Arithmetic Datapaths with Finite Word-Length Operands, by Sivaram Gopalakrishnan, Priyank Kalla and Florian Enescu, in Asia/South-Pacific Design Automation Conference, (ASP-DAC) 2007.

Optimizing Fixed-Size Bit-Vector Arithmetic using Finite Ring Algebra, by Sivaram Gopalakrishnan, Priyank Kalla and Florian Enescu, in International Workshop on Logic and Synthesis, (IWLS) 2006.

Exploiting Vanishing Polynomials for Equivalence Verification of Fixed-Size Arithmetic Datapaths, by Namrata Shekhar, Priyank Kalla, Florian Enescu and Sivaram Gopalakrishnan, in International Conference on Computer Design (ICCD) 2005.  

Integrating CNF and BDD Based SAT solvers, by Sivaram Gopalakrishnan, Vijay Durairaj and Priyank Kalla, in High-Level Design Validation and Test Workshop, (HLDVT) 2003.

BDD-Based Boolean Satisfiability using Search Space Pruning, by Sivaram Gopalakrishnan, Vijay Durairaj and Priyank Kalla, in International Workshop on Logic and Synthesis, (IWLS) 2003.