Results 41 to 50 of about 1,378,752 (293)
Combinatorics of non-ambiguous trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault ...
Jean-Christophe Aval +3 more
doaj +1 more source
, 1996 A longer and updated version of this paper appears in: Shenoy, P. P., "Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture," International Journal of Approximate Reasoning, 17(2--3), 1997, 239--263 (available from .The main goal ...
Shenoy, Prakash P.
core +1 more source
Theory exploration of binary trees [PDF]
2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY), 2015 The construction of a theory for binary trees is presented, based on the systematic exploration of the properties necessary for the proof-based synthesis and certification of sorting algorithms for binary trees. The process is computer supported, being realised in the frame of the Theorema system, with some additional proofs in Coq required for ...
Isabela Dramnesc +2 more
openaire +3 more sources
Characterization of binary trees [PDF]
In "Level Number Sequences for Trees" Flagotet and Prodinger investigate the problem of counting the number of level number sequences associated to binary trees of $n$ binary nodes. I convert this problem into terms of exterior nodes or "leaves" and leaf
Brandstetter, Griffin
core +4 more sources
The height of q-Binary Search Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
Michael Drmota, Helmut Prodinger
doaj +3 more sources
Right-cancellability of a family of operations on binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 We prove some new results on a family of operations on binary trees, some of which are similar to addition, multiplication and exponentiation for natural numbers. The main result is that each operation in the family is right-cancellable.
Philippe Duchon
doaj +1 more source
Combining Binary Search Trees [PDF]
, 2013 12 pages, 2 figures, ICALP ...
Erik D. Demaine +3 more
openaire +7 more sources
Counting smaller trees in the Tamari order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We introduce new combinatorial objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton ...
Grégory Chatel, Viviane Pons
doaj +1 more source
Generation of Valid Labeled Binary Trees
, 2003 International audienceGenerating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of
Effantin, Brice
core +5 more sources
Two bijections on Tamari Intervals [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We use a recently introduced combinatorial object, the $\textit{interval-poset}$, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results.
Frédéric Chapoton +2 more
doaj +1 more source