| On the right-seed array of a string M Christou, M Crochemore, O Guth, CS Iliopoulos, SP Pissis International Computing and Combinatorics Conference, 492-502, 2011 | 12 | 2011 |
| Co-teaching computer science across borders: Human-centric learning at scale C Piech, L Yan, L Einstein, A Saavedra, B Bozkurt, E Sestakova, O Guth, ... Proceedings of the Seventh ACM Conference on Learning@ Scale, 103-113, 2020 | 11 | 2020 |
| Searching all approximate covers and their distance using finite automata. O Guth, B Melichar, M Balík ITAT, 2008 | 10 | 2008 |
| On left and right seeds of a string M Christou, M Crochemore, O Guth, CS Iliopoulos, SP Pissis Journal of Discrete Algorithms 17, 31-44, 2012 | 8 | 2012 |
| Searching regularities in strings using finite automata O Guth PhD thesis, Czech Technical University in Prague, 2014. URL: https://fit …, 2014 | 7 | 2014 |
| Finite Automata Approach to Computing All Seeds of Strings with the Smallest Hamming Distance. O Guth, B Melichar IAENG International Journal of Computer Science 36 (2), 2009 | 7 | 2009 |
| On approximate enhanced covers under Hamming distance O Guth Discrete Applied Mathematics 274, 67-80, 2020 | 6 | 2020 |
| Using finite automata approach for searching approximate seeds of strings O Guth, B Melichar Intelligent Automation and Computer Engineering, 347-360, 2010 | 6 | 2010 |
| Computing all approximate enhanced covers with the hamming distance O Guth Proceedings of the Prague Stringology Conference 2016, 2016 | 3 | 2016 |
| Inexact tree pattern matching with 1-degree edit distance using finite automata E Šestáková, O Guth, J Janoušek Discrete Applied Mathematics 330, 78-97, 2023 | 2 | 2023 |
| Automata approach to inexact tree pattern matching using 1-degree edit distance E Šestáková, O Guth, J Janoušek Prague Stringology Conference 2021, 1, 2021 | 2 | 2021 |
| Searching all seeds of strings with hamming distance using finite automata O Guth, B Melichar Proceedings of the International MultiConference of Engineers and Computer …, 2009 | 1 | 2009 |
| On Expressive Power of Regular Expressions with Subroutine Calls and Lookaround Assertions O Guth Prague Stringology Conference 2023, 68, 2023 | | 2023 |
| Faculty of Information Technology Department of Theoretical Computer Science O Guth Faculty of Information Technology Department of Theoretical Computer Science …, 2014 | | 2014 |
Eliška ŠestákováCzech Technical University in PragueVerified email at fit.cvut.cz
