TcT
From MaRDI portal
Software:55526
swMATH39826MaRDI QIDQ55526FDOQ55526
Author name not available (Why is that?)
Cited In (10)
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Complexity analysis for term rewriting by integer transition systems
- Runtime complexity analysis of logically constrained rewriting
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Title not available (Why is that?)
- A Perron-Frobenius theorem for deciding matrix growth
- Constant runtime complexity of term rewriting is semi-decidable
- Lower bounds for runtime complexity of term rewriting
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
This page was built for software: TcT
