E-LIB Suche - Ergebnisse für: Wehar, Michael - Sprache EN

Search for persons X

Sorted by: Relevance

Sorted by: Year

1

Effective Guessing Has Unlikely Consequences:

Salamon, András Z. ; Wehar, Michael
Theory of Computing Systems. 67 (2023) 3 - p. 548-568 , 2023

Link: https://doi.org/10.1007/..

2

Analyzing Group and Individual Contributions within Group P..:

, In: Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 2,

Quiroz, Maria ; Wehar, Michael - p. 611 ff. , 2022

Link: https://dl.acm.org/doi/1..

3

Two-dimensional pattern matching against local and regular-..:

Mráz, František ; Průša, Daniel ; Wehar, Michael
Theoretical Computer Science. 870 (2021) - p. 137-152 , 2021

Link: https://doi.org/10.1016/..

4

On the Fine Grained Complexity of Finite Automata Non-empti..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

de Oliveira Oliveira, Mateus ; Wehar, Michael - p. 69-82 , 2020

Link: https://doi.org/10.1007/..

5

Complexity of Searching for 2 by 2 Submatrices in Boolean M..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Průša, Daniel ; Wehar, Michael - p. 266-279 , 2020

Link: https://doi.org/10.1007/..

6

Two-Dimensional Pattern Matching Against Basic Picture Lang..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,

Mráz, František ; Průša, Daniel ; Wehar, Michael - p. 209-221 , 2019

Link: https://doi.org/10.1007/..

7

Intersection Non-emptiness and Hardness Within Polynomial T..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

de Oliveira Oliveira, Mateus ; Wehar, Michael - p. 282-290 , 2018

Link: https://doi.org/10.1007/..

8

Effective guessing has unlikely consequences:

Salamon, András Z ; Wehar, Michael
Theory of Computing Systems. , 2023

Link: http://hdl.handle.net/10..

9

Superlinear Lower Bounds Based on ETH:

Wehar, Michael
doi:10.4230/LIPIcs.STACS.2022.55. , 2022

Link: https://doi.org/10.4230/..

10

Superlinear lower bounds based on ETH:

Salamon, András Z ; Wehar, Michael
Salamon , A Z & Wehar , M 2022 , Superlinear lower bounds based on ETH . in P Berenbrink & B Monmege (eds) , Symposium on Theoretical Aspects of Computer Science (STACS 2022) . , 14 , Leibniz International Proceedings in Informatics , Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH , The 39th International Symposium on Theoretical Aspects of Computer Science , 15/03/22 . https://doi.org/10.4230/LIPIcs.STACS.2022.55. , 2022

Link: https://risweb.st-andrew..

11

Finite Automata Intersection Non-Emptiness: Parameterized C..:

Fernau, Henning ; Hoffmann, Stefan ; Wehar, Michael
http://arxiv.org/abs/2108.05244. , 2021

Link: http://arxiv.org/abs/210..

12

Effective Guessing Has Unlikely Consequences:

Salamon, András Z ; Wehar, Michael
http://arxiv.org/abs/2111.02138. , 2021

Link: http://arxiv.org/abs/211..

13

Superlinear Lower Bounds Based on ETH:

Salamon, András Z ; Wehar, Michael
http://arxiv.org/abs/2008.06805. , 2020

Link: http://arxiv.org/abs/200..

14

Shortest paths in one-counter systems:

Chistikov, Dmitry ; Czerwiński, Wojciech ; Hofman, Piotr..
http://arxiv.org/abs/1510.05460. , 2015

Link: http://arxiv.org/abs/151..

15

Shortest paths in one-counter systems:

Dmitry Chistikov ; Wojciech Czerwiński ; Piotr Hofman..
https://lmcs.episciences.org/4037/pdf. , 2019

Link: https://doi.org/10.23638..

1-15