Jan Martens

24 papers B 5C 1Journal 12Unranked 6
YearRankTypeTitle / Venue / Authors
2026 — conf
A Quadratic Lower Bound for Simulation.
Juggling Formal Methods and Security
Jan Friso Groote, Jan Martens
2026 — conf
Faster Signature Refinement for Branching Bisimilarity Minimization.
TACAS (1)
Jan Martens, Maurice Laveaux
2026 B conf
Minimal DFAs Witnessing Language Inequivalence.
CSL
Jan Martens
2025 J jnl
Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking.
CoRR
Jan Heemstra, Jan Martens, Anton Wijs
2025 B conf
Uniformity Within Parameterized Circuit Classes.
IPEC
Steef Hegeman, Jan Martens, Alfons Laarman
2025 J jnl
Uniformity within Parameterized Circuit Classes.
CoRR
Steef Hegeman, Jan Martens, Alfons Laarman
2024 J jnl
A Quadratic Lower Bound for Simulation.
CoRR
Jan Friso Groote, Jan Martens
2024 — conf
An Evaluation of Massively Parallel Algorithms for DFA Minimization.
GandALF
Jan Martens, Anton Wijs
2024 C conf
Disentangling the Gap Between Quantum and #SAT.
ICTAC
Jingyi Mei, Jan Martens, Alfons Laarman
2024 — conf
Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation.
Logics and Type Systems in Theory and Practice
Jan Martens, Jan Friso Groote
2023 B conf
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.
CONCUR
Jan Martens, Jan Friso Groote
2023 J jnl
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable.
CoRR
Jan Martens, Jan Friso Groote
2023 J jnl
Deciding minimal distinguishing DFAs is NP-complete.
CoRR
Jan Martens
2023 J jnl
Innermost many-sorted term rewriting on GPUs.
Sci. Comput. Program.
Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Muhammad Osama, Anton Wijs
2023 J jnl
Linear parallel algorithms to compute strong and branching bisimilarity.
Softw. Syst. Model.
Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs
2023 J jnl
Lowerbounds for Bisimulation by Partition Refinement.
Log. Methods Comput. Sci.
Jan Friso Groote, Jan Martens, Erik P. de Vink
2022 J jnl
Lowerbounds for Bisimulation by Partition Refinement.
CoRR
Jan Friso Groote, Jan Martens, Erik P. de Vink
2021 — conf
A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions.
FACS
Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs
2021 J jnl
A linear parallel algorithm to compute bisimulation and relational coarsest partitions.
CoRR
Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs
2021 B conf
Bisimulation by Partitioning Is Ω((m+n)log n).
CONCUR
Jan Friso Groote, Jan Martens, Erik P. de Vink
2021 — conf
Term Rewriting on GPUs.
FSEN
Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Anton Wijs
2020 B conf
Regular Resynchronizability of Origin Transducers Is Undecidable.
MFCS
Denis Kuperberg, Jan Martens
2020 J jnl
Regular resynchronizability of origin transducers is undecidable.
CoRR
Denis Kuperberg, Jan Martens
2020 J jnl
Term Rewriting on GPUs.
CoRR
Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Anton Wijs