Jan Martens

According to our database, Jan Martens authored at least 17 papers between 2020 and 2026.

Collaborative distances:

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

2026

Faster Signature Refinement for Branching Bisimilarity Minimization.

Jan Martens, Maurice Laveaux

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

Minimal DFAs Witnessing Language Inequivalence.

Jan Martens

Proceedings of the 34th EACSL Annual Conference on Computer Science Logic, 2026

A Quadratic Lower Bound for Simulation.

Jan Friso Groote, Jan Martens

Proceedings of the Juggling Formal Methods and Security, 2026

2025

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking.

Jan Heemstra, Jan Martens, Anton Wijs

CoRR, August, 2025

Uniformity Within Parameterized Circuit Classes.

Steef Hegeman, Jan Martens, Alfons Laarman

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

2024

An Evaluation of Massively Parallel Algorithms for DFA Minimization.

Jan Martens, Anton Wijs

Proceedings of the Proceedings Fifteenth International Symposium on Games, 2024

Disentangling the Gap Between Quantum and #SAT.

Jingyi Mei, Jan Martens, Alfons Laarman

Proceedings of the Theoretical Aspects of Computing - ICTAC 2024, 2024

Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation.

Jan Martens, Jan Friso Groote

Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023

Linear parallel algorithms to compute strong and branching bisimilarity.

Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs

Softw. Syst. Model., April, 2023

Innermost many-sorted term rewriting on GPUs.

Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Muhammad Osama, Anton Wijs

Sci. Comput. Program., 2023

Lowerbounds for Bisimulation by Partition Refinement.

Jan Friso Groote, Jan Martens, Erik P. de Vink

Log. Methods Comput. Sci., 2023

Deciding minimal distinguishing DFAs is NP-complete.

Jan Martens

CoRR, 2023

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.

Jan Martens, Jan Friso Groote

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2021

Term Rewriting on GPUs.

Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Anton Wijs

Proceedings of the Fundamentals of Software Engineering - 9th International Conference, 2021

A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions.

Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs

Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

Bisimulation by Partitioning Is Ω((m+n)log n).

Jan Friso Groote, Jan Martens, Erik P. de Vink

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Regular Resynchronizability of Origin Transducers Is Undecidable.

Denis Kuperberg, Jan Martens

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020