default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Enescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c20]Bhavani Sampathkumar, Bailey Martin, Ritaja Das, Priyank Kalla, Florian Enescu
:
Logic Synthesis from Polynomials with Coefficients in the Field of Rationals. ISMVL 2023: 82-87- 2021
- [c19]Vikas Rao, Haden Ondricek, Priyank Kalla, Florian Enescu:
Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques. ICCD 2021: 186-195 - [c18]Vikas Rao, Irina Ilioaea, Haden Ondricek, Priyank Kalla, Florian Enescu:
Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits. ISQED 2021: 41-47 - [c17]Vikas Rao, Haden Ondricek, Priyank Kalla, Florian Enescu:
Algebraic Techniques for Rectification of Finite Field Circuits. VLSI-SoC 2021: 1-6
2010 – 2019
- 2019
- [j5]Florian Enescu, Sandra Spiroff:
Computing the invariants of intersection algebras of principal monomial ideals. Int. J. Algebra Comput. 29(2): 309-332 (2019) - [c16]Utkarsh Gupta, Priyank Kalla, Irina Ilioaea, Florian Enescu:
Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases. ETS 2019: 1-6 - 2018
- [c15]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: 1-9 - [c14]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: 49-54 - [c13]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: 79-106 - 2016
- [j4]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): 1206-1218 (2016) - [c12]Xiaojun Sun, Irina Ilioaea, Priyank Kalla, Florian Enescu:
Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm. CP 2016: 859-875 - [c11]Xiaojun Sun, Priyank Kalla, Florian Enescu:
Word-level traversal of finite state machines using algebraic geometry. HLDVT 2016: 142-149 - 2015
- [c10]Xiaojun Sun, Priyank Kalla, Tim Pruss, Florian Enescu:
Formal verification of sequential Galois field arithmetic circuits using algebraic geometry. DATE 2015: 1623-1628 - 2014
- [c9]Tim Pruss, Priyank Kalla, Florian Enescu:
Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases. DAC 2014: 152:1-152:6 - 2013
- [j3]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): 1409-1420 (2013) - 2012
- [c8]Jinpeng Lv, Priyank Kalla, Florian Enescu:
Efficient Gröbner basis reductions for formal verification of galois field multipliers. DATE 2012: 899-904 - 2011
- [c7]Jinpeng Lv, Priyank Kalla, Florian Enescu:
Verification of composite Galois field multipliers over GF ((2m)n) using computer algebra techniques. HLDVT 2011: 136-143
2000 – 2009
- 2008
- [j2]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): 376-387 (2008) - 2007
- [j1]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): 1320-1330 (2007) - [c6]Sivaram Gopalakrishnan, Priyank Kalla, Florian Enescu:
Optimization of Arithmetic Datapaths with Finite Word-Length Operands. ASP-DAC 2007: 511-516 - [c5]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: 143-148 - 2006
- [c4]Namrata Shekhar, Priyank Kalla, Florian Enescu:
Equivalence verification of arithmetic datapaths with multiple word-length operands. DATE 2006: 824-829 - [c3]Namrata 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
- [c2]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 - [c1]Namrata 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
