Florian Enescu

26 papers A* 1A 6B 3C 4Journal 5Unranked 7

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