The following publications are possibly variants of this publication:
- Faster algorithms for quantitative verification in bounded treewidth graphsKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. fmsd, 57(3):401-428, 2021. [doi]
- Quantitative Verification on Product Graphs of Small TreewidthKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. fsttcs 2021: [doi]
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant TreewidthKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal. POPL 2015: 97-109 [doi]
- Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant TreewidthKrishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. TOPLAS, 41(4), 2019. [doi]
- Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small TreewidthAli Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis. ATVA 2020: 253-270 [doi]