We stand with Ukraine  

Jan Martens

Orcid: 0000-0003-4797-7735

Affiliations:
  • Leiden University, Faculty of Science, Leiden Institute of Advanced Computer Science, Leiden, The Netherlands
  • Eindhoven University of Technology, The Netherlands


According to our database1, Jan Martens authored at least 15 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Uniformity within Parameterized Circuit Classes.
[BibTeX]
[DOI]
Steef Hegeman
,
Jan Martens
,
Alfons Laarman
CoRR, September, 2025

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking.
[BibTeX]
[DOI]
Jan Heemstra
,
Jan Martens
,
Anton Wijs
CoRR, August, 2025

2024
A Quadratic Lower Bound for Simulation.
[BibTeX]
[DOI]
Jan Friso Groote
,
Jan Martens
CoRR, 2024

An Evaluation of Massively Parallel Algorithms for DFA Minimization.
[BibTeX]
[DOI]
Jan Martens
,
Anton Wijs
Proceedings of the Proceedings Fifteenth International Symposium on Games, 2024

Disentangling the Gap Between Quantum and #SAT.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Johri van Eerd
,
Jan Friso Groote
,
Pieter Hijma
,
Jan Martens
,
Muhammad Osama
,
Anton Wijs
Sci. Comput. Program., 2023

Lowerbounds for Bisimulation by Partition Refinement.
[BibTeX]
[DOI]
Jan Friso Groote
,
Jan Martens
,
Erik P. de Vink
Log. Methods Comput. Sci., 2023

Deciding minimal distinguishing DFAs is NP-complete.
[BibTeX]
[DOI]
Jan Martens
CoRR, 2023

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.
[BibTeX]
[DOI]
Jan Martens
,
Jan Friso Groote
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2021
Term Rewriting on GPUs.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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).
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Denis Kuperberg
,
Jan Martens
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020


  Loading...