Author of the publication

On Symbolic Approaches for Computing the Matrix Permanent.

, , and . CP, volume 11802 of Lecture Notes in Computer Science, page 71-90. Springer, (2019)

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.

 

Other publications of authors with the same name

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