| A linear parallel algorithm to compute bisimulation and relational coarsest partitions J Martens, JF Groote, L van den Haak, P Hijma, A Wijs Formal Aspects of Component Software: 17th International Conference, FACS …, 2021 | 16 | 2021 |
| Term rewriting on GPUs J Van Eerd, JF Groote, P Hijma, J Martens, A Wijs International Conference on Fundamentals of Software Engineering, 175-189, 2021 | 7 | 2021 |
| Bisimulation by Partitioning Is Ω ((m+ n) log n) JF Groote, J Martens, E de Vink 32nd International Conference on Concurrency Theory (CONCUR 2021), 31: 1-31: 16, 2021 | 6 | 2021 |
| Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation J Martens, JF Groote Logics and Type Systems in Theory and Practice: Essays Dedicated to Herman …, 2024 | 4 | 2024 |
| Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable J Martens, JF Groote 34th International Conference on Concurrency Theory (CONCUR 2023) 279, 32:1 …, 2023 | 4 | 2023 |
| Lowerbounds for bisimulation by partition refinement JF Groote, J Martens, EP de Vink Logical Methods in Computer Science 19, 2023 | 4 | 2023 |
| Innermost many-sorted term rewriting on GPUs J van Eerd, JF Groote, P Hijma, J Martens, M Osama, A Wijs Science of Computer Programming 225, 102910, 2023 | 4 | 2023 |
| Linear parallel algorithms to compute strong and branching bisimilarity J Martens, JF Groote, LB Haak, P Hijma, A Wijs Software and Systems Modeling 22 (2), 521-545, 2023 | 3 | 2023 |
| Regular resynchronizability of origin transducers is undecidable D Kuperberg, J Martens 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 3 | 2020 |
| An Evaluation of Massively Parallel Algorithms for DFA Minimization J Martens, A Wijs arXiv preprint arXiv:2410.22764, 2024 | 1 | 2024 |
| Deciding minimal distinguishing DFAs is NP-complete J Martens arXiv preprint arXiv:2306.03533, 2023 | 1 | 2023 |
| Disentangling the Gap Between Quantum and# SAT J Mei, J Martens, A Laarman International Colloquium on Theoretical Aspects of Computing, 17-40, 2024 | | 2024 |
| A Quadratic Lower Bound for Simulation JF Groote, J Martens arXiv preprint arXiv:2411.14067, 2024 | | 2024 |
| A Quadratic Lower Bound for Simulation J Friso Groote, J Martens arXiv e-prints, arXiv: 2411.14067, 2024 | | 2024 |
| The Complexity of Bisimilarity by Partition Refinement JJM Martens | | 2024 |
| The Complexity of Bisimilarity by Partition Refinement: lowerbounds, distinguishing formulas, and parallel algorithms JJM Martens | | 2024 |
| Check for updates J Martens, JFG ID iD Logics and Type Systems in Theory and Practice: Essays Dedicated to Herman …, 2024 | | 2024 |
| 34th International Conference on Concurrency Theory: CONCUR 2023, September 18-23, 2023, Antwerp, Belgium GA Pérez, JF Raskin Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| Lowerbounds for Bisimulation by Partition Refinement J Friso Groote, J Martens, EP de Vink arXiv e-prints, arXiv: 2203.07158, 2022 | | 2022 |
| Resynchronizability of origin transducers J Martens, D Kuperberg, H Geuvers, J Rot | | 2019 |