Chini, Peter; Meyer, Roland; Saivasan, Prakash Fine-grained complexity of safety verification. (English) Zbl 1468.68121 J. Autom. Reasoning 64, No. 7, 1419-1444 (2020). MSC: 68Q60 68N30 68Q17 68Q27 68Q85 68W40 PDFBibTeX XMLCite \textit{P. Chini} et al., J. Autom. Reasoning 64, No. 7, 1419--1444 (2020; Zbl 1468.68121) Full Text: DOI
Chini, Peter; Kolberg, Jonathan; Krebs, Andreas; Meyer, Roland; Saivasan, Prakash On the complexity of bounded context switching. (English) Zbl 1442.68073 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 27, 15 p. (2017). MSC: 68Q27 68Q17 68Q60 68Q85 PDFBibTeX XMLCite \textit{P. Chini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 27, 15 p. (2017; Zbl 1442.68073) Full Text: DOI arXiv
Fernau, Henning; Krebs, Andreas Problems on finite automata and the exponential time hypothesis. (English) Zbl 1461.68101 Algorithms (Basel) 10, No. 1, Paper No. 24, 25 p. (2017). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{A. Krebs}, Algorithms (Basel) 10, No. 1, Paper No. 24, 25 p. (2017; Zbl 1461.68101) Full Text: DOI
Fernau, Henning; Paramasivan, Meenakshi; Schmid, Markus L.; Vorel, Vojtěch Characterization and complexity results on jumping finite automata. (English) Zbl 1371.68148 Theor. Comput. Sci. 679, 31-52 (2017). MSC: 68Q45 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 679, 31--52 (2017; Zbl 1371.68148) Full Text: DOI arXiv