1. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.), Proc. of SAT Competition 2020 – Solver and Benchmark Descriptions, volume B-2020-1 of Department of Computer Science Report Series B, pages 51–53. University of Helsinki (2020)
2. Bright, C., Cheung, K.K.H., Stevens, B., Kotsireas, I., Ganesh, V.: Unsatisfiability proofs for weight 16 codewords in Lam’s problem. In: Bessiere, C. (ed.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, pp. 1460–1466. International Joint Conferences on Artificial Intelligence Organization, (7 2020). Main track
3. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201–215 (1960)
4. Eastman, W.: On the construction of comma-free codes. IEEE Trans. Info. Theory 11(2), 263–267 (1965)
5. Golomb, S.W., Gordon, B., Welch, L.R.: Comma-free codes. Can. J. Math. 10, 202–209 (1958)