Author:
Chatterjee Krishnendu,Łącki Jakub
Publisher
Springer Berlin Heidelberg
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Bounded Pathwidth of Control-Flow Graphs;Proceedings of the ACM on Programming Languages;2023-10-16
2. Efficient approximations for cache-conscious data placement;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09
3. Witnessing Subsystems for Probabilistic Systems with Low Tree Width;Electronic Proceedings in Theoretical Computer Science;2021-09-17
4. A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Faster algorithms for quantitative verification in bounded treewidth graphs;Formal Methods in System Design;2021-04-29