Results 31 to 40 of about 1,378,752 (293)
On Succinct Representations of Binary Trees [PDF]
Mathematics in Computer Science, 2017 Journal version of part of COCOON 2012 ...
Pooya Davoodi +2 more
openaire +3 more sources
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +1 more source
, 1976 Binary Trees are examined comb ina tori ally with the view of providing information useful in analyzing algorithms based on this widely used storage structure.
Bruno O. Shubert +3 more
core +2 more sources
Supernode Binary Search Trees [PDF]
International Journal of Foundations of Computer Science, 2003 Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established.
Haejae Jung, Sartaj Sahni
openaire +1 more source
Grid Drawings of Binary Trees: An Experimental Study
Journal of Graph Algorithms and Applications, 2008 In this paper we consider the class of binary trees and present the results of a comprehensive experimental study on the four most representative algorithms for drawing trees, one for each of the following tree-drawing approaches: Separation-Based, Path-
Adrian Rusu, Confesor Santiago
doaj +1 more source
The Cambrian Hopf Algebra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees.
G. Chatel, V. Pilaud
doaj +1 more source
The algebra of binary trees is affine complete [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet containing at ...
Andre Arnold +3 more
doaj +1 more source
Topological and categorical properties of binary trees
Applied General Topology, 2008 Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements.
H. Pajoohesh
doaj +1 more source
The universal homogeneous binary tree [PDF]
Journal of Logic and Computation, 2018 25 ...
Manuel Bodirsky +3 more
openaire +5 more sources
Biology, 2023 In this article, we propose a comparative study between two models that can be used by researchers for the analysis of survival data: (i) the Weibull regression model and (ii) the random survival forest (RSF) model.
Thalytta Cavalcante +4 more
doaj +1 more source