Results 1 to 10 of about 1,259,069 (138)
The algebra of binary search trees
Theoretical Computer Science, 2005 49 ...
Hivert, Florent +2 more
exaly +5 more sources
The Maximum Binary Tree Problem [PDF]
Algorithmica, 2021 to be published in European Symposium on Algorithms ...
Karthekeyan Chandrasekaran +5 more
openaire +6 more sources
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
The universal homogeneous binary tree [PDF]
Journal of Logic and Computation, 2018 25 ...
Manuel Bodirsky +3 more
openaire +5 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
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
Combining Binary Search Trees [PDF]
, 2013 12 pages, 2 figures, ICALP ...
Erik D. Demaine +3 more
openaire +7 more sources
Pointed Binary Encompassing Trees [PDF]
, 2004 We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T, that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v $\in$ T is pointed, that is, v has an incident angle greater than $\pi$.
Michael Hoffmann 0001 +2 more
openaire +3 more sources
The Geometry of Binary Search Trees [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 info:eu-repo/semantics ...
Demaine, Erik D. +4 more
openaire +2 more sources