1. J. Chen and I. Kanj, “Improved exact algorithms for Max-Sat,” Lect. Notes Comput. Sci., 2286, 98–119 (2002).
2. T. Hertli, “3-SAT faster and simpler - Unique-SAT bounds for PPSZ hold in general,” arXiv:1103.2165.
3. R. A. Moser and D. Scheder, “A full derandomization of Schöning’s k-SAT algorithm,” in: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (2011), pp. 245–252.
4. S. S. Fedin and A. S. Kulikov, “Automated proofs of upper bounds on the running time of splitting algorithms,” Lect. Notes Comput. Sci., 3162, 248–259 (2004).
5. A. Kulikov, “Automated generation of simplification rules for SAT and MAXSAT,” Lect. Notes Comput. Sci., 3569, 43–59 (2005).