PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Enescu, Florian"

Author of the publication

copydeleteadd this publication to your clipboard
Formal verification of sequential Galois field arithmetic circuits using algebraic geometry.

, , , and . DATE, page 1623-1628. ACM, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Florian Weiss

PD Dr. -Ing. Florian Bauer University of Stuttgart

Florian Helber University of Stuttgart

Florian Seibold University of Stuttgart

Florian Reichelt University of Stuttgart

 

Other publications of authors with the same name

Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra., , , and . IEEE Trans. VLSI Syst., 16 (4): 376-387 (2008)Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths., , , and . ICCD, page 215-220. IEEE Computer Society, (2005)Optimization of Arithmetic Datapaths with Finite Word-Length Operands., , and . ASP-DAC, page 511-516. IEEE Computer Society, (2007)Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm., , , and . CP, volume 9892 of Lecture Notes in Computer Science, page 859-875. Springer, (2016)Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques., , , , , and . FMCAD, page 1-9. IEEE, (2018)On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields., , , , , and . VLSI-SoC, page 49-54. IEEE, (2018)Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing., , and . IEEE Trans. on CAD of Integrated Circuits and Systems, 26 (7): 1320-1330 (2007)Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra., , , and . ICCAD, page 291-296. IEEE Computer Society, (2005)Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands., , , and . FMCAD, page 179-186. IEEE Computer Society, (2006)Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields., , , , , and . VLSI-SoC (Selected Papers), volume 561 of IFIP Advances in Information and Communication Technology, page 79-106. Springer, (2018)