Transient features for Markovian binary trees

2009 ◽  
Author(s):  
Sophie Hautphenne ◽  
Guy Latouche ◽  
Marie-Ange Remiche
Keyword(s):  
Binary Trees

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees

2016 ◽  
Vol E99.A (6) ◽  
pp. 1067-1074 ◽  
Author(s):  
Ro-Yu WU ◽  
Jou-Ming CHANG ◽  
Sheng-Lung PENG ◽  
Chun-Liang LIU
Keyword(s):  
Gray Code ◽  
Binary Trees

A note on algebraic specification of binary trees

1980 ◽  
Vol 15 (6) ◽  
pp. 64-67 ◽  
Author(s):  
Abha Moitra
Keyword(s):  
Binary Trees ◽  
Algebraic Specification

Load Balancing in Mesh-like Computations using Prediction Binary Trees

2008 ◽  
Author(s):  
Biagio Cosenza ◽  
Gennaro Cordasco ◽  
Rosario De Chiara ◽  
Ugo Erra ◽  
Vittorio Scarano
Keyword(s):  
Load Balancing ◽  
Binary Trees

scholarly journals Efficient random sampling of binary and unary-binary trees via holonomic equations

2017 ◽  
Vol 695 ◽  
pp. 42-53
Author(s):  
Axel Bacher ◽  
Olivier Bodini ◽  
Alice Jacquot
Keyword(s):  
Random Sampling ◽  
Binary Trees

scholarly journals The Distribution of Heights of Binary Trees and Other Simple Trees

1993 ◽  
Vol 2 (2) ◽  
pp. 145-156 ◽  
Author(s):  
Philippe Flajolet ◽  
Zhicheng Gao ◽  
Andrew Odlyzko ◽  
Bruce Richmond
Keyword(s):  
Asymptotic Formula ◽  
Positive Constant ◽  
Binary Trees ◽  
Asymptotic Results ◽  
Image Position

The number, , of rooted plane binary trees of height ≤ h with n internal nodes is shown to satisfyuniformly for δ−1(log n)−1/2 ≤ β ≤ δ(log n)1/2, where and δ is a positive constant. An asymptotic formula for is derived for h = cn, where 0 < c < 1. Bounds for are also derived for large and small heights. The methods apply to any simple family of trees, and the general asymptotic results are stated.

scholarly journals On growing random binary trees

1984 ◽  
Vol 103 (2) ◽  
pp. 461-480 ◽  
Author(s):  
Boris Pittel
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

Protein Classification Based on Propagation of Unrooted Binary Trees

2008 ◽  
Vol 15 (5) ◽  
pp. 428-434 ◽  
Author(s):  
Andras Kocsor ◽  
Robert Busa-Fekete ◽  
Sandor Pongor
Keyword(s):  
Binary Trees ◽  
Protein Classification

Tight Upper and Lower Bounds on the Path Length of Binary Trees

1994 ◽  
Vol 23 (1) ◽  
pp. 12-23 ◽  
Author(s):  
Alfredo De Santis ◽  
Giuseppe Persiano
Keyword(s):  
Lower Bounds ◽  
Path Length ◽  
Binary Trees ◽  
Upper And Lower Bounds

Compact Storage of Binary Trees

1982 ◽  
Vol 4 (3) ◽  
pp. 345-361
Author(s):  
Paolo Sipala
Keyword(s):  
Binary Trees
Sign in / Sign up

Export Citation Format

Share Document