Regular Resynchronizability of Origin Transducers Is Undecidable. - Denis Kuperberg; Jan Martens 001 (MFCS, 2020)

Bisimulation by Partitioning Is Ω((m+n)log n). - Jan Friso Groote; Jan Martens 001; Erik P. de Vink (CONCUR, 2021)

A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions. - Jan Martens 001; Jan Friso Groote; Lars B. van den Haak; Pieter Hijma; Anton Wijs (FACS, 2021)

Term Rewriting on GPUs. - Johri van Eerd; Jan Friso Groote; Pieter Hijma; Jan Martens 001; Anton Wijs (FSEN, 2021)

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. - Jan Martens 001; Jan Friso Groote (CONCUR, 2023)

Deciding minimal distinguishing DFAs is NP-complete. - Jan Martens 001 (CoRR, 2023)

Lowerbounds for Bisimulation by Partition Refinement. - Jan Friso Groote; Jan Martens 001; Erik P. de Vink (Log. Methods Comput. Sci., 2023)

Innermost many-sorted term rewriting on GPUs. - Johri van Eerd; Jan Friso Groote; Pieter Hijma; Jan Martens 001; Muhammad Osama 003; Anton Wijs (Sci. Comput. Program., 2023)

Linear parallel algorithms to compute strong and branching bisimilarity. - Jan Martens 001; Jan Friso Groote; Lars B. van den Haak; Pieter Hijma; Anton Wijs (Softw. Syst. Model., 2023)

Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation. - Jan Martens 001; Jan Friso Groote (Logics and Type Systems in Theory and Practice, 2024)

Disentangling the Gap Between Quantum and #SAT. - Jingyi Mei; Jan Martens 001; Alfons Laarman (ICTAC, 2024)

An Evaluation of Massively Parallel Algorithms for DFA Minimization. - Jan Martens 001; Anton Wijs (GandALF, 2024)

A Quadratic Lower Bound for Simulation. - Jan Friso Groote; Jan Martens 001 (CoRR, 2024)