Sciweavers

785 search results - page 4 / 157
» Binary Join Trees
Sort
View
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
14 years 9 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
APWEB
2004
Springer
15 years 3 months ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
ALGORITHMICA
1999
87views more  ALGORITHMICA 1999»
14 years 9 months ago
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
Kevin Atteson
CADE
1998
Springer
15 years 1 months ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer
FODO
1989
Springer
268views Algorithms» more  FODO 1989»
15 years 1 months ago
The Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
Rolf Klein, Derick Wood