 | 2009 |
|---|
| 8 |       | Sivaram Gopalakrishnan,
Priyank Kalla:
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis.
DATE 2009: 1452-1457 |
| 7 | | Sivaram Gopalakrishnan,
Priyank Kalla:
2009 ACM TODAES best paper award: Optimization of polynomial datapaths using finite ring algebra.
ACM Trans. Design Autom. Electr. Syst. 14(4): (2009) |
| 2008 |
|---|
| 6 | | Neal Tew,
Priyank Kalla,
Namrata Shekhar,
Sivaram Gopalakrishnan:
Verification of arithmetic datapaths using polynomial function models and congruence solving.
ICCAD 2008: 122-128 |
| 2007 |
|---|
| 5 | | Sivaram Gopalakrishnan,
Priyank Kalla,
Florian Enescu:
Optimization of Arithmetic Datapaths with Finite Word-Length Operands.
ASP-DAC 2007: 511-516 |
| 4 | | Sivaram Gopalakrishnan,
Priyank Kalla,
M. Brandon Meredith,
Florian Enescu:
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors.
ICCAD 2007: 143-148 |
| 3 | | Sivaram Gopalakrishnan,
Priyank Kalla:
Optimization of polynomial datapaths using finite ring algebra.
ACM Trans. Design Autom. Electr. Syst. 12(4): (2007) |
| 2005 |
|---|
| 2 |  | Namrata Shekhar,
Priyank Kalla,
Florian Enescu,
Sivaram Gopalakrishnan:
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra.
ICCAD 2005: 291-296 |
| 1 | | Namrata Shekhar,
Priyank Kalla,
Sivaram Gopalakrishnan,
Florian Enescu:
Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths.
ICCD 2005: 215-220 |
