TU Wien Informatics

20 Years
Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Leroy Nicholas Chew

Projektass.(FWF) / PhD

Role

Contact

  • Towards Uniform Certification in QBF / Chew, L., & Slivovsky, F. (2022). Towards Uniform Certification in QBF. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (pp. 1–23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.22
    Download: PDF (796 KB)
    Project: REVEAL-AI (2020–2024)
  • Hardness and Optimality in QBF Proof Systems Modulo NP / Chew, L. (2021). Hardness and Optimality in QBF Proof Systems Modulo NP. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 98–115). Springer. https://doi.org/10.1007/978-3-030-80223-3_8
  • Avoiding Monochromatic Rectangles Using Shift Patterns / Liu, Z., Chew, L., & Heule, M. (2021). Avoiding Monochromatic Rectangles Using Shift Patterns. In Proceedings of the Fourteenth International Symposium on Combinatorial Search (pp. 225–227). AAAI Press. http://hdl.handle.net/20.500.12708/55633
  • Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF / Beyersdorff, O., Blinkhorn, J., Chew, L., Schmidt, R., & Suda, M. (2018). Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning, 63(3), 597–623. https://doi.org/10.1007/s10817-018-9482-4
  • Lifting QBF Resolution Calculi to DQBF / Beyersdorff, O., Chew, L., Schmidt, R. A., & Suda, M. (2016). Lifting QBF Resolution Calculi to DQBF. In Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 490–499). Springer. https://doi.org/10.1007/978-3-319-40970-2_30