Searching for "Balanced Ordered Trees." – sorted by Relevance.
-
The scientific works of Rainer Kemp (1949–2004)
- considers 0–balanced ordered trees (=all leaves are on the same level): the number of these with n nodes, m
- Cited by 1 (0 self) – Add To MetaCart
-
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems
- through balanced ordered trees giving extra cost I = O(log s). Cfa introduces O(jpj 2 ) constraints
- Cited by 18 (8 self) – Add To MetaCart

