Michael Wehar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Superlinear lower bounds based on ETH	2024-04-23	Paper
Effective guessing has unlikely consequences Theory of Computing Systems	2023-07-26	Paper
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection Developments in Language Theory	2022-10-13	Paper
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices Developments in Language Theory	2022-10-13	Paper
Two-dimensional pattern matching against local and regular-like picture languages Theoretical Computer Science	2021-06-03	Paper
Two-dimensional pattern matching against basic picture languages	2020-05-06	Paper
Shortest paths in one-counter systems Logical Methods in Computer Science	2019-03-18	Paper
Intersection non-emptiness and hardness within polynomial time	2018-11-22	Paper
Shortest paths in one-counter systems Lecture Notes in Computer Science	2016-06-10	Paper
On the complexity of intersecting regular, context-free, and tree languages Automata, Languages, and Programming	2015-11-04	Paper
Hardness results for intersection non-emptiness Automata, Languages, and Programming	2014-07-01	Paper

Research outcomes over time

This page was built for person: Michael Wehar