Michael Wehar

20 papers A 1B 1C 4Journal 10Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Accessibility of Computer Science for Non-English Speakers.
J. Comput. Sci. Coll.
Michael Wehar, Lizbeth Zarate-Hernandez
2025 — conf
Students Teaching Students Computer Art and Graphics.
Eurographics (Education Papers)
Michael Wehar
2025 J jnl
Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness.
CoRR
Michael Wehar
2023 J jnl
Effective Guessing Has Unlikely Consequences.
Theory Comput. Syst.
András Z. Salamon, Michael Wehar
2022 J jnl
Algorithmically Generated Artwork.
J. Comput. Sci. Coll.
John Mancini, Maya Newman-Toker, Michael Wehar, Alyssa Zhang
2022 — conf
Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application.
ITiCSE (2)
Maria Quiroz, Michael Wehar
2022 A conf
Superlinear Lower Bounds Based on ETH.
STACS
András Z. Salamon, Michael Wehar
2021 J jnl
Effective guessing has unlikely consequences.
CoRR
András Z. Salamon, Michael Wehar
2021 J jnl
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.
CoRR
Henning Fernau, Stefan Hoffmann, Michael Wehar
2021 J jnl
Two-dimensional pattern matching against local and regular-like picture languages.
Theor. Comput. Sci.
Frantisek Mráz, Daniel Prusa, Michael Wehar
2020 C conf
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices.
DLT
Daniel Prusa, Michael Wehar
2020 C conf
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.
DLT
Mateus de Oliveira Oliveira, Michael Wehar
2020 J jnl
Stronger Lower Bounds for Polynomial Time Problems.
CoRR
András Z. Salamon, Michael Wehar
2019 J jnl
Shortest paths in one-counter systems.
Log. Methods Comput. Sci.
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2019 C conf
Two-Dimensional Pattern Matching Against Basic Picture Languages.
CIAA
Frantisek Mráz, Daniel Prusa, Michael Wehar
2018 C conf
Intersection Non-emptiness and Hardness Within Polynomial Time.
DLT
Mateus de Oliveira Oliveira, Michael Wehar
2016 B conf
Shortest Paths in One-Counter Systems.
FoSSaCS
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2015 — conf
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.
ICALP (2)
Joseph Swernofsky, Michael Wehar
2015 J jnl
Shortest paths in one-counter systems.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2014 — conf
Hardness Results for Intersection Non-Emptiness.
ICALP (2)
Michael Wehar