default search action
Jan Martens 0001
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Other persons with the same name
- Jan Martens
- Jan Martens 0002 — RWTH Aachen University, Germany
- Jan Martens 0003 — Max-Planck-Institut für Informatik, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Jan Martens
, Jan Friso Groote
Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation. Logics and Type Systems in Theory and Practice 2024: 188-202 - [i7]Jan Martens, Anton Wijs:
An Evaluation of Massively Parallel Algorithms for DFA Minimization. CoRR abs/2410.22764 (2024) - 2023
- [j3]Jan Friso Groote
Lowerbounds for Bisimulation by Partition Refinement. Log. Methods Comput. Sci. 19(2) (2023) - [j2]Johri van Eerd, Jan Friso Groote
Innermost many-sorted term rewriting on GPUs. Sci. Comput. Program. 225: 102910 (2023) - [j1]Jan Martens
Linear parallel algorithms to compute strong and branching bisimilarity. Softw. Syst. Model. 22(2): 521-545 (2023) - [c5]Jan Martens, Jan Friso Groote:
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. CONCUR 2023: 32:1-32:17 - [i6]Jan Martens:
Deciding minimal distinguishing DFAs is NP-complete. CoRR abs/2306.03533 (2023) - [i5]Jan Martens, Jan Friso Groote:
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable. CoRR abs/2307.05265 (2023) - 2022
- [i4]Jan Friso Groote, Jan Martens, Erik P. de Vink:
Lowerbounds for Bisimulation by Partition Refinement. CoRR abs/2203.07158 (2022) - 2021
- [c4]Jan Friso Groote, Jan Martens, Erik P. de Vink:
Bisimulation by Partitioning Is Ω((m+n)log n). CONCUR 2021: 31:1-31:16 - [c3]Jan Martens
A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions. FACS 2021: 115-133 - [c2]Johri van Eerd, Jan Friso Groote
Term Rewriting on GPUs. FSEN 2021: 175-189 - [i3]Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma, Anton Wijs:
A linear parallel algorithm to compute bisimulation and relational coarsest partitions. CoRR abs/2105.11788 (2021) - 2020
- [c1]Denis Kuperberg
Regular Resynchronizability of Origin Transducers Is Undecidable. MFCS 2020: 58:1-58:14 - [i2]Denis Kuperberg, Jan Martens:
Regular resynchronizability of origin transducers is undecidable. CoRR abs/2002.07558 (2020) - [i1]Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Anton Wijs:
Term Rewriting on GPUs. CoRR abs/2009.07174 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: