Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
From MaRDI portal
Publication:6487331
DOI10.1007/978-3-031-13188-2_4zbMATH Open1514.68049MaRDI QIDQ6487331FDOQ6487331
Authors: Lorenz Leutgeb, Georg Moser, Florian Zuleger 
Publication date: 7 December 2022
Recommendations
Cites Work
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Self-adjusting binary search trees
- Title not available (Why is that?)
- A probabilistic PDL
- Title not available (Why is that?)
- Probability and Computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantics of probabilistic programs
- Types and programing languages
- Randomized binary search trees
- Amortized Computational Complexity
- A systematic analysis of splaying
- Amortized complexity verified
- Automated termination analysis of polynomial probabilistic programs
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
- Term Rewriting and Applications
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Foundations of Probabilistic Programming
- Title not available (Why is that?)
- Randomized splay trees: Theoretical and experimental results.
- On probabilistic term rewriting
- Verified analysis of random binary tree structures
- Automated recurrence analysis for almost-linear expected-runtime bounds
- Ranking and repulsing supermartingales for reachability in probabilistic programs
- Type-based analysis of logarithmic amortised complexity
Cited In (3)
This page was built for publication: Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487331)
