TOIS
2002
13 years 4 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
IPL
2002
13 years 4 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
IJAC
2007
13 years 4 months ago
2007
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
EJC
2008
13 years 4 months ago
2008
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
DM
2008
13 years 4 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
ALENEX
2009
13 years 5 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
FODO
1989
Springer
13 years 8 months ago
1989
Springer
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...
ECSQARU
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
SIGMOD
2005
ACM
13 years 10 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...