I. Kalimullin, A. Melnikov, A. Montalbán. <i>Punctual definability on structures</i> . Annals of Pure and Applied Logic, vol. 172, no. 8 (2021), Paper 102987, 18 pp. - R. Downey, M. Harrison-Trainor, I. Kalimullin, A. Melnikov, D. Turetsky. <i>Graphs

I. Kalimullin, A. Melnikov, A. Montalbán. Punctual definability on structures. Annals of Pure and Applied Logic, vol. 172, no. 8 (2021), Paper 102987, 18 pp. - R. Downey, M. Harrison-Trainor, I. Kalimullin, A. Melnikov, D. Turetsky. Graphs are not universal for online computability, Journal of Computer and System Sciences, vol. 112 (2020), pp. 1–12. - N. Greenberg, M. Harrison-Trainor, A. Melnikov, D. Turetsky. Non-density in punctual computability, Annals of Pure and Applied Logic, vol. 172, no. 9 (2021), Paper 102985, 17 pp.