Average-case analysis of pattern-matching in trees under the BST probability model
From MaRDI portal
Publication:4632425
DOI10.1007/3-540-58201-0_67zbMath1422.68142OpenAlexW1560684376MaRDI QIDQ4632425
Jose Ramon Sanchez Couso, María-Inés Fernández-Camacho
Publication date: 29 April 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58201-0_67
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) PDEs in connection with computer science (35Q68)
Related Items (3)
Reductions in binary search trees ⋮ The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ Average-case analysis of pattern-matching in trees under the BST probability model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation and use of data flow information in optimizing compilers
- Singularity Analysis of Generating Functions
- Patterns and pattern-matching in trees: An analysis
- A complexity calculus for recursive tree algorithms
- Pattern Matching in Trees
- On the Average Size of the Intersection of Binary Trees
- Average-case analysis of pattern-matching in trees under the BST probability model
This page was built for publication: Average-case analysis of pattern-matching in trees under the BST probability model
