| Quantum speedup for track reconstruction in particle accelerators D Magano, A Kumar, M Kālis, A Locāns, A Glos, S Pratapsi, G Quinta, ... Physical Review D 105 (7), 076012, 2022 | 24 | 2022 |
| On the state complexity of ultrametric finite automata K Balodis, A Berina, K Cıpola, M Dimitrijevs, J Iraids, K Jerinš, V Kacs, ... Proceedings of SOFSEM 2, 1-9, 2013 | 9 | 2013 |
| Uncountable classical and quantum complexity classes M Dimitrijevs, A Yakaryılmaz arXiv preprint arXiv:1608.00417, 2016 | 7 | 2016 |
| Uncountable realtime probabilistic classes M Dimitrijevs, A Yakaryılmaz International Journal of Foundations of Computer Science 30 (08), 1317-1333, 2019 | 6 | 2019 |
| Probabilistic verification of all languages M Dimitrijevs, A Yakaryılmaz arXiv preprint arXiv:1807.04735, 2018 | 5 | 2018 |
| Postselecting probabilistic finite state recognizers and verifiers M Dimitrijevs, A Yakaryılmaz arXiv preprint arXiv:1807.05169, 2018 | 4 | 2018 |
| Capabilities of ultrametric automata with one, two, and three states M Dimitrijevs International Conference on Current Trends in Theory and Practice of …, 2016 | 4 | 2016 |
| Investigating quantum speedup for track reconstruction: classical and quantum computational complexity analysis D Magano, A Kumar, M Kalis, A Locans, A Glos, S Pratapsi, G Quinta, ... arXiv preprint arXiv:2104.11583, 2021 | 2 | 2021 |
| State Complexity Advantages of Ultrametric Automata. M Dimitrijevs SOFSEM (Student Research Forum Papers/Posters), 13-24, 2016 | 2 | 2016 |
| The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints A Naumovs, M Dimitrijevs, A Yakaryılmaz Discrete Mathematics & Theoretical Computer Science 22 (Automata, Logic and …, 2020 | 1 | 2020 |
| Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata. M Dimitrijevs, I Scegulnaja SOFSEM (Student Research Forum Papers/Posters), 13-19, 2015 | 1 | 2015 |
| Probabilistic computation and verification beyond Turing machines M Dimitrijevs Latvijas Universitāte, 2019 | | 2019 |
| Uncountable classical and quantum complexity classes. H Bordihn, B Nagy, G Vaszil, M Dimitrijevs, A Yakaryılmaz RAIRO--Theoretical Informatics & Applications 52, 2018 | | 2018 |
| Ultrametric Finite Automata and Their Capabilities M Dimitrijevs, K Cipola Baltic Journal of Modern Computing 4 (4), 896, 2016 | | 2016 |
| Ultrametrisku galīgu automātu iespējas M Dimitrijevs Latvijas Universitāte, 2015 | | 2015 |
| Ultrametriski algoritmi dažādiem automātu tipiem M Dimitrijevs Latvijas Universitāte, 2013 | | 2013 |
| Daudzlietotāju tīmekļa RPG spēle M Dimitrijevs Latvijas Universitāte, 2011 | | 2011 |
| RECOGNITION OF UNCOUNTABLY MANY LANGUAGES WITH ONE COUNTER Maksims Dimitrijevs (A, B) Abuzer Yakaryılmaz (A, B) M Dimitrijevs Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA …, 0 | | |
