Florian Enescu

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 13

Top Topics

Multibaseline Stereo

Formal Verification

Computer Algebra

Top Venues

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.

Publications

Bhavani Sampathkumar, Bailey Martin, Ritaja Das, Priyank Kalla, Florian Enescu
Logic Synthesis from Polynomials with Coefficients in the Field of Rationals. ISMVL (2023)
Vikas Rao, Haden Ondricek, Priyank Kalla, Florian Enescu
Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques. ICCD (2021)
Vikas Rao, Irina Ilioaea, Haden Ondricek, Priyank Kalla, Florian Enescu
Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits. ISQED (2021)
Vikas Rao, Haden Ondricek, Priyank Kalla, Florian Enescu
Algebraic Techniques for Rectification of Finite Field Circuits. VLSI-SoC (2021)
Utkarsh Gupta, Priyank Kalla, Irina Ilioaea, Florian Enescu
Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases. ETS (2019)
Florian Enescu, Sandra Spiroff
Computing the invariants of intersection algebras of principal monomial ideals. Int. J. Algebra Comput. 29 (2) (2019)
Utkarsh Gupta, Irina Ilioaea, Vikas Rao, Arpitha Srinath, Priyank Kalla, Florian Enescu
On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields. VLSI-SoC (2018)
Utkarsh Gupta, Irina Ilioaea, Vikas Rao, Arpitha Srinath, Priyank Kalla, Florian Enescu
Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields. VLSI-SoC (Selected Papers) (2018)
Vikas Rao, Utkarsh Gupta, Irina Ilioaea, Arpitha Srinath, Priyank Kalla, Florian Enescu
Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques. FMCAD (2018)
Tim Pruss, Priyank Kalla, Florian Enescu
Efficient Symbolic Computation for Word-Level Abstraction From Combinational Circuits for Verification Over Finite Fields. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35 (7) (2016)
Xiaojun Sun, Priyank Kalla, Florian Enescu
Word-level traversal of finite state machines using algebraic geometry. HLDVT (2016)
Xiaojun Sun, Irina Ilioaea, Priyank Kalla, Florian Enescu
Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm. CP (2016)
Xiaojun Sun, Priyank Kalla, Tim Pruss, Florian Enescu
Formal verification of sequential Galois field arithmetic circuits using algebraic geometry. DATE (2015)
Tim Pruss, Priyank Kalla, Florian Enescu
Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases. DAC (2014)
Jinpeng Lv, Priyank Kalla, Florian Enescu
Efficient Gröbner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32 (9) (2013)
Jinpeng Lv, Priyank Kalla, Florian Enescu
Efficient Gröbner basis reductions for formal verification of galois field multipliers. DATE (2012)
Jinpeng Lv, Priyank Kalla, Florian Enescu
) using computer algebra techniques. HLDVT (2011)
Namrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu
Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra. IEEE Trans. Very Large Scale Integr. Syst. 16 (4) (2008)
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)
Sivaram Gopalakrishnan, Priyank Kalla, Florian Enescu
Optimization of Arithmetic Datapaths with Finite Word-Length Operands. ASP-DAC (2007)
Namrata Shekhar, Sudhakar Kalla, Florian Enescu
Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26 (7) (2007)
Namrata Shekhar, Priyank Kalla, Florian Enescu
Equivalence verification of arithmetic datapaths with multiple word-length operands. DATE (2006)
Namrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu
Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. FMCAD (2006)
Namrata Shekhar, Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. ICCAD (2005)
Namrata Shekhar, Priyank Kalla, Sivaram Gopalakrishnan, Florian Enescu
Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. ICCD (2005)