Michael Wehar

According to our database, Michael Wehar authored at least 13 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Effective Guessing Has Unlikely Consequences.

András Z. Salamon, Michael Wehar

Theory Comput. Syst., June, 2023

2022

Superlinear Lower Bounds Based on ETH.

András Z. Salamon, Michael Wehar

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application.

Maria Quiroz, Michael Wehar

Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

2021

Two-dimensional pattern matching against local and regular-like picture languages.

Frantisek Mráz, Daniel Prusa, Michael Wehar

Theor. Comput. Sci., 2021

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.

Henning Fernau, Stefan Hoffmann, Michael Wehar

CoRR, 2021

2020

Stronger Lower Bounds for Polynomial Time Problems.

András Z. Salamon, Michael Wehar

CoRR, 2020

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices.

Daniel Prusa, Michael Wehar

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.

Mateus de Oliveira Oliveira, Michael Wehar

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Shortest paths in one-counter systems.

Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar

Log. Methods Comput. Sci., 2019

Two-Dimensional Pattern Matching Against Basic Picture Languages.

Frantisek Mráz, Daniel Prusa, Michael Wehar

Proceedings of the Implementation and Application of Automata, 2019

2018

Intersection Non-emptiness and Hardness Within Polynomial Time.

Mateus de Oliveira Oliveira, Michael Wehar

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2015

On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.

Joseph Swernofsky, Michael Wehar

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Hardness Results for Intersection Non-Emptiness.

Michael Wehar

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014