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

Florian Enescu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
8EENamrata 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
7EESivaram Gopalakrishnan, Priyank Kalla, Florian Enescu: Optimization of Arithmetic Datapaths with Finite Word-Length Operands. ASP-DAC 2007: 511-516
6EESivaram 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
5EENamrata 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
4EENamrata Shekhar, Priyank Kalla, Florian Enescu: Equivalence verification of arithmetic datapaths with multiple word-length operands. DATE 2006: 824-829
3EENamrata 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
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
1EENamrata 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]
3Sudhakar Kalla [5]
4M. Brandon Meredith [3] [6] [8]
5Namrata Shekhar [1] [2] [3] [4] [5] [8]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)