Effective Guessing Has Unlikely Consequences.
Theory Comput. Syst., June, 2023
Superlinear Lower Bounds Based on ETH.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application.
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022
Two-dimensional pattern matching against local and regular-like picture languages.
Theor. Comput. Sci., 2021
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.
CoRR, 2021
Stronger Lower Bounds for Polynomial Time Problems.
CoRR, 2020
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020
Shortest paths in one-counter systems.
Log. Methods Comput. Sci., 2019
Two-Dimensional Pattern Matching Against Basic Picture Languages.
Proceedings of the Implementation and Application of Automata, 2019
Intersection Non-emptiness and Hardness Within Polynomial Time.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Hardness Results for Intersection Non-Emptiness.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014