( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Engineering an Efficient Boolean Functional Synthesis Engine.

, , , и . ICCAD, стр. 1-9. IEEE, (2021)

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.

Matthias Meel

Aumaporn Meelursarn

Walter Meels

S Ulrich

S Hüttelmaier

 

Другие публикации лиц с тем же именем

MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules., и . CP, том 11008 из Lecture Notes in Computer Science, стр. 312-327. Springer, (2018)Designing New Phase Selection Heuristics., и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 72-88. Springer, (2020)Approximate Counting of Minimal Unsatisfiable Subsets., и . CAV (1), том 12224 из Lecture Notes in Computer Science, стр. 439-462. Springer, (2020)Knowledge Compilation meets Uniform Sampling., , , и . LPAR, том 57 из EPiC Series in Computing, стр. 620-636. EasyChair, (2018)Estimating the Size of Union of Sets in Streaming Models., , и . PODS, стр. 126-137. ACM, (2021)Engineering an Efficient Boolean Functional Synthesis Engine., , , и . ICCAD, стр. 1-9. IEEE, (2021)Counting Maximal Satisfiable Subsets., и . AAAI, стр. 3651-3660. AAAI Press, (2021)"How Biased are Your Features?": Computing Fairness Influence Functions with Global Sensitivity Analysis., , и . FAccT, стр. 138-148. ACM, (2023)Scalable Probabilistic Routes., , и . ENIGMA@KR, том 3495 из CEUR Workshop Proceedings, стр. 64-74. CEUR-WS.org, (2023)Scalable Quantitative Verification For Deep Neural Networks., , , и . ICSE, стр. 312-323. IEEE, (2021)