A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
No abstract available.
Related papers
- Simulation as Coarsest Partition Problem TACAS 2002
- Parallel SMT Solving via Iterative Tree Partitioning TACAS 2026
- Partitioning Dataflow Analyses Using Types POPL 1997
- Forward and Backward Constrained Bisimulations for Quantum Circuits TACAS 2024
- Compositional virtual timelines: verifying dynamic-priority partitions with algorithmic temporal isolation OOPSLA 2022
- Stream-K: Work-Centric Parallel Decomposition for Dense Matrix-Matrix Multiplication on the GPU PPoPP 2023
- High Performance FORTRAN for Highly Unstructured Problems PPoPP 1997
- Optimal DNN primitive selection with partitioned boolean quadratic programming CGO 2018