Jan Martens

Orcid: 0000-0003-4797-7735

Affiliations:
  • Eindhoven University of Technology, The Netherlands


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

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

2024
Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation.
Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023
Linear parallel algorithms to compute strong and branching bisimilarity.
Softw. Syst. Model., April, 2023

Innermost many-sorted term rewriting on GPUs.
Sci. Comput. Program., 2023

Lowerbounds for Bisimulation by Partition Refinement.
Log. Methods Comput. Sci., 2023

Deciding minimal distinguishing DFAs is NP-complete.
CoRR, 2023

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2021
Term Rewriting on GPUs.
Proceedings of the Fundamentals of Software Engineering - 9th International Conference, 2021

A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

Bisimulation by Partitioning Is Ω((m+n)log n).
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Regular Resynchronizability of Origin Transducers Is Undecidable.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020


  Loading...