Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

73

Voted

COMBINATORICA
2010

favoriteEmaildiscussreport

130views Machine Learning» more COMBINATORICA 2010»

New hook length formulas for binary trees

14 years 7 months ago

New hook length formulas for binary trees

Download www-irma.u-strasbg.fr

Guo-Niu Han

Real-time Traffic

COMBINATORICA 2010 | Machine Learning |

claim paper

Related Content

» On Postnikovs hook length formula for binary trees

» The weighted hook length formula

» Approximating Optimal Binary Decision Trees

» New Parallel Domain Extenders for UOWHF

» New Algorithm for Weak Monadic SecondOrder Logic on Inductive Structures

» Tree Extension Algebras Logics Automata and Query Languages

» Scalar Prefix Search A New Route Lookup Algorithm for Next Generation Internet

» Characterizing EF and EX Tree Logics

» Better Burst Detection

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	COMBINATORICA
Authors	Guo-Niu Han

Comments (0)