Moses Ganardi

Konstantinos Mamouras

Tatiana Starikovskaya

CoRR, 2024

Directed Regular and Context-Free Languages.

[BibT_eX]

[DOI]

Irmak Saglam

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Context-Bounded Verification of Context-Free Specifications.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., January, 2023

Existential Definability over the Subword Ordering.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

Knapsack and the power word problem in solvable Baumslag-Solitar groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2023

Revisiting Membership Problems in Subclasses of Rational Relations.

[BibT_eX]

[DOI]

Pascal Bergsträßer

LICS, 2023

Checking Refinement of Asynchronous Programs Against Context-Free Specifications.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Context-Bounded Analysis of Concurrent Programs (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Unboundedness Problems for Machines with Reversal-Bounded Counters.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

Pattern Matching on Grammar-Compressed Strings in Linear Time.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Complexity of Bidirected Reachability in Valence Systems.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Reachability in Bidirected Pushdown VASS.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Low-Latency Sliding Window Algorithms for Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Derandomization for Sliding Window Algorithms with Strict Correctness<sup>∗</sup>.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Balancing Straight-line Programs.

[BibT_eX]

[DOI]

Artur Jez

J. ACM, 2021

A Characterization of Wreath Products Where Knapsack Is Decidable.

[BibT_eX]

[DOI]

Pascal Bergsträßer

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Compression by Contracting Straight-Line Programs.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

The Complexity of Knapsack Problems in Wreath Products.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Automatic Equivalence Structures of Polynomial Growth.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Language recognition in the sliding window model.

[BibT_eX]

[DOI]

PhD thesis, 2019

A Universal Tree Balancing Theorem.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Universal Tree Source Coding Using Grammar-Based Compression.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

IEEE Trans. Inf. Theory, 2019

Visibly Pushdown Languages over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Sliding Window Property Testing for Regular Languages.

[BibT_eX]

[DOI]

Tatiana Starikovskaya

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Derandomization for Sliding Window Algorithms with Strict Correctness.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Circuits and Expressions over Finite Semirings.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

The Complexity of Bisimulation and Simulation on Finite Systems.

[BibT_eX]

[DOI]

Stefan Göller

Log. Methods Comput. Sci., 2018

Tree Compression Using String Grammars.

[BibT_eX]

[DOI]

Algorithmica, 2018

Knapsack Problems for Wreath Products.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Automata Theory on Sliding Windows.

[BibT_eX]

[DOI]

Konstantinos Mamouras

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Sliding Windows over Context-Free Languages.

[BibT_eX]

[DOI]

Artur Jez

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Sliding Window Algorithms for Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2018

Randomized Sliding Window Algorithms for Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Constructing small tree grammars and small circuits for formulas.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Querying languages over sliding windows.

[BibT_eX]

[DOI]

CoRR, 2017

Circuit Evaluation for Finite Semirings.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

Querying Regular Languages over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

On the Parallel Complexity of Bisimulation on Finite Systems.

[BibT_eX]

[DOI]

Stefan Göller

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Parity Games of Bounded Tree- and Clique-Width.

[BibT_eX]

[DOI]