Author of the publication

A Scalable and Nearly Uniform Generator of SAT Witnesses.

, , and . CAV, volume 8044 of Lecture Notes in Computer Science, page 608-623. Springer, (2013)

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

Combining the k-CNF and XOR Phase-Transitions., , and . CoRR, (2017)View Synthesis from Schema Mappings, , , and . CoRR, (2010)On Epistemic Logic and Logical Omniscience.. TARK, page 293-305. Morgan Kaufmann, (1986)What Can Machines Know? On the Epistemic Properties of Machines., , and . AAAI, page 428-435. Morgan Kaufmann, (1986)Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach.. ARTS, volume 1601 of Lecture Notes in Computer Science, page 265-276. Springer, (1999)A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking., , and . CONCUR, volume 1119 of Lecture Notes in Computer Science, page 514-529. Springer, (1996)Synthesis from Component Libraries., and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 395-409. Springer, (2009)On the Complexity of Parity Word Automata., , and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 276-286. Springer, (2001)Comparator Automata in Quantitative Verification., , and . FoSSaCS, volume 10803 of Lecture Notes in Computer Science, page 420-437. Springer, (2018)Reasoning about Infinite Computation Paths (Extended Abstract), , and . FOCS, page 185-194. IEEE Computer Society, (1983)