822 search results - page 4 / 165 » Descendants in Increasing Trees |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
EJC
2008
13 years 5 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 ...
Publication
A new Blink Tree latching method and protocol simplifies implementation of Lehman and Yao's high
concurrency Blink Tree with Jaluta's balanced Blink Tree methods with in...
JCT
2011
13 years 18 days ago
2011
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the c...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...