Efficient Computation of Recurrence Diameters
No abstract available.
Related papers
- A Formal Disproof of Hirsch Conjecture CPP 2023
- Provably Fast and Space-Efficient Parallel Biconnectivity PPoPP 2023
- Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking TACAS 2019
- Automatic Recognition of Induction Variables and Recurrence Relations by Abstract Interpretation PLDI 1990
- On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches CAV 2024
- Scalable GPU graph traversal PPoPP 2012
- UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees PPoPP 2026
- Solving Conditional Linear Recurrences for Program Verification: The Periodic Case OOPSLA 2023