Author:
Lazić Ranko,Schmitz Sylvain
Funder
Engineering and Physical Sciences Research Council
Leverhulme Trust
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference40 articles.
1. Algorithmic analysis of programs with well quasi-ordered domains;Abdulla;Inf. Comput.,2000
2. Well-structured transition systems everywhere!;Finkel;Theor. Comput. Sci.,2001
3. Ackermannian and primitive-recursive bounds with Dickson's lemma;Figueira,2011
4. Multiply-recursive upper bounds with Higman's lemma;Schmitz,2011
5. Ordinal recursive complexity of unordered data nets;Rosa-Velardo;Inf. Comput.,2017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Soundness of reset workflow nets;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A State-of-the-Art Karp-Miller Algorithm Certified in Coq;Lecture Notes in Computer Science;2024