656 search results - page 15 / 132 » Marrying Words and Trees |
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
84
Voted
COMPSAC
2006
IEEE
15 years 1 months ago
2006
IEEE
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
SODA
1997
ACM
14 years 10 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
ALGORITHMICA
1999
14 years 9 months ago
1999
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 ...