Ackermannian and primitive-recursive bounds with Dickson's Lemma. Figueira D, Figueira S, Schmitz S. D Figueira, S Figueira, S Schmitz… - 2011 IEEE 26th …, 2011 - ieeexplore.ieee.org GSID: bwY0qBbLV9AJ
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. [No authors listed] P Schnoebelen - … Symposium on Mathematical Foundations of Computer …, 2010 - Springer GSID: dK5ZFMhYKqcJ
Demystifying reachability in vector addition systems. Leroux J, Schmitz S. J Leroux, S Schmitz - 2015 30th Annual ACM/IEEE Symposium …, 2015 - ieeexplore.ieee.org GSID: SQ9Hn33BqekJ
HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms. Muntz RR. Y Chi, Y Yang, RR Muntz - Proceedings. 16th International …, 2004 - ieeexplore.ieee.org GSID: O2qI6Qykt7kJ
The reachability problem for Petri nets is not elementary. Czerwiński W, Lasota S, Lazić R, Leroux J. W Czerwiński, S Lasota, R Lazić, J Leroux… - Journal of the ACM …, 2020 - dl.acm.org GSID: 0DhwX5dyeGkJ
