4137 search results - page 52 / 828 » On the number of matchings of a tree |
108
Voted
EJC
2008
15 years 1 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 ...
93
Voted
JCM
2006
15 years 1 months ago
2006
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
121
Voted
MIDDLEWARE
2005
Springer
15 years 7 months ago
2005
Springer
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in su...
132
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
115
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...