1. Lecture Notes in Computer Science;R Freivalds,2013
2. Balodis, K., Berina, A., Cīpola, K., Dimitrijevs, M., Iraids, J., et al.: On the State Complexity of Ultrametric Finite Automata. In: SOFSEM 2013, Proceedings, vol. 2, pp. 1–9, Špindlerův Mlỳn (2013)
3. Lecture Notes in Computer Science;K Balodis,2014
4. Dimitrijevs, M., Ščeguļnaja, I., Freivalds, R.: Complexity Advantages of Ultrametric Machines. In: SOFSEM 2014, Proceedings, vol. 2, pp. 21–29, Nový Smokovec (2014)
5. Krišlauks, R., Rukšāne, I., Balodis, K., Kucevalovs, I., Freivalds, R., Nāgele, I.: Ultrametric Turing Machines with Limited Reversal Complexity. In: SOFSEM 2013. Proceedings, vol. 2, pp. 87–94, Špindlerův Mlỳn (2013)