Jan Martens

According to our database, Jan Martens authored at least 10 papers between 2020 and 2024.

Collaborative distances:

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

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