Search the dblp DataBase

Publications of Author

1. Maciej J. Ciesielski, Priyank Kalla, Zhihong Zeng, Bruno Rouzeyre
   Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification. [Citation Graph (0, 0)][DBLP]
   DATE, 2002, pp:285-291 [Conf]
   
2. Priyank Kalla, Maciej J. Ciesielski
   Performance Driven Resynthesis by Exploiting Retiming-Induced State Register Equivalence. [Citation Graph (0, 0)][DBLP]
   DATE, 1999, pp:638-642 [Conf]
   
3. Priyank Kalla, Zhihong Zeng, Maciej J. Ciesielski, ChiLai Huang
   A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm. [Citation Graph (0, 0)][DBLP]
   DATE, 2000, pp:232-236 [Conf]
   
4. Namrata Shekhar, Priyank Kalla, Florian Enescu
   Equivalence verification of arithmetic datapaths with multiple word-length operands. [Citation Graph (0, 0)][DBLP]
   DATE, 2006, pp:824-829 [Conf]
   
5. Zhihong Zeng, Priyank Kalla, Maciej J. Ciesielski
   LPSAT: a unified approach to RTL satisfiability. [Citation Graph (0, 0)][DBLP]
   DATE, 2001, pp:398-402 [Conf]
   
6. Namrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu
   Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. [Citation Graph (0, 0)][DBLP]
   FMCAD, 2006, pp:179-186 [Conf]
   
7. Vijay Durairaj, Priyank Kalla
   Guiding CNF-SAT search via efficient constraint partitioning. [Citation Graph (0, 0)][DBLP]
   ICCAD, 2004, pp:498-501 [Conf]
   
8. Namrata Shekhar, Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan
   Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. [Citation Graph (0, 0)][DBLP]
   ICCAD, 2005, pp:291-296 [Conf]
   
9. Namrata Shekhar, Priyank Kalla, Sivaram Gopalakrishnan, Florian Enescu
   Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. [Citation Graph (0, 0)][DBLP]
   ICCD, 2005, pp:215-220 [Conf]
   
10. Priyank Kalla, Maciej J. Ciesielski
    A comprehensive approach to the partial scan problem using implicit state enumeration. [Citation Graph (0, 0)][DBLP]
    ITC, 1998, pp:651-657 [Conf]
    
11. Vijay Durairaj, Priyank Kalla
    Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:415-422 [Conf]
    
12. Priyank Kalla, Maciej J. Ciesielski
    Testability of Sequential Circuits with Multi-Cycle False Path. [Citation Graph (0, 0)][DBLP]
    VTS, 1997, pp:322-328 [Conf]
    
13. Maciej J. Ciesielski, Priyank Kalla, Serkan Askar
    Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:9, pp:1188-1201 [Journal]
    
14. Priyank Kalla, Maciej J. Ciesielski
    A comprehensive approach to the partial scan problem using implicitstate enumeration. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:7, pp:810-826 [Journal]
    
15. Navin Vemuri, Priyank Kalla, Russell Tessier
    BDD-based logic synthesis for LUT-based FPGAs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2002, v:7, n:4, pp:501-525 [Journal]
    
16. Christopher Condrat, Priyank Kalla
    A Gröbner Basis Approach to CNF-Formulae Preprocessing. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:618-631 [Conf]
    
17. Sivaram Gopalakrishnan, Priyank Kalla
    Optimization of polynomial datapaths using finite ring algebra. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2007, v:12, n:4, pp:- [Journal]
    
18. 
    Optimization of Arithmetic Datapaths with Finite Word-Length Operands. [Citation Graph (, )][DBLP]
    
    
19. 
    Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis. [Citation Graph (, )][DBLP]
    
    
20. 
    Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors. [Citation Graph (, )][DBLP]
    
    
21. 
    Verification of arithmetic datapaths using polynomial function models and congruence solving. [Citation Graph (, )][DBLP]