1. Andrews, S.: In-close, a fast algorithm for computing formal concepts. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) Proceedings of ICCS 2009. CEUR Workshop Proceedings, vol. 483. CEUR-WS.org (2009)
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);S Andrews,2011
3. Andrews, S.: A ‘best-of-breed’ approach for designing a fast algorithm for computing fixpoints of Galois connections. Inf. Sci. 295, 633–649 (2015). https://doi.org/10.1016/j.ins.2014.10.011
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);S Andrews,2017
5. Andrews, S.: A new method for inheriting canonicity test failures in close-by-one type algorithms. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, 12–14 June 2018. CEUR Workshop Proceedings, vol. 2123, pp. 255–266. CEUR-WS.org (2018)