Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata. - Maksims Dimitrijevs; Irina Scegulnaja (SOFSEM (Student Research Forum Papers / Posters), 2015)

Two-way frequency finite automata. - Kaspars Balodis; Maksims Dimitrijevs; Abuzer Yakaryilmaz (NCMA, 2016)

Capabilities of Ultrametric Automata with One, Two, and Three States. - Maksims Dimitrijevs (SOFSEM, 2016)

State Complexity Advantages of Ultrametric Automata. - Maksims Dimitrijevs (SOFSEM (Student Research Forum Papers / Posters), 2016)

Ultrametric Finite Automata and Their Capabilities. - Maksims Dimitrijevs; Kristine Cipola (Balt. J. Mod. Comput., 2016)

Postselecting probabilistic finite state recognizers and verifiers. - Maksims Dimitrijevs; Abuzer Yakaryilmaz (NCMA, 2018)

Probabilistic verification of all languages. - Maksims Dimitrijevs; Abuzer Yakaryilmaz (CoRR, 2018)

Uncountable classical and quantum complexity classes. - Maksims Dimitrijevs; Abuzer Yakaryilmaz (RAIRO Theor. Informatics Appl., 2018)

Uncountable Realtime Probabilistic Classes. - Maksims Dimitrijevs; Abuzer Yakaryilmaz (Int. J. Found. Comput. Sci., 2019)

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. - Aleksejs Naumovs; Maksims Dimitrijevs; Abuzer Yakaryilmaz (Discret. Math. Theor. Comput. Sci., 2020)