dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Florian Enescu Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJinpeng Lv, Priyank Kalla, Florian Enescu: Efficient Gröbner basis reductions for formal verification of galois field multipliers. DATE 2012: 899-904
2011
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJinpeng Lv, Priyank Kalla, Florian Enescu: Verification of composite Galois field multipliers over GF ((2m)n) using computer algebra techniques. HLDVT 2011: 136-143
2008
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu: Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra. IEEE Trans. VLSI Syst. 16(4): 376-387 (2008)
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSivaram Gopalakrishnan, Priyank Kalla, Florian Enescu: Optimization of Arithmetic Datapaths with Finite Word-Length Operands. ASP-DAC 2007: 511-516
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSivaram 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata Shekhar, Sudhakar Kalla, Florian Enescu: Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing. IEEE Trans. on CAD of Integrated Circuits and Systems 26(7): 1320-1330 (2007)
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata Shekhar, Priyank Kalla, Florian Enescu: Equivalence verification of arithmetic datapaths with multiple word-length operands. DATE 2006: 824-829
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu: Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. FMCAD 2006: 179-186
2005
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNamrata Shekhar, Priyank Kalla, Sivaram Gopalakrishnan, Florian Enescu: Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. ICCD 2005: 215-220

Coauthor Index

1Sivaram Gopalakrishnan [1] [2] [6] [7]
2Priyank Kalla [1] [2] [3] [4] [6] [7] [8] [9] [10]
3Sudhakar Kalla [5]
4Jinpeng Lv [9] [10]
5M. Brandon Meredith [3] [6] [8]
6Namrata Shekhar [1] [2] [3] [4] [5] [8]

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page