Sivaram Gopalakrishnan

According to our database1, Sivaram Gopalakrishnan authored at least 9 papers between 2003 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
2009 ACM TODAES best paper award: Optimization of polynomial datapaths using finite ring algebra.
ACM Trans. Design Autom. Electr. Syst., 2009

Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis.
Proceedings of the Design, Automation and Test in Europe, 2009

2008
Verification of arithmetic datapaths using polynomial function models and congruence solving.
Proceedings of the 2008 International Conference on Computer-Aided Design, 2008

2007
Optimization of polynomial datapaths using finite ring algebra.
ACM Trans. Design Autom. Electr. Syst., 2007

Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors.
Proceedings of the 2007 International Conference on Computer-Aided Design, 2007

Optimization of Arithmetic Datapaths with Finite Word-Length Operands.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

2005
Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths.
Proceedings of the 23rd International Conference on Computer Design (ICCD 2005), 2005

Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra.
Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

2003
Integrating CNF and BDD based SAT solvers.
Proceedings of the Eighth IEEE International High-Level Design Validation and Test Workshop 2003, 2003


  Loading...