Pages that link to "Item:Q2151240"
From MaRDI portal
The following pages link to Automated recurrence analysis for almost-linear expected-runtime bounds (Q2151240):
Displaying 10 items.
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Automatic Analysis of Expected Termination Time for Population Protocols (Q5009451) (← links)
- Parameterized and Exact Computation (Q5311517) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (Q6487331) (← links)
- Automated tail bound analysis for probabilistic recurrence relations (Q6535678) (← links)
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs (Q6649432) (← links)