( en | de | ru )

 

Disambiguation of "Chakraborty, Supratik"

Author of the publication

copydeleteadd this publication to your clipboard
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.

, , , , , , , and . AAAI Workshop: Beyond NP, volume WS-16-05 of AAAI Technical Report, AAAI Press, (2016)978-1-57735-759-9.

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.

Supratik Mukhopadhyay

Supratik Mukhopadhyay

Sourav Chakraborty

Dipanjan Chakraborty

Anirban Chakraborty

 

Other publications of authors with the same name

Timing analysis of asynchronous systems using time separation of events., , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 18 (8): 1061-1076 (1999)Constrained Sampling and Counting: Universal Hashing Meets SAT Solving., , , , , , , and . CoRR, (2015)Approximate Probabilistic Inference via Word-Level Counting., , , and . CoRR, (2015)Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines., , and . IEEE Trans. Computers, 45 (7): 769-781 (1996)Symbolic trajectory evaluation for word-level verification: theory and implementation., , , , , , and . Formal Methods Syst. Des., 50 (2-3): 317-352 (2017)Refining abstract interpretations., , , and . Inf. Process. Lett., 110 (16): 666-671 (2010)Projected Model Counting: Beyond Independent Support., , and . CoRR, (2021)Practical timing analysis of asynchronous circuits using time separation of events., , and . CICC, page 455-458. IEEE, (1998)Efficient Guided Symbolic Reachability Using Reachability Expressions., , and . TACAS, volume 3920 of Lecture Notes in Computer Science, page 120-134. Springer, (2006)Complexity Of Minimum-Delay Gate Resizing., and . VLSI Design, page 425-430. IEEE Computer Society, (2001)