The effects of semantic simplifications on random \textit{BST}-like expression-trees

DOI10.1016/j.disc.2024.113906OpenAlexW4391424474WikidataQ128886150 ScholiaQ128886150MaRDI QIDQ6124452

Florent Koechlin, Pablo Rotondo

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113906

zbMATH Keywords

analytic combinatoricssimplification of expressionsabsorbing patternBST trees

Mathematics Subject Classification ID

Theory of data (68Pxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average-case analysis on simple families of trees using a balanced probability model
• Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
• Differentiably finite power series
• The average height of binary trees and other simple trees
• Reductions in binary search trees
• Associative and commutative tree representations for Boolean functions
• Singularity Analysis of Generating Functions
• On the Average Size of Glushkov’s Automata
• A note on the height of binary search trees
• Average-case analysis of pattern-matching in trees under the BST probability model
• Area and Inertial Moment of Dyck Paths
• And/or trees: A local limit point of view
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
• The growing tree distribution on Boolean functions.
• Complex analysis. Transl. from the German by Dan Fulea
• Simplifications of Uniform Expressions Specified by Systems

This page was built for publication: The effects of semantic simplifications on random \textit{BST}-like expression-trees